/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 12:41:37,553 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:41:37,555 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:41:37,567 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:41:37,567 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:41:37,568 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:41:37,569 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:41:37,571 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:41:37,573 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:41:37,573 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:41:37,574 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:41:37,575 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:41:37,575 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:41:37,576 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:41:37,577 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:41:37,578 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:41:37,579 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:41:37,580 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:41:37,582 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:41:37,584 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:41:37,585 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:41:37,587 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:41:37,588 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:41:37,588 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:41:37,592 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:41:37,592 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:41:37,592 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:41:37,593 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:41:37,594 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:41:37,595 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:41:37,595 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:41:37,596 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:41:37,596 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:41:37,597 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:41:37,598 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:41:37,598 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:41:37,599 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:41:37,599 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:41:37,599 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:41:37,600 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:41:37,601 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:41:37,601 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 12:41:37,616 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:41:37,616 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:41:37,617 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:41:37,618 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:41:37,618 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:41:37,618 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:41:37,618 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:41:37,618 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:41:37,619 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:41:37,619 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:41:37,619 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:41:37,619 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:41:37,619 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:41:37,619 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:41:37,620 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:41:37,620 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:41:37,620 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:41:37,620 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:41:37,620 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:41:37,620 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:41:37,621 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:41:37,621 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:41:37,621 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:41:37,621 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:41:37,621 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:41:37,622 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:41:37,622 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:41:37,622 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:41:37,622 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:41:37,791 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:41:37,805 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:41:37,808 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:41:37,809 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:41:37,810 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:41:37,810 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 12:41:37,876 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_m5qICV/tmp/6c350f29380f42e3bf6e079cda32cef9/FLAGbb17dca25 [2020-07-01 12:41:38,216 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:41:38,217 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 12:41:38,217 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:41:38,223 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_m5qICV/tmp/6c350f29380f42e3bf6e079cda32cef9/FLAGbb17dca25 [2020-07-01 12:41:38,621 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_m5qICV/tmp/6c350f29380f42e3bf6e079cda32cef9 [2020-07-01 12:41:38,632 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:41:38,634 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:41:38,635 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:41:38,635 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:41:38,639 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:41:38,640 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:41:38" (1/1) ... [2020-07-01 12:41:38,644 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@388852d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:41:38, skipping insertion in model container [2020-07-01 12:41:38,644 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:41:38" (1/1) ... [2020-07-01 12:41:38,652 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:41:38,669 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:41:38,892 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:41:38,903 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:41:38,922 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:41:38,937 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:41:38,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:41:38 WrapperNode [2020-07-01 12:41:38,938 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:41:38,939 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:41:38,939 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:41:38,939 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:41:38,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:41:38" (1/1) ... [2020-07-01 12:41:38,956 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:41:38" (1/1) ... [2020-07-01 12:41:38,978 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:41:38,979 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:41:38,979 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:41:38,979 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:41:38,988 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:41:38" (1/1) ... [2020-07-01 12:41:38,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:41:38" (1/1) ... [2020-07-01 12:41:38,990 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:41:38" (1/1) ... [2020-07-01 12:41:38,991 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:41:38" (1/1) ... [2020-07-01 12:41:38,996 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:41:38" (1/1) ... [2020-07-01 12:41:39,001 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:41:38" (1/1) ... [2020-07-01 12:41:39,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:41:38" (1/1) ... [2020-07-01 12:41:39,004 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:41:39,005 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:41:39,005 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:41:39,005 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:41:39,006 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:41:38" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:41:39,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:41:39,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:41:39,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:41:39,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 12:41:39,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:41:39,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:41:39,338 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:41:39,339 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-01 12:41:39,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:41:39 BoogieIcfgContainer [2020-07-01 12:41:39,343 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:41:39,344 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:41:39,344 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:41:39,346 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:41:39,347 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:41:39" (1/1) ... [2020-07-01 12:41:39,366 INFO L313 BlockEncoder]: Initial Icfg 32 locations, 37 edges [2020-07-01 12:41:39,368 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:41:39,369 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:41:39,369 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:41:39,370 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:41:39,372 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:41:39,373 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:41:39,373 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:41:39,397 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:41:39,423 INFO L200 BlockEncoder]: SBE split 13 edges [2020-07-01 12:41:39,428 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-07-01 12:41:39,430 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:41:39,477 INFO L100 BaseMinimizeStates]: Removed 16 edges and 8 locations by large block encoding [2020-07-01 12:41:39,479 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 12:41:39,481 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:41:39,481 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:41:39,481 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:41:39,482 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:41:39,482 INFO L313 BlockEncoder]: Encoded RCFG 23 locations, 39 edges [2020-07-01 12:41:39,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:41:39 BasicIcfg [2020-07-01 12:41:39,483 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:41:39,484 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:41:39,484 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:41:39,488 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:41:39,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:41:38" (1/4) ... [2020-07-01 12:41:39,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f5288c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:41:39, skipping insertion in model container [2020-07-01 12:41:39,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:41:38" (2/4) ... [2020-07-01 12:41:39,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f5288c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:41:39, skipping insertion in model container [2020-07-01 12:41:39,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:41:39" (3/4) ... [2020-07-01 12:41:39,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f5288c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:41:39, skipping insertion in model container [2020-07-01 12:41:39,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:41:39" (4/4) ... [2020-07-01 12:41:39,493 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:41:39,504 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:41:39,512 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2020-07-01 12:41:39,527 INFO L251 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2020-07-01 12:41:39,552 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:41:39,552 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:41:39,553 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:41:39,553 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:41:39,553 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:41:39,553 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:41:39,553 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:41:39,553 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:41:39,568 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-07-01 12:41:39,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:41:39,574 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:41:39,575 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:41:39,575 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:41:39,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:41:39,581 INFO L82 PathProgramCache]: Analyzing trace with hash 163846899, now seen corresponding path program 1 times [2020-07-01 12:41:39,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:41:39,592 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192123657] [2020-07-01 12:41:39,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:41:39,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:41:39,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:41:39,765 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192123657] [2020-07-01 12:41:39,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:41:39,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:41:39,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116269580] [2020-07-01 12:41:39,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:41:39,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:41:39,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:41:39,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:41:39,793 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2020-07-01 12:41:39,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:41:39,928 INFO L93 Difference]: Finished difference Result 23 states and 39 transitions. [2020-07-01 12:41:39,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:41:39,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:41:39,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:41:39,943 INFO L225 Difference]: With dead ends: 23 [2020-07-01 12:41:39,943 INFO L226 Difference]: Without dead ends: 18 [2020-07-01 12:41:39,946 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:41:39,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-01 12:41:39,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-01 12:41:39,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-01 12:41:39,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 29 transitions. [2020-07-01 12:41:39,983 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 29 transitions. Word has length 5 [2020-07-01 12:41:39,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:41:39,983 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 29 transitions. [2020-07-01 12:41:39,983 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:41:39,984 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 29 transitions. [2020-07-01 12:41:39,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:41:39,984 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:41:39,984 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:41:39,986 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:41:39,986 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:41:39,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:41:39,987 INFO L82 PathProgramCache]: Analyzing trace with hash 163846901, now seen corresponding path program 1 times [2020-07-01 12:41:39,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:41:39,987 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532721206] [2020-07-01 12:41:39,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:41:39,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:41:40,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:41:40,026 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532721206] [2020-07-01 12:41:40,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:41:40,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:41:40,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335423010] [2020-07-01 12:41:40,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:41:40,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:41:40,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:41:40,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:41:40,029 INFO L87 Difference]: Start difference. First operand 18 states and 29 transitions. Second operand 3 states. [2020-07-01 12:41:40,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:41:40,164 INFO L93 Difference]: Finished difference Result 34 states and 53 transitions. [2020-07-01 12:41:40,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:41:40,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:41:40,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:41:40,166 INFO L225 Difference]: With dead ends: 34 [2020-07-01 12:41:40,166 INFO L226 Difference]: Without dead ends: 33 [2020-07-01 12:41:40,167 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:41:40,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-01 12:41:40,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 20. [2020-07-01 12:41:40,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-01 12:41:40,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 32 transitions. [2020-07-01 12:41:40,173 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 32 transitions. Word has length 5 [2020-07-01 12:41:40,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:41:40,173 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 32 transitions. [2020-07-01 12:41:40,173 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:41:40,173 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 32 transitions. [2020-07-01 12:41:40,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:41:40,174 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:41:40,174 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:41:40,174 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:41:40,174 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:41:40,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:41:40,175 INFO L82 PathProgramCache]: Analyzing trace with hash 163846902, now seen corresponding path program 1 times [2020-07-01 12:41:40,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:41:40,175 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452331210] [2020-07-01 12:41:40,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:41:40,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:41:40,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:41:40,221 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452331210] [2020-07-01 12:41:40,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:41:40,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:41:40,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239182212] [2020-07-01 12:41:40,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:41:40,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:41:40,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:41:40,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:41:40,223 INFO L87 Difference]: Start difference. First operand 20 states and 32 transitions. Second operand 4 states. [2020-07-01 12:41:40,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:41:40,288 INFO L93 Difference]: Finished difference Result 21 states and 32 transitions. [2020-07-01 12:41:40,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:41:40,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-07-01 12:41:40,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:41:40,290 INFO L225 Difference]: With dead ends: 21 [2020-07-01 12:41:40,290 INFO L226 Difference]: Without dead ends: 20 [2020-07-01 12:41:40,290 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:41:40,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-01 12:41:40,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-01 12:41:40,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-01 12:41:40,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 30 transitions. [2020-07-01 12:41:40,295 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 30 transitions. Word has length 5 [2020-07-01 12:41:40,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:41:40,295 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 30 transitions. [2020-07-01 12:41:40,295 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:41:40,295 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 30 transitions. [2020-07-01 12:41:40,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-01 12:41:40,296 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:41:40,296 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:41:40,296 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:41:40,296 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:41:40,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:41:40,297 INFO L82 PathProgramCache]: Analyzing trace with hash 2081015822, now seen corresponding path program 1 times [2020-07-01 12:41:40,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:41:40,297 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724382131] [2020-07-01 12:41:40,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:41:40,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:41:40,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:41:40,335 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724382131] [2020-07-01 12:41:40,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:41:40,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 12:41:40,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54019679] [2020-07-01 12:41:40,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:41:40,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:41:40,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:41:40,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:41:40,336 INFO L87 Difference]: Start difference. First operand 20 states and 30 transitions. Second operand 4 states. [2020-07-01 12:41:40,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:41:40,461 INFO L93 Difference]: Finished difference Result 62 states and 96 transitions. [2020-07-01 12:41:40,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:41:40,461 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-07-01 12:41:40,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:41:40,462 INFO L225 Difference]: With dead ends: 62 [2020-07-01 12:41:40,463 INFO L226 Difference]: Without dead ends: 47 [2020-07-01 12:41:40,463 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:41:40,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-01 12:41:40,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 21. [2020-07-01 12:41:40,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-01 12:41:40,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2020-07-01 12:41:40,469 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 31 transitions. Word has length 8 [2020-07-01 12:41:40,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:41:40,469 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 31 transitions. [2020-07-01 12:41:40,469 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:41:40,469 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 31 transitions. [2020-07-01 12:41:40,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-01 12:41:40,470 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:41:40,470 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:41:40,470 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 12:41:40,470 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:41:40,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:41:40,470 INFO L82 PathProgramCache]: Analyzing trace with hash 2081016783, now seen corresponding path program 1 times [2020-07-01 12:41:40,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:41:40,471 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432608630] [2020-07-01 12:41:40,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:41:40,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:41:40,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:41:40,514 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432608630] [2020-07-01 12:41:40,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:41:40,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:41:40,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358123438] [2020-07-01 12:41:40,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:41:40,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:41:40,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:41:40,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:41:40,516 INFO L87 Difference]: Start difference. First operand 21 states and 31 transitions. Second operand 4 states. [2020-07-01 12:41:40,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:41:40,677 INFO L93 Difference]: Finished difference Result 51 states and 72 transitions. [2020-07-01 12:41:40,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:41:40,678 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-07-01 12:41:40,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:41:40,679 INFO L225 Difference]: With dead ends: 51 [2020-07-01 12:41:40,679 INFO L226 Difference]: Without dead ends: 47 [2020-07-01 12:41:40,679 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:41:40,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-01 12:41:40,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 28. [2020-07-01 12:41:40,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-01 12:41:40,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 45 transitions. [2020-07-01 12:41:40,685 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 45 transitions. Word has length 8 [2020-07-01 12:41:40,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:41:40,686 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 45 transitions. [2020-07-01 12:41:40,686 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:41:40,686 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 45 transitions. [2020-07-01 12:41:40,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-01 12:41:40,686 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:41:40,686 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:41:40,687 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 12:41:40,687 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:41:40,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:41:40,687 INFO L82 PathProgramCache]: Analyzing trace with hash 2081016784, now seen corresponding path program 1 times [2020-07-01 12:41:40,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:41:40,688 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9039509] [2020-07-01 12:41:40,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:41:40,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:41:40,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:41:40,728 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9039509] [2020-07-01 12:41:40,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:41:40,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:41:40,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172310805] [2020-07-01 12:41:40,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:41:40,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:41:40,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:41:40,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:41:40,730 INFO L87 Difference]: Start difference. First operand 28 states and 45 transitions. Second operand 4 states. [2020-07-01 12:41:40,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:41:40,859 INFO L93 Difference]: Finished difference Result 47 states and 68 transitions. [2020-07-01 12:41:40,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:41:40,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-07-01 12:41:40,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:41:40,861 INFO L225 Difference]: With dead ends: 47 [2020-07-01 12:41:40,861 INFO L226 Difference]: Without dead ends: 43 [2020-07-01 12:41:40,861 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-01 12:41:40,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-01 12:41:40,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2020-07-01 12:41:40,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-01 12:41:40,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 41 transitions. [2020-07-01 12:41:40,867 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 41 transitions. Word has length 8 [2020-07-01 12:41:40,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:41:40,867 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 41 transitions. [2020-07-01 12:41:40,867 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:41:40,868 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 41 transitions. [2020-07-01 12:41:40,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 12:41:40,868 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:41:40,868 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:41:40,868 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 12:41:40,869 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:41:40,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:41:40,869 INFO L82 PathProgramCache]: Analyzing trace with hash 2012164351, now seen corresponding path program 1 times [2020-07-01 12:41:40,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:41:40,869 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411358421] [2020-07-01 12:41:40,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:41:40,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:41:40,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:41:40,900 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411358421] [2020-07-01 12:41:40,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:41:40,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:41:40,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362384759] [2020-07-01 12:41:40,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:41:40,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:41:40,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:41:40,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:41:40,902 INFO L87 Difference]: Start difference. First operand 28 states and 41 transitions. Second operand 3 states. [2020-07-01 12:41:40,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:41:40,947 INFO L93 Difference]: Finished difference Result 50 states and 75 transitions. [2020-07-01 12:41:40,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:41:40,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-07-01 12:41:40,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:41:40,948 INFO L225 Difference]: With dead ends: 50 [2020-07-01 12:41:40,949 INFO L226 Difference]: Without dead ends: 31 [2020-07-01 12:41:40,949 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:41:40,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-01 12:41:40,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-01 12:41:40,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-01 12:41:40,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2020-07-01 12:41:40,954 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 11 [2020-07-01 12:41:40,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:41:40,954 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2020-07-01 12:41:40,954 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:41:40,955 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2020-07-01 12:41:40,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-01 12:41:40,955 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:41:40,955 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:41:40,955 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 12:41:40,956 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:41:40,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:41:40,956 INFO L82 PathProgramCache]: Analyzing trace with hash 167847294, now seen corresponding path program 1 times [2020-07-01 12:41:40,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:41:40,956 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256787501] [2020-07-01 12:41:40,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:41:40,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:41:41,006 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:41:41,006 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256787501] [2020-07-01 12:41:41,006 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437959823] [2020-07-01 12:41:41,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:41:41,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:41:41,051 INFO L264 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 12:41:41,056 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:41:41,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:41:41,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 12:41:41,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2020-07-01 12:41:41,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965058524] [2020-07-01 12:41:41,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:41:41,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:41:41,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:41:41,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:41:41,110 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand 4 states. [2020-07-01 12:41:41,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:41:41,188 INFO L93 Difference]: Finished difference Result 45 states and 65 transitions. [2020-07-01 12:41:41,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:41:41,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-07-01 12:41:41,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:41:41,189 INFO L225 Difference]: With dead ends: 45 [2020-07-01 12:41:41,189 INFO L226 Difference]: Without dead ends: 44 [2020-07-01 12:41:41,190 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:41:41,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-01 12:41:41,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2020-07-01 12:41:41,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-01 12:41:41,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2020-07-01 12:41:41,195 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 42 transitions. Word has length 13 [2020-07-01 12:41:41,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:41:41,195 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 42 transitions. [2020-07-01 12:41:41,195 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:41:41,195 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 42 transitions. [2020-07-01 12:41:41,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-01 12:41:41,196 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:41:41,196 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:41:41,397 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2020-07-01 12:41:41,397 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:41:41,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:41:41,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1470140232, now seen corresponding path program 1 times [2020-07-01 12:41:41,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:41:41,398 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934900526] [2020-07-01 12:41:41,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:41:41,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:41:41,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 12:41:41,426 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934900526] [2020-07-01 12:41:41,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:41:41,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:41:41,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136797875] [2020-07-01 12:41:41,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:41:41,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:41:41,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:41:41,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:41:41,428 INFO L87 Difference]: Start difference. First operand 30 states and 42 transitions. Second operand 3 states. [2020-07-01 12:41:41,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:41:41,464 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2020-07-01 12:41:41,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:41:41,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-07-01 12:41:41,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:41:41,479 INFO L225 Difference]: With dead ends: 48 [2020-07-01 12:41:41,479 INFO L226 Difference]: Without dead ends: 30 [2020-07-01 12:41:41,479 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:41:41,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-01 12:41:41,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-01 12:41:41,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-01 12:41:41,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2020-07-01 12:41:41,484 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 15 [2020-07-01 12:41:41,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:41:41,484 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2020-07-01 12:41:41,484 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:41:41,484 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2020-07-01 12:41:41,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-01 12:41:41,485 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:41:41,485 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:41:41,485 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-01 12:41:41,485 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:41:41,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:41:41,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1470141193, now seen corresponding path program 1 times [2020-07-01 12:41:41,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:41:41,486 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221248014] [2020-07-01 12:41:41,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:41:41,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:41:41,526 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:41:41,527 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221248014] [2020-07-01 12:41:41,527 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409848059] [2020-07-01 12:41:41,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:41:41,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:41:41,567 INFO L264 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 12:41:41,568 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:41:41,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:41:41,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 12:41:41,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2020-07-01 12:41:41,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383677940] [2020-07-01 12:41:41,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:41:41,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:41:41,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:41:41,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:41:41,586 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand 5 states. [2020-07-01 12:41:41,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:41:41,697 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2020-07-01 12:41:41,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 12:41:41,698 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-01 12:41:41,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:41:41,700 INFO L225 Difference]: With dead ends: 58 [2020-07-01 12:41:41,700 INFO L226 Difference]: Without dead ends: 42 [2020-07-01 12:41:41,701 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-01 12:41:41,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-01 12:41:41,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 31. [2020-07-01 12:41:41,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-01 12:41:41,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2020-07-01 12:41:41,707 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 40 transitions. Word has length 15 [2020-07-01 12:41:41,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:41:41,707 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 40 transitions. [2020-07-01 12:41:41,707 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:41:41,708 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2020-07-01 12:41:41,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-01 12:41:41,708 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:41:41,708 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:41:41,909 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-01 12:41:41,909 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:41:41,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:41:41,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1670293990, now seen corresponding path program 1 times [2020-07-01 12:41:41,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:41:41,910 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796012499] [2020-07-01 12:41:41,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:41:41,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:41:41,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 12:41:41,959 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796012499] [2020-07-01 12:41:41,959 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340547288] [2020-07-01 12:41:41,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:41:42,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:41:42,003 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 12:41:42,004 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:41:42,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 12:41:42,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 12:41:42,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2020-07-01 12:41:42,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112346114] [2020-07-01 12:41:42,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:41:42,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:41:42,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:41:42,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:41:42,030 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. Second operand 5 states. [2020-07-01 12:41:42,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:41:42,103 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2020-07-01 12:41:42,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:41:42,103 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-01 12:41:42,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:41:42,104 INFO L225 Difference]: With dead ends: 37 [2020-07-01 12:41:42,104 INFO L226 Difference]: Without dead ends: 36 [2020-07-01 12:41:42,104 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-07-01 12:41:42,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-01 12:41:42,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2020-07-01 12:41:42,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-01 12:41:42,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2020-07-01 12:41:42,109 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 16 [2020-07-01 12:41:42,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:41:42,110 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2020-07-01 12:41:42,110 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:41:42,110 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2020-07-01 12:41:42,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-01 12:41:42,111 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:41:42,111 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:41:42,311 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-07-01 12:41:42,312 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:41:42,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:41:42,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1670293991, now seen corresponding path program 1 times [2020-07-01 12:41:42,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:41:42,312 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189597167] [2020-07-01 12:41:42,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:41:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:41:42,384 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:41:42,384 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189597167] [2020-07-01 12:41:42,385 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988743761] [2020-07-01 12:41:42,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:41:42,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:41:42,416 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 12:41:42,417 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:41:42,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:41:42,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:41:42,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2020-07-01 12:41:42,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044901754] [2020-07-01 12:41:42,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-01 12:41:42,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:41:42,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-01 12:41:42,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-07-01 12:41:42,456 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand 8 states. [2020-07-01 12:41:42,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:41:42,565 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2020-07-01 12:41:42,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-01 12:41:42,566 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-07-01 12:41:42,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:41:42,566 INFO L225 Difference]: With dead ends: 44 [2020-07-01 12:41:42,567 INFO L226 Difference]: Without dead ends: 40 [2020-07-01 12:41:42,567 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2020-07-01 12:41:42,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-01 12:41:42,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 31. [2020-07-01 12:41:42,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-01 12:41:42,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2020-07-01 12:41:42,572 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 16 [2020-07-01 12:41:42,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:41:42,572 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2020-07-01 12:41:42,572 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-01 12:41:42,572 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2020-07-01 12:41:42,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-01 12:41:42,573 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:41:42,573 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:41:42,774 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:41:42,774 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:41:42,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:41:42,774 INFO L82 PathProgramCache]: Analyzing trace with hash 997640359, now seen corresponding path program 1 times [2020-07-01 12:41:42,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:41:42,775 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643105670] [2020-07-01 12:41:42,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:41:42,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:41:42,830 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 12:41:42,830 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643105670] [2020-07-01 12:41:42,831 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576525543] [2020-07-01 12:41:42,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:41:42,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:41:42,860 INFO L264 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 12:41:42,861 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:41:42,873 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-01 12:41:42,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 12:41:42,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2020-07-01 12:41:42,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861086953] [2020-07-01 12:41:42,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:41:42,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:41:42,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:41:42,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:41:42,874 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 3 states. [2020-07-01 12:41:42,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:41:42,902 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2020-07-01 12:41:42,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:41:42,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-07-01 12:41:42,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:41:42,903 INFO L225 Difference]: With dead ends: 31 [2020-07-01 12:41:42,903 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:41:42,904 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:41:42,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:41:42,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:41:42,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:41:42,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:41:42,904 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2020-07-01 12:41:42,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:41:42,905 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:41:42,905 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:41:42,905 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:41:42,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:41:43,105 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-07-01 12:41:43,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:41:43,326 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 36 [2020-07-01 12:41:43,407 INFO L268 CegarLoopResult]: For program point L11-1(line 11) no Hoare annotation was computed. [2020-07-01 12:41:43,408 INFO L268 CegarLoopResult]: For program point L11-2(line 11) no Hoare annotation was computed. [2020-07-01 12:41:43,408 INFO L268 CegarLoopResult]: For program point L11-3(line 11) no Hoare annotation was computed. [2020-07-01 12:41:43,408 INFO L268 CegarLoopResult]: For program point L11-5(lines 11 12) no Hoare annotation was computed. [2020-07-01 12:41:43,408 INFO L264 CegarLoopResult]: At program point L11-8(lines 11 12) the Hoare annotation is: (let ((.cse0 (select |#length| ULTIMATE.start_insertionSort_~a.base))) (and (<= 1 ULTIMATE.start_insertionSort_~i~0) (<= 0 ULTIMATE.start_insertionSort_~j~0) (= 1 (select |#valid| ULTIMATE.start_insertionSort_~a.base)) (<= (* 4 ULTIMATE.start_insertionSort_~array_size) .cse0) (= 0 ULTIMATE.start_insertionSort_~a.offset) (<= ULTIMATE.start_insertionSort_~j~0 (div (+ .cse0 (* ULTIMATE.start_insertionSort_~a.offset (- 1)) (- 4)) 4)) (<= (+ (* 4 ULTIMATE.start_insertionSort_~i~0) 4) .cse0))) [2020-07-01 12:41:43,408 INFO L268 CegarLoopResult]: For program point L11-9(lines 11 12) no Hoare annotation was computed. [2020-07-01 12:41:43,409 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:41:43,409 INFO L268 CegarLoopResult]: For program point L20(lines 20 22) no Hoare annotation was computed. [2020-07-01 12:41:43,409 INFO L268 CegarLoopResult]: For program point L20-2(lines 20 22) no Hoare annotation was computed. [2020-07-01 12:41:43,409 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:41:43,409 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:41:43,409 INFO L268 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-07-01 12:41:43,409 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:41:43,409 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 12:41:43,409 INFO L268 CegarLoopResult]: For program point L12-1(line 12) no Hoare annotation was computed. [2020-07-01 12:41:43,410 INFO L268 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2020-07-01 12:41:43,410 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:41:43,410 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:41:43,410 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:41:43,410 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:41:43,410 INFO L264 CegarLoopResult]: At program point L8-2(lines 8 15) the Hoare annotation is: (let ((.cse3 (select |#length| ULTIMATE.start_insertionSort_~a.base))) (let ((.cse0 (= 1 (select |#valid| ULTIMATE.start_insertionSort_~a.base))) (.cse1 (<= (* 4 ULTIMATE.start_insertionSort_~array_size) .cse3)) (.cse2 (= 0 ULTIMATE.start_insertionSort_~a.offset))) (or (and .cse0 .cse1 .cse2 (= 1 ULTIMATE.start_insertionSort_~i~0)) (and (<= 2 ULTIMATE.start_insertionSort_~i~0) (<= 0 ULTIMATE.start_insertionSort_~j~0) .cse0 .cse1 .cse2 (<= ULTIMATE.start_insertionSort_~j~0 (div (+ .cse3 (* ULTIMATE.start_insertionSort_~a.offset (- 1)) (- 4)) 4)) (<= (+ ULTIMATE.start_insertionSort_~a.offset 8) .cse3))))) [2020-07-01 12:41:43,410 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:41:43,411 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 12:41:43,413 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:41:43,422 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:43,423 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:43,423 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:43,424 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:43,431 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:43,431 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:43,431 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:43,432 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:43,433 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:43,434 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:43,434 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:43,435 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:43,435 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:43,435 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:43,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:41:43 BasicIcfg [2020-07-01 12:41:43,437 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:41:43,438 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:41:43,438 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:41:43,441 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:41:43,442 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:41:43,442 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:41:38" (1/5) ... [2020-07-01 12:41:43,443 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@273adc02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:41:43, skipping insertion in model container [2020-07-01 12:41:43,443 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:41:43,443 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:41:38" (2/5) ... [2020-07-01 12:41:43,443 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@273adc02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:41:43, skipping insertion in model container [2020-07-01 12:41:43,444 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:41:43,444 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:41:39" (3/5) ... [2020-07-01 12:41:43,444 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@273adc02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:41:43, skipping insertion in model container [2020-07-01 12:41:43,444 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:41:43,444 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:41:39" (4/5) ... [2020-07-01 12:41:43,444 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@273adc02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:41:43, skipping insertion in model container [2020-07-01 12:41:43,445 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:41:43,445 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:41:43" (5/5) ... [2020-07-01 12:41:43,446 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:41:43,472 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:41:43,472 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:41:43,472 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:41:43,472 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:41:43,472 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:41:43,473 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:41:43,473 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:41:43,473 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:41:43,476 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2020-07-01 12:41:43,481 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-01 12:41:43,481 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:41:43,481 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:41:43,486 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-01 12:41:43,486 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:41:43,486 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:41:43,486 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2020-07-01 12:41:43,487 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-01 12:41:43,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:41:43,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:41:43,488 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-01 12:41:43,488 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:41:43,493 INFO L794 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue [143] ULTIMATE.startENTRY-->L20: Formula: (and (= 0 |v_#NULL.base_2|) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|) (= |v_#valid_17| (store |v_#valid_18| 0 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_3, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, #valid=|v_#valid_17|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_3, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_~a~0.offset, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, #valid, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_~a~0.base, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset] 12#L20true [73] L20-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~array_size~0_4 1) (< v_ULTIMATE.start_main_~array_size~0_5 1)) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_5} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~array_size~0] 7#L20-2true [118] L20-2-->L8-2: Formula: (and (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|)) (= 0 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (= v_ULTIMATE.start_main_~a~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= v_ULTIMATE.start_insertionSort_~a.base_1 |v_ULTIMATE.start_insertionSort_#in~a.base_1|) (= |v_ULTIMATE.start_insertionSort_#in~a.offset_1| v_ULTIMATE.start_main_~a~0.offset_2) (= v_ULTIMATE.start_insertionSort_~array_size_1 |v_ULTIMATE.start_insertionSort_#in~array_size_1|) (= v_ULTIMATE.start_insertionSort_~a.offset_1 |v_ULTIMATE.start_insertionSort_#in~a.offset_1|) (= |v_ULTIMATE.start_insertionSort_#in~array_size_1| v_ULTIMATE.start_main_~array_size~0_7) (= v_ULTIMATE.start_insertionSort_~i~0_1 1) (= (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1) |v_#valid_3|) (= v_ULTIMATE.start_main_~a~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (= |v_ULTIMATE.start_insertionSort_#in~a.base_1| v_ULTIMATE.start_main_~a~0.base_2) (= |v_#length_1| (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc7.base_2| (* v_ULTIMATE.start_main_~array_size~0_7 4))) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_1, ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_1|, ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_1, ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_1, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_2, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_1, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, ULTIMATE.start_insertionSort_#in~array_size=|v_ULTIMATE.start_insertionSort_#in~array_size_1|, ULTIMATE.start_insertionSort_#t~pre0=|v_ULTIMATE.start_insertionSort_#t~pre0_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_insertionSort_#t~mem1=|v_ULTIMATE.start_insertionSort_#t~mem1_1|, ULTIMATE.start_insertionSort_#in~a.base=|v_ULTIMATE.start_insertionSort_#in~a.base_1|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_2, #valid=|v_#valid_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_insertionSort_#t~post2=|v_ULTIMATE.start_insertionSort_#t~post2_1|, #length=|v_#length_1|, ULTIMATE.start_insertionSort_#in~a.offset=|v_ULTIMATE.start_insertionSort_#in~a.offset_1|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_1, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_1|, ULTIMATE.start_insertionSort_#t~mem5=|v_ULTIMATE.start_insertionSort_#t~mem5_1|, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_1} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_~array_size, ULTIMATE.start_insertionSort_#t~short4, ULTIMATE.start_insertionSort_~index~0, ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_insertionSort_~a.offset, ULTIMATE.start_main_~a~0.base, ULTIMATE.start_insertionSort_~i~0, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_insertionSort_#in~array_size, ULTIMATE.start_insertionSort_#t~pre0, ULTIMATE.start_insertionSort_#t~mem1, ULTIMATE.start_insertionSort_#in~a.base, ULTIMATE.start_main_~a~0.offset, #valid, ULTIMATE.start_insertionSort_#t~post2, #length, ULTIMATE.start_insertionSort_#in~a.offset, ULTIMATE.start_insertionSort_~a.base, ULTIMATE.start_insertionSort_#t~mem3, ULTIMATE.start_insertionSort_#t~mem5, ULTIMATE.start_insertionSort_~j~0] 4#L8-2true [2020-07-01 12:41:43,493 INFO L796 eck$LassoCheckResult]: Loop: 4#L8-2true [97] L8-2-->L10: Formula: (< v_ULTIMATE.start_insertionSort_~i~0_5 v_ULTIMATE.start_insertionSort_~array_size_4) InVars {ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_4, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_5} OutVars{ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_4, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_5} AuxVars[] AssignedVars[] 15#L10true [145] L10-->L11-8: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_insertionSort_~i~0_12))) (and (<= (+ .cse0 v_ULTIMATE.start_insertionSort_~a.offset_13 4) (select |v_#length_13| v_ULTIMATE.start_insertionSort_~a.base_18)) (= 1 (select |v_#valid_21| v_ULTIMATE.start_insertionSort_~a.base_18)) (= (select (select |v_#memory_int_8| v_ULTIMATE.start_insertionSort_~a.base_18) (+ (* v_ULTIMATE.start_insertionSort_~i~0_12 4) v_ULTIMATE.start_insertionSort_~a.offset_13)) v_ULTIMATE.start_insertionSort_~index~0_6) (<= 0 (+ .cse0 v_ULTIMATE.start_insertionSort_~a.offset_13)) (= v_ULTIMATE.start_insertionSort_~i~0_12 v_ULTIMATE.start_insertionSort_~j~0_15))) InVars {#valid=|v_#valid_21|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_13, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_18, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_12} OutVars{ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_6, ULTIMATE.start_insertionSort_#t~mem1=|v_ULTIMATE.start_insertionSort_#t~mem1_5|, #valid=|v_#valid_21|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_13, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_18, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_12, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_~index~0, ULTIMATE.start_insertionSort_#t~mem1, ULTIMATE.start_insertionSort_~j~0] 24#L11-8true [123] L11-8-->L11-1: Formula: (and (not |v_ULTIMATE.start_insertionSort_#t~short4_2|) (>= 0 v_ULTIMATE.start_insertionSort_~j~0_4)) InVars {ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_4} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_2|, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_4} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4] 16#L11-1true [100] L11-1-->L11-5: Formula: (not |v_ULTIMATE.start_insertionSort_#t~short4_5|) InVars {ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_5|} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_5|} AuxVars[] AssignedVars[] 6#L11-5true [66] L11-5-->L11-9: Formula: (not |v_ULTIMATE.start_insertionSort_#t~short4_7|) InVars {ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_7|} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_6|, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_4|} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4, ULTIMATE.start_insertionSort_#t~mem3] 22#L11-9true [148] L11-9-->L8-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_insertionSort_~j~0_16))) (and (= 1 (select |v_#valid_26| v_ULTIMATE.start_insertionSort_~a.base_19)) (= |v_#memory_int_9| (store |v_#memory_int_10| v_ULTIMATE.start_insertionSort_~a.base_19 (store (select |v_#memory_int_10| v_ULTIMATE.start_insertionSort_~a.base_19) (+ v_ULTIMATE.start_insertionSort_~a.offset_14 (* v_ULTIMATE.start_insertionSort_~j~0_16 4)) v_ULTIMATE.start_insertionSort_~index~0_7))) (<= 0 (+ v_ULTIMATE.start_insertionSort_~a.offset_14 .cse0)) (= (+ v_ULTIMATE.start_insertionSort_~i~0_16 1) v_ULTIMATE.start_insertionSort_~i~0_15) (<= (+ v_ULTIMATE.start_insertionSort_~a.offset_14 .cse0 4) (select |v_#length_14| v_ULTIMATE.start_insertionSort_~a.base_19)))) InVars {ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_14, #length=|v_#length_14|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_19, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_16, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_16} OutVars{ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_7, ULTIMATE.start_insertionSort_#t~pre0=|v_ULTIMATE.start_insertionSort_#t~pre0_4|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_14, #length=|v_#length_14|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_19, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_15, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_16} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~pre0, #memory_int, ULTIMATE.start_insertionSort_~i~0] 4#L8-2true [2020-07-01 12:41:43,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:41:43,494 INFO L82 PathProgramCache]: Analyzing trace with hash 169595, now seen corresponding path program 1 times [2020-07-01 12:41:43,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:41:43,494 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059122679] [2020-07-01 12:41:43,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:41:43,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:41:43,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:41:43,507 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059122679] [2020-07-01 12:41:43,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:41:43,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-07-01 12:41:43,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306662251] [2020-07-01 12:41:43,508 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:41:43,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:41:43,508 INFO L82 PathProgramCache]: Analyzing trace with hash -492762836, now seen corresponding path program 1 times [2020-07-01 12:41:43,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:41:43,509 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275352795] [2020-07-01 12:41:43,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:41:43,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:41:43,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:41:43,540 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:41:43,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:41:43,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:41:43,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:41:43,614 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2020-07-01 12:41:43,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:41:43,651 INFO L93 Difference]: Finished difference Result 23 states and 38 transitions. [2020-07-01 12:41:43,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:41:43,654 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 12:41:43,658 INFO L168 Benchmark]: Toolchain (without parser) took 5024.09 ms. Allocated memory was 514.9 MB in the beginning and 602.9 MB in the end (delta: 88.1 MB). Free memory was 438.6 MB in the beginning and 419.3 MB in the end (delta: 19.2 MB). Peak memory consumption was 107.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:41:43,658 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 458.5 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:41:43,659 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.02 ms. Allocated memory was 514.9 MB in the beginning and 568.9 MB in the end (delta: 54.0 MB). Free memory was 438.0 MB in the beginning and 535.7 MB in the end (delta: -97.6 MB). Peak memory consumption was 28.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:41:43,659 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.74 ms. Allocated memory is still 568.9 MB. Free memory was 535.1 MB in the beginning and 533.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. [2020-07-01 12:41:43,660 INFO L168 Benchmark]: Boogie Preprocessor took 25.93 ms. Allocated memory is still 568.9 MB. Free memory was 533.5 MB in the beginning and 531.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. [2020-07-01 12:41:43,660 INFO L168 Benchmark]: RCFGBuilder took 338.19 ms. Allocated memory is still 568.9 MB. Free memory was 531.9 MB in the beginning and 511.5 MB in the end (delta: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 50.3 GB. [2020-07-01 12:41:43,661 INFO L168 Benchmark]: BlockEncodingV2 took 139.69 ms. Allocated memory is still 568.9 MB. Free memory was 511.5 MB in the beginning and 502.3 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:41:43,661 INFO L168 Benchmark]: TraceAbstraction took 3952.87 ms. Allocated memory was 568.9 MB in the beginning and 602.9 MB in the end (delta: 34.1 MB). Free memory was 501.8 MB in the beginning and 448.3 MB in the end (delta: 53.5 MB). Peak memory consumption was 87.5 MB. Max. memory is 50.3 GB. [2020-07-01 12:41:43,662 INFO L168 Benchmark]: BuchiAutomizer took 218.29 ms. Allocated memory is still 602.9 MB. Free memory was 448.3 MB in the beginning and 419.3 MB in the end (delta: 29.0 MB). Peak memory consumption was 29.0 MB. Max. memory is 50.3 GB. [2020-07-01 12:41:43,665 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 32 locations, 37 edges - StatisticsResult: Encoded RCFG 23 locations, 39 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 458.5 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 303.02 ms. Allocated memory was 514.9 MB in the beginning and 568.9 MB in the end (delta: 54.0 MB). Free memory was 438.0 MB in the beginning and 535.7 MB in the end (delta: -97.6 MB). Peak memory consumption was 28.2 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 39.74 ms. Allocated memory is still 568.9 MB. Free memory was 535.1 MB in the beginning and 533.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 25.93 ms. Allocated memory is still 568.9 MB. Free memory was 533.5 MB in the beginning and 531.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. * RCFGBuilder took 338.19 ms. Allocated memory is still 568.9 MB. Free memory was 531.9 MB in the beginning and 511.5 MB in the end (delta: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 139.69 ms. Allocated memory is still 568.9 MB. Free memory was 511.5 MB in the beginning and 502.3 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 50.3 GB. * TraceAbstraction took 3952.87 ms. Allocated memory was 568.9 MB in the beginning and 602.9 MB in the end (delta: 34.1 MB). Free memory was 501.8 MB in the beginning and 448.3 MB in the end (delta: 53.5 MB). Peak memory consumption was 87.5 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 218.29 ms. Allocated memory is still 602.9 MB. Free memory was 448.3 MB in the beginning and 419.3 MB in the end (delta: 29.0 MB). Peak memory consumption was 29.0 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - InvariantResult [Line: 8]: Loop Invariant [2020-07-01 12:41:43,674 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:43,674 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:43,674 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:43,674 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:43,675 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:43,675 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:43,676 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:43,676 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((1 == \valid[a] && 4 * array_size <= unknown-#length-unknown[a]) && 0 == a) && 1 == i) || ((((((2 <= i && 0 <= j) && 1 == \valid[a]) && 4 * array_size <= unknown-#length-unknown[a]) && 0 == a) && j <= (unknown-#length-unknown[a] + a * -1 + -4) / 4) && a + 8 <= unknown-#length-unknown[a]) - InvariantResult [Line: 11]: Loop Invariant [2020-07-01 12:41:43,677 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:43,677 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:43,677 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:43,678 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:43,678 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:41:43,678 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((1 <= i && 0 <= j) && 1 == \valid[a]) && 4 * array_size <= unknown-#length-unknown[a]) && 0 == a) && j <= (unknown-#length-unknown[a] + a * -1 + -4) / 4) && 4 * i + 4 <= unknown-#length-unknown[a] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 10 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.5s, OverallIterations: 13, TraceHistogramMax: 2, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 105 SDtfs, 405 SDslu, 225 SDs, 0 SdLazy, 613 SolverSat, 68 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 110 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 7 NumberOfFragments, 104 HoareAnnotationTreeSize, 2 FomulaSimplifications, 3777 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 996 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 217 NumberOfCodeBlocks, 217 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 199 ConstructedInterpolants, 0 QuantifiedInterpolants, 12333 SizeOfPredicates, 10 NumberOfNonLiveVariables, 362 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 18 InterpolantComputations, 12 PerfectInterpolantSequences, 23/37 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 12:41:35.364 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp/BenchExec_run_m5qICV/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:41:43.903 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check