java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/heap-manipulation/merge_sort_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 00:58:10,080 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 00:58:10,082 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 00:58:10,095 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 00:58:10,095 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 00:58:10,096 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 00:58:10,097 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 00:58:10,099 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 00:58:10,101 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 00:58:10,101 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 00:58:10,102 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 00:58:10,102 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 00:58:10,103 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 00:58:10,104 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 00:58:10,105 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 00:58:10,107 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 00:58:10,109 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 00:58:10,111 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 00:58:10,112 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 00:58:10,113 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 00:58:10,115 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 00:58:10,115 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 00:58:10,116 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 00:58:10,116 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 00:58:10,117 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 00:58:10,118 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 00:58:10,119 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 00:58:10,119 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 00:58:10,119 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 00:58:10,120 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 00:58:10,120 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 00:58:10,120 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf [2018-01-21 00:58:10,130 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 00:58:10,130 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 00:58:10,131 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 00:58:10,131 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 00:58:10,131 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 00:58:10,131 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-21 00:58:10,131 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 00:58:10,131 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 00:58:10,132 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 00:58:10,132 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 00:58:10,132 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 00:58:10,133 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 00:58:10,133 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 00:58:10,133 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 00:58:10,133 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 00:58:10,133 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 00:58:10,133 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 00:58:10,134 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 00:58:10,134 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 00:58:10,134 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 00:58:10,134 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 00:58:10,134 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 00:58:10,134 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 00:58:10,135 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 00:58:10,135 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 00:58:10,135 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 00:58:10,135 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 00:58:10,135 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 00:58:10,136 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 00:58:10,136 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 00:58:10,136 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 00:58:10,136 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 00:58:10,136 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 00:58:10,136 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 00:58:10,137 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 00:58:10,137 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 00:58:10,137 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 00:58:10,138 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 00:58:10,138 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 00:58:10,170 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 00:58:10,181 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 00:58:10,185 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 00:58:10,186 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 00:58:10,186 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 00:58:10,187 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/merge_sort_true-unreach-call_true-valid-memsafety.i [2018-01-21 00:58:10,351 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 00:58:10,355 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 00:58:10,356 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 00:58:10,356 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 00:58:10,361 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 00:58:10,362 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:58:10" (1/1) ... [2018-01-21 00:58:10,364 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65dec646 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:58:10, skipping insertion in model container [2018-01-21 00:58:10,364 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:58:10" (1/1) ... [2018-01-21 00:58:10,378 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:58:10,418 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:58:10,550 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:58:10,584 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:58:10,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:58:10 WrapperNode [2018-01-21 00:58:10,596 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 00:58:10,597 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 00:58:10,597 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 00:58:10,597 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 00:58:10,608 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:58:10" (1/1) ... [2018-01-21 00:58:10,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:58:10" (1/1) ... [2018-01-21 00:58:10,619 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:58:10" (1/1) ... [2018-01-21 00:58:10,619 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:58:10" (1/1) ... [2018-01-21 00:58:10,629 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:58:10" (1/1) ... [2018-01-21 00:58:10,636 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:58:10" (1/1) ... [2018-01-21 00:58:10,639 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:58:10" (1/1) ... [2018-01-21 00:58:10,643 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 00:58:10,644 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 00:58:10,644 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 00:58:10,644 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 00:58:10,645 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:58:10" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 00:58:10,688 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 00:58:10,689 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 00:58:10,689 INFO L136 BoogieDeclarations]: Found implementation of procedure fail [2018-01-21 00:58:10,689 INFO L136 BoogieDeclarations]: Found implementation of procedure merge_single_node [2018-01-21 00:58:10,689 INFO L136 BoogieDeclarations]: Found implementation of procedure merge_pair [2018-01-21 00:58:10,689 INFO L136 BoogieDeclarations]: Found implementation of procedure seq_sort_core [2018-01-21 00:58:10,689 INFO L136 BoogieDeclarations]: Found implementation of procedure inspect_before [2018-01-21 00:58:10,689 INFO L136 BoogieDeclarations]: Found implementation of procedure inspect_after [2018-01-21 00:58:10,689 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 00:58:10,689 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 00:58:10,689 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 00:58:10,690 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 00:58:10,690 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 00:58:10,690 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 00:58:10,690 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 00:58:10,690 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 00:58:10,690 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-21 00:58:10,690 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 00:58:10,690 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-21 00:58:10,690 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 00:58:10,691 INFO L128 BoogieDeclarations]: Found specification of procedure fail [2018-01-21 00:58:10,691 INFO L128 BoogieDeclarations]: Found specification of procedure merge_single_node [2018-01-21 00:58:10,691 INFO L128 BoogieDeclarations]: Found specification of procedure merge_pair [2018-01-21 00:58:10,691 INFO L128 BoogieDeclarations]: Found specification of procedure seq_sort_core [2018-01-21 00:58:10,691 INFO L128 BoogieDeclarations]: Found specification of procedure inspect_before [2018-01-21 00:58:10,691 INFO L128 BoogieDeclarations]: Found specification of procedure inspect_after [2018-01-21 00:58:10,691 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 00:58:10,691 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 00:58:10,691 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 00:58:11,357 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 00:58:11,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:58:11 BoogieIcfgContainer [2018-01-21 00:58:11,358 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 00:58:11,359 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 00:58:11,359 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 00:58:11,360 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 00:58:11,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 12:58:10" (1/3) ... [2018-01-21 00:58:11,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f53e7c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:58:11, skipping insertion in model container [2018-01-21 00:58:11,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:58:10" (2/3) ... [2018-01-21 00:58:11,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f53e7c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:58:11, skipping insertion in model container [2018-01-21 00:58:11,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:58:11" (3/3) ... [2018-01-21 00:58:11,363 INFO L105 eAbstractionObserver]: Analyzing ICFG merge_sort_true-unreach-call_true-valid-memsafety.i [2018-01-21 00:58:11,370 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 00:58:11,376 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-21 00:58:11,426 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:58:11,427 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:58:11,427 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:58:11,427 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:58:11,427 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:58:11,427 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:58:11,427 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:58:11,428 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == failErr0EnsuresViolation======== [2018-01-21 00:58:11,428 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:58:11,449 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2018-01-21 00:58:11,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-21 00:58:11,456 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:58:11,457 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:58:11,457 INFO L371 AbstractCegarLoop]: === Iteration 1 === [failErr0EnsuresViolation]=== [2018-01-21 00:58:11,461 INFO L82 PathProgramCache]: Analyzing trace with hash -101851905, now seen corresponding path program 1 times [2018-01-21 00:58:11,463 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:58:11,507 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:58:11,508 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:58:11,508 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:58:11,508 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:58:11,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:58:11,571 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:58:11,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:58:11,625 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:58:11,625 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:58:11,625 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:58:11,628 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:58:11,720 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:58:11,721 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:58:11,723 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 2 states. [2018-01-21 00:58:11,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:58:11,772 INFO L93 Difference]: Finished difference Result 417 states and 571 transitions. [2018-01-21 00:58:11,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:58:11,773 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-01-21 00:58:11,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:58:11,778 INFO L225 Difference]: With dead ends: 417 [2018-01-21 00:58:11,779 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:58:11,784 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:58:11,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:58:11,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:58:11,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:58:11,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:58:11,805 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2018-01-21 00:58:11,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:58:11,806 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:58:11,806 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:58:11,806 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:58:11,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:58:11,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-21 00:58:11,924 INFO L404 ceAbstractionStarter]: At program point failENTRY(lines 553 555) the Hoare annotation is: true [2018-01-21 00:58:11,924 INFO L401 ceAbstractionStarter]: For program point failFINAL(lines 553 555) no Hoare annotation was computed. [2018-01-21 00:58:11,924 INFO L401 ceAbstractionStarter]: For program point failErr0EnsuresViolation(lines 553 555) no Hoare annotation was computed. [2018-01-21 00:58:11,924 INFO L401 ceAbstractionStarter]: For program point failEXIT(lines 553 555) no Hoare annotation was computed. [2018-01-21 00:58:11,925 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 655) no Hoare annotation was computed. [2018-01-21 00:58:11,925 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 655) no Hoare annotation was computed. [2018-01-21 00:58:11,925 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 655) the Hoare annotation is: true [2018-01-21 00:58:11,925 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 655) no Hoare annotation was computed. [2018-01-21 00:58:11,925 INFO L404 ceAbstractionStarter]: At program point L581(line 581) the Hoare annotation is: true [2018-01-21 00:58:11,925 INFO L404 ceAbstractionStarter]: At program point L581'(line 581) the Hoare annotation is: true [2018-01-21 00:58:11,925 INFO L401 ceAbstractionStarter]: For program point L573'(lines 573 583) no Hoare annotation was computed. [2018-01-21 00:58:11,926 INFO L401 ceAbstractionStarter]: For program point merge_pairFINAL(lines 573 583) no Hoare annotation was computed. [2018-01-21 00:58:11,926 INFO L401 ceAbstractionStarter]: For program point L577'''''(line 577) no Hoare annotation was computed. [2018-01-21 00:58:11,926 INFO L401 ceAbstractionStarter]: For program point L578''''''''''(line 578) no Hoare annotation was computed. [2018-01-21 00:58:11,926 INFO L401 ceAbstractionStarter]: For program point L573'''''''''''(lines 573 583) no Hoare annotation was computed. [2018-01-21 00:58:11,926 INFO L401 ceAbstractionStarter]: For program point L578''''''''''''''(line 578) no Hoare annotation was computed. [2018-01-21 00:58:11,926 INFO L401 ceAbstractionStarter]: For program point L573''(lines 573 583) no Hoare annotation was computed. [2018-01-21 00:58:11,926 INFO L404 ceAbstractionStarter]: At program point merge_pairENTRY(lines 573 583) the Hoare annotation is: true [2018-01-21 00:58:11,926 INFO L401 ceAbstractionStarter]: For program point L573''''''''''''''(lines 573 583) no Hoare annotation was computed. [2018-01-21 00:58:11,927 INFO L401 ceAbstractionStarter]: For program point L573''''''''''''''''(lines 573 583) no Hoare annotation was computed. [2018-01-21 00:58:11,927 INFO L401 ceAbstractionStarter]: For program point L578'(line 578) no Hoare annotation was computed. [2018-01-21 00:58:11,927 INFO L401 ceAbstractionStarter]: For program point L573''''''''''''''''''(lines 573 583) no Hoare annotation was computed. [2018-01-21 00:58:11,927 INFO L401 ceAbstractionStarter]: For program point L577''(line 577) no Hoare annotation was computed. [2018-01-21 00:58:11,927 INFO L401 ceAbstractionStarter]: For program point L573''''''(lines 573 583) no Hoare annotation was computed. [2018-01-21 00:58:11,927 INFO L401 ceAbstractionStarter]: For program point L573''''''''(lines 573 583) no Hoare annotation was computed. [2018-01-21 00:58:11,927 INFO L401 ceAbstractionStarter]: For program point L573(lines 573 583) no Hoare annotation was computed. [2018-01-21 00:58:11,927 INFO L401 ceAbstractionStarter]: For program point L573'''''(lines 573 583) no Hoare annotation was computed. [2018-01-21 00:58:11,928 INFO L404 ceAbstractionStarter]: At program point L579(line 579) the Hoare annotation is: true [2018-01-21 00:58:11,928 INFO L401 ceAbstractionStarter]: For program point L578(line 578) no Hoare annotation was computed. [2018-01-21 00:58:11,928 INFO L401 ceAbstractionStarter]: For program point L577(lines 577 582) no Hoare annotation was computed. [2018-01-21 00:58:11,929 INFO L401 ceAbstractionStarter]: For program point L578'''''''''(line 578) no Hoare annotation was computed. [2018-01-21 00:58:11,929 INFO L401 ceAbstractionStarter]: For program point L578'''''(line 578) no Hoare annotation was computed. [2018-01-21 00:58:11,929 INFO L401 ceAbstractionStarter]: For program point L577''''(line 577) no Hoare annotation was computed. [2018-01-21 00:58:11,929 INFO L401 ceAbstractionStarter]: For program point L577''''''''(lines 577 582) no Hoare annotation was computed. [2018-01-21 00:58:11,929 INFO L401 ceAbstractionStarter]: For program point L573'''''''''(lines 573 583) no Hoare annotation was computed. [2018-01-21 00:58:11,929 INFO L401 ceAbstractionStarter]: For program point L573'''''''''''''''''(lines 573 583) no Hoare annotation was computed. [2018-01-21 00:58:11,929 INFO L401 ceAbstractionStarter]: For program point merge_pairErr0EnsuresViolation(lines 573 583) no Hoare annotation was computed. [2018-01-21 00:58:11,930 INFO L401 ceAbstractionStarter]: For program point L573'''(lines 573 583) no Hoare annotation was computed. [2018-01-21 00:58:11,930 INFO L401 ceAbstractionStarter]: For program point L578''''(line 578) no Hoare annotation was computed. [2018-01-21 00:58:11,930 INFO L401 ceAbstractionStarter]: For program point L573'''''''''''''''(lines 573 583) no Hoare annotation was computed. [2018-01-21 00:58:11,930 INFO L401 ceAbstractionStarter]: For program point L573''''''''''(lines 573 583) no Hoare annotation was computed. [2018-01-21 00:58:11,930 INFO L401 ceAbstractionStarter]: For program point L578''''''(line 578) no Hoare annotation was computed. [2018-01-21 00:58:11,930 INFO L401 ceAbstractionStarter]: For program point L578'''''''''''(line 578) no Hoare annotation was computed. [2018-01-21 00:58:11,930 INFO L401 ceAbstractionStarter]: For program point L578'''''''(line 578) no Hoare annotation was computed. [2018-01-21 00:58:11,930 INFO L401 ceAbstractionStarter]: For program point L578''(line 578) no Hoare annotation was computed. [2018-01-21 00:58:11,931 INFO L401 ceAbstractionStarter]: For program point L573''''''''''''(lines 573 583) no Hoare annotation was computed. [2018-01-21 00:58:11,931 INFO L401 ceAbstractionStarter]: For program point L573'''''''(lines 573 583) no Hoare annotation was computed. [2018-01-21 00:58:11,931 INFO L401 ceAbstractionStarter]: For program point merge_pairEXIT(lines 573 583) no Hoare annotation was computed. [2018-01-21 00:58:11,931 INFO L401 ceAbstractionStarter]: For program point L578''''''''(line 578) no Hoare annotation was computed. [2018-01-21 00:58:11,931 INFO L401 ceAbstractionStarter]: For program point L578'''''''''''''(line 578) no Hoare annotation was computed. [2018-01-21 00:58:11,931 INFO L401 ceAbstractionStarter]: For program point L577'(line 577) no Hoare annotation was computed. [2018-01-21 00:58:11,931 INFO L401 ceAbstractionStarter]: For program point L573''''(lines 573 583) no Hoare annotation was computed. [2018-01-21 00:58:11,932 INFO L401 ceAbstractionStarter]: For program point L577''''''(line 577) no Hoare annotation was computed. [2018-01-21 00:58:11,932 INFO L401 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-01-21 00:58:11,932 INFO L401 ceAbstractionStarter]: For program point L570(line 570) no Hoare annotation was computed. [2018-01-21 00:58:11,932 INFO L401 ceAbstractionStarter]: For program point L570'(line 570) no Hoare annotation was computed. [2018-01-21 00:58:11,932 INFO L401 ceAbstractionStarter]: For program point merge_single_nodeFINAL(lines 564 572) no Hoare annotation was computed. [2018-01-21 00:58:11,932 INFO L401 ceAbstractionStarter]: For program point merge_single_nodeErr0EnsuresViolation(lines 564 572) no Hoare annotation was computed. [2018-01-21 00:58:11,932 INFO L401 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2018-01-21 00:58:11,932 INFO L401 ceAbstractionStarter]: For program point L567(line 567) no Hoare annotation was computed. [2018-01-21 00:58:11,933 INFO L401 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-01-21 00:58:11,933 INFO L401 ceAbstractionStarter]: For program point merge_single_nodeEXIT(lines 564 572) no Hoare annotation was computed. [2018-01-21 00:58:11,933 INFO L404 ceAbstractionStarter]: At program point merge_single_nodeENTRY(lines 564 572) the Hoare annotation is: true [2018-01-21 00:58:11,933 INFO L401 ceAbstractionStarter]: For program point L567'(line 567) no Hoare annotation was computed. [2018-01-21 00:58:11,933 INFO L401 ceAbstractionStarter]: For program point L568'(line 568) no Hoare annotation was computed. [2018-01-21 00:58:11,933 INFO L401 ceAbstractionStarter]: For program point L569'(line 569) no Hoare annotation was computed. [2018-01-21 00:58:11,933 INFO L401 ceAbstractionStarter]: For program point L568''(line 568) no Hoare annotation was computed. [2018-01-21 00:58:11,934 INFO L401 ceAbstractionStarter]: For program point L595'(line 595) no Hoare annotation was computed. [2018-01-21 00:58:11,934 INFO L401 ceAbstractionStarter]: For program point L594'''(line 594) no Hoare annotation was computed. [2018-01-21 00:58:11,934 INFO L401 ceAbstractionStarter]: For program point L597'(line 597) no Hoare annotation was computed. [2018-01-21 00:58:11,934 INFO L401 ceAbstractionStarter]: For program point L589(lines 589 593) no Hoare annotation was computed. [2018-01-21 00:58:11,934 INFO L401 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-01-21 00:58:11,934 INFO L401 ceAbstractionStarter]: For program point seq_sort_coreErr0EnsuresViolation(lines 584 601) no Hoare annotation was computed. [2018-01-21 00:58:11,934 INFO L401 ceAbstractionStarter]: For program point L587(lines 587 599) no Hoare annotation was computed. [2018-01-21 00:58:11,934 INFO L404 ceAbstractionStarter]: At program point L594''(line 594) the Hoare annotation is: true [2018-01-21 00:58:11,934 INFO L401 ceAbstractionStarter]: For program point seq_sort_coreEXIT(lines 584 601) no Hoare annotation was computed. [2018-01-21 00:58:11,935 INFO L401 ceAbstractionStarter]: For program point seq_sort_coreFINAL(lines 584 601) no Hoare annotation was computed. [2018-01-21 00:58:11,935 INFO L404 ceAbstractionStarter]: At program point L598'(line 598) the Hoare annotation is: true [2018-01-21 00:58:11,935 INFO L401 ceAbstractionStarter]: For program point L588'(line 588) no Hoare annotation was computed. [2018-01-21 00:58:11,935 INFO L401 ceAbstractionStarter]: For program point L590'(line 590) no Hoare annotation was computed. [2018-01-21 00:58:11,935 INFO L401 ceAbstractionStarter]: For program point L590(line 590) no Hoare annotation was computed. [2018-01-21 00:58:11,935 INFO L401 ceAbstractionStarter]: For program point L594'(line 594) no Hoare annotation was computed. [2018-01-21 00:58:11,935 INFO L401 ceAbstractionStarter]: For program point L597(line 597) no Hoare annotation was computed. [2018-01-21 00:58:11,936 INFO L401 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2018-01-21 00:58:11,936 INFO L404 ceAbstractionStarter]: At program point seq_sort_coreENTRY(lines 584 601) the Hoare annotation is: true [2018-01-21 00:58:11,936 INFO L401 ceAbstractionStarter]: For program point L594(line 594) no Hoare annotation was computed. [2018-01-21 00:58:11,936 INFO L401 ceAbstractionStarter]: For program point L598(line 598) no Hoare annotation was computed. [2018-01-21 00:58:11,936 INFO L401 ceAbstractionStarter]: For program point L587''(lines 587 599) no Hoare annotation was computed. [2018-01-21 00:58:11,936 INFO L401 ceAbstractionStarter]: For program point L609'''''''(line 609) no Hoare annotation was computed. [2018-01-21 00:58:11,936 INFO L404 ceAbstractionStarter]: At program point inspect_beforeENTRY(lines 602 615) the Hoare annotation is: true [2018-01-21 00:58:11,936 INFO L404 ceAbstractionStarter]: At program point L611'(line 611) the Hoare annotation is: true [2018-01-21 00:58:11,937 INFO L401 ceAbstractionStarter]: For program point L607'(line 607) no Hoare annotation was computed. [2018-01-21 00:58:11,937 INFO L401 ceAbstractionStarter]: For program point L609'''''(line 609) no Hoare annotation was computed. [2018-01-21 00:58:11,937 INFO L401 ceAbstractionStarter]: For program point L613''''(line 613) no Hoare annotation was computed. [2018-01-21 00:58:11,937 INFO L401 ceAbstractionStarter]: For program point L612(line 612) no Hoare annotation was computed. [2018-01-21 00:58:11,937 INFO L401 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2018-01-21 00:58:11,937 INFO L401 ceAbstractionStarter]: For program point L611'''''(line 611) no Hoare annotation was computed. [2018-01-21 00:58:11,937 INFO L404 ceAbstractionStarter]: At program point L613''(line 613) the Hoare annotation is: true [2018-01-21 00:58:11,937 INFO L404 ceAbstractionStarter]: At program point L606'''''(line 606) the Hoare annotation is: true [2018-01-21 00:58:11,937 INFO L404 ceAbstractionStarter]: At program point L607''(line 607) the Hoare annotation is: true [2018-01-21 00:58:11,938 INFO L401 ceAbstractionStarter]: For program point L614(line 614) no Hoare annotation was computed. [2018-01-21 00:58:11,938 INFO L401 ceAbstractionStarter]: For program point L613(line 613) no Hoare annotation was computed. [2018-01-21 00:58:11,938 INFO L401 ceAbstractionStarter]: For program point L612'(line 612) no Hoare annotation was computed. [2018-01-21 00:58:11,938 INFO L401 ceAbstractionStarter]: For program point L608'(line 608) no Hoare annotation was computed. [2018-01-21 00:58:11,938 INFO L404 ceAbstractionStarter]: At program point L609'''(line 609) the Hoare annotation is: true [2018-01-21 00:58:11,938 INFO L401 ceAbstractionStarter]: For program point L605'(line 605) no Hoare annotation was computed. [2018-01-21 00:58:11,938 INFO L404 ceAbstractionStarter]: At program point L614'''(line 614) the Hoare annotation is: true [2018-01-21 00:58:11,938 INFO L401 ceAbstractionStarter]: For program point L613''''''(line 613) no Hoare annotation was computed. [2018-01-21 00:58:11,939 INFO L401 ceAbstractionStarter]: For program point L607''''(line 607) no Hoare annotation was computed. [2018-01-21 00:58:11,939 INFO L401 ceAbstractionStarter]: For program point L607''''''(line 607) no Hoare annotation was computed. [2018-01-21 00:58:11,939 INFO L401 ceAbstractionStarter]: For program point L605''''(line 605) no Hoare annotation was computed. [2018-01-21 00:58:11,939 INFO L401 ceAbstractionStarter]: For program point L606'''(line 606) no Hoare annotation was computed. [2018-01-21 00:58:11,939 INFO L401 ceAbstractionStarter]: For program point L614''(line 614) no Hoare annotation was computed. [2018-01-21 00:58:11,939 INFO L401 ceAbstractionStarter]: For program point L612''''''(line 612) no Hoare annotation was computed. [2018-01-21 00:58:11,939 INFO L401 ceAbstractionStarter]: For program point L605'''''(lines 605 610) no Hoare annotation was computed. [2018-01-21 00:58:11,939 INFO L404 ceAbstractionStarter]: At program point L606'(line 606) the Hoare annotation is: true [2018-01-21 00:58:11,939 INFO L401 ceAbstractionStarter]: For program point inspect_beforeErr0EnsuresViolation(lines 602 615) no Hoare annotation was computed. [2018-01-21 00:58:11,940 INFO L401 ceAbstractionStarter]: For program point L608''''''(line 608) no Hoare annotation was computed. [2018-01-21 00:58:11,940 INFO L401 ceAbstractionStarter]: For program point L612''''(line 612) no Hoare annotation was computed. [2018-01-21 00:58:11,940 INFO L401 ceAbstractionStarter]: For program point L614''''''''(line 614) no Hoare annotation was computed. [2018-01-21 00:58:11,940 INFO L401 ceAbstractionStarter]: For program point L604'''(line 604) no Hoare annotation was computed. [2018-01-21 00:58:11,940 INFO L401 ceAbstractionStarter]: For program point L609''(line 609) no Hoare annotation was computed. [2018-01-21 00:58:11,940 INFO L401 ceAbstractionStarter]: For program point L614'''''(line 614) no Hoare annotation was computed. [2018-01-21 00:58:11,940 INFO L404 ceAbstractionStarter]: At program point L604'(line 604) the Hoare annotation is: true [2018-01-21 00:58:11,940 INFO L401 ceAbstractionStarter]: For program point L611'''(line 611) no Hoare annotation was computed. [2018-01-21 00:58:11,941 INFO L401 ceAbstractionStarter]: For program point L605'''(lines 605 610) no Hoare annotation was computed. [2018-01-21 00:58:11,941 INFO L401 ceAbstractionStarter]: For program point L608''''(line 608) no Hoare annotation was computed. [2018-01-21 00:58:11,941 INFO L401 ceAbstractionStarter]: For program point L614'''''''(line 614) no Hoare annotation was computed. [2018-01-21 00:58:11,941 INFO L401 ceAbstractionStarter]: For program point L605(line 605) no Hoare annotation was computed. [2018-01-21 00:58:11,941 INFO L401 ceAbstractionStarter]: For program point L604(line 604) no Hoare annotation was computed. [2018-01-21 00:58:11,941 INFO L401 ceAbstractionStarter]: For program point L609(line 609) no Hoare annotation was computed. [2018-01-21 00:58:11,941 INFO L401 ceAbstractionStarter]: For program point L608(line 608) no Hoare annotation was computed. [2018-01-21 00:58:11,941 INFO L401 ceAbstractionStarter]: For program point L607(line 607) no Hoare annotation was computed. [2018-01-21 00:58:11,941 INFO L401 ceAbstractionStarter]: For program point L606(line 606) no Hoare annotation was computed. [2018-01-21 00:58:11,942 INFO L401 ceAbstractionStarter]: For program point L613'(line 613) no Hoare annotation was computed. [2018-01-21 00:58:11,942 INFO L404 ceAbstractionStarter]: At program point L604'''''(line 604) the Hoare annotation is: true [2018-01-21 00:58:11,942 INFO L401 ceAbstractionStarter]: For program point L609'(line 609) no Hoare annotation was computed. [2018-01-21 00:58:11,942 INFO L401 ceAbstractionStarter]: For program point inspect_beforeEXIT(lines 602 615) no Hoare annotation was computed. [2018-01-21 00:58:11,942 INFO L404 ceAbstractionStarter]: At program point L612''(line 612) the Hoare annotation is: true [2018-01-21 00:58:11,942 INFO L404 ceAbstractionStarter]: At program point L608''(line 608) the Hoare annotation is: true [2018-01-21 00:58:11,942 INFO L401 ceAbstractionStarter]: For program point L614'(line 614) no Hoare annotation was computed. [2018-01-21 00:58:11,942 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 655) the Hoare annotation is: true [2018-01-21 00:58:11,943 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 655) no Hoare annotation was computed. [2018-01-21 00:58:11,943 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 655) the Hoare annotation is: true [2018-01-21 00:58:11,943 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 655) no Hoare annotation was computed. [2018-01-21 00:58:11,943 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 655) no Hoare annotation was computed. [2018-01-21 00:58:11,943 INFO L401 ceAbstractionStarter]: For program point L650'(line 650) no Hoare annotation was computed. [2018-01-21 00:58:11,943 INFO L401 ceAbstractionStarter]: For program point L649'''(lines 649 653) no Hoare annotation was computed. [2018-01-21 00:58:11,943 INFO L401 ceAbstractionStarter]: For program point L629(line 629) no Hoare annotation was computed. [2018-01-21 00:58:11,943 INFO L401 ceAbstractionStarter]: For program point L628(lines 628 640) no Hoare annotation was computed. [2018-01-21 00:58:11,944 INFO L401 ceAbstractionStarter]: For program point L628''''(lines 628 640) no Hoare annotation was computed. [2018-01-21 00:58:11,944 INFO L401 ceAbstractionStarter]: For program point L651(line 651) no Hoare annotation was computed. [2018-01-21 00:58:11,944 INFO L401 ceAbstractionStarter]: For program point L630''(lines 630 631) no Hoare annotation was computed. [2018-01-21 00:58:11,944 INFO L401 ceAbstractionStarter]: For program point L650(line 650) no Hoare annotation was computed. [2018-01-21 00:58:11,944 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 625 655) no Hoare annotation was computed. [2018-01-21 00:58:11,944 INFO L401 ceAbstractionStarter]: For program point L651'(line 651) no Hoare annotation was computed. [2018-01-21 00:58:11,944 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 625 655) no Hoare annotation was computed. [2018-01-21 00:58:11,944 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 625 655) the Hoare annotation is: true [2018-01-21 00:58:11,944 INFO L401 ceAbstractionStarter]: For program point L644'(line 644) no Hoare annotation was computed. [2018-01-21 00:58:11,945 INFO L404 ceAbstractionStarter]: At program point L644''''(lines 644 645) the Hoare annotation is: true [2018-01-21 00:58:11,945 INFO L401 ceAbstractionStarter]: For program point L628'(lines 628 640) no Hoare annotation was computed. [2018-01-21 00:58:11,945 INFO L404 ceAbstractionStarter]: At program point L645(line 645) the Hoare annotation is: true [2018-01-21 00:58:11,945 INFO L401 ceAbstractionStarter]: For program point L644(lines 644 645) no Hoare annotation was computed. [2018-01-21 00:58:11,945 INFO L404 ceAbstractionStarter]: At program point L643(line 643) the Hoare annotation is: true [2018-01-21 00:58:11,945 INFO L401 ceAbstractionStarter]: For program point L649(lines 649 653) no Hoare annotation was computed. [2018-01-21 00:58:11,945 INFO L401 ceAbstractionStarter]: For program point L648(line 648) no Hoare annotation was computed. [2018-01-21 00:58:11,945 INFO L404 ceAbstractionStarter]: At program point L628'''(lines 628 640) the Hoare annotation is: true [2018-01-21 00:58:11,945 INFO L401 ceAbstractionStarter]: For program point L647(line 647) no Hoare annotation was computed. [2018-01-21 00:58:11,946 INFO L404 ceAbstractionStarter]: At program point L649''(lines 649 653) the Hoare annotation is: true [2018-01-21 00:58:11,946 INFO L401 ceAbstractionStarter]: For program point L646(line 646) no Hoare annotation was computed. [2018-01-21 00:58:11,946 INFO L401 ceAbstractionStarter]: For program point L645'(line 645) no Hoare annotation was computed. [2018-01-21 00:58:11,946 INFO L401 ceAbstractionStarter]: For program point L633'(line 633) no Hoare annotation was computed. [2018-01-21 00:58:11,946 INFO L401 ceAbstractionStarter]: For program point L629'(line 629) no Hoare annotation was computed. [2018-01-21 00:58:11,946 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 625 655) no Hoare annotation was computed. [2018-01-21 00:58:11,946 INFO L401 ceAbstractionStarter]: For program point L630(lines 630 631) no Hoare annotation was computed. [2018-01-21 00:58:11,946 INFO L401 ceAbstractionStarter]: For program point L634(line 634) no Hoare annotation was computed. [2018-01-21 00:58:11,946 INFO L401 ceAbstractionStarter]: For program point L633(line 633) no Hoare annotation was computed. [2018-01-21 00:58:11,947 INFO L404 ceAbstractionStarter]: At program point L644'''(lines 644 645) the Hoare annotation is: true [2018-01-21 00:58:11,947 INFO L401 ceAbstractionStarter]: For program point L632(line 632) no Hoare annotation was computed. [2018-01-21 00:58:11,947 INFO L401 ceAbstractionStarter]: For program point L638(line 638) no Hoare annotation was computed. [2018-01-21 00:58:11,947 INFO L401 ceAbstractionStarter]: For program point L635''(lines 635 636) no Hoare annotation was computed. [2018-01-21 00:58:11,947 INFO L401 ceAbstractionStarter]: For program point L637(line 637) no Hoare annotation was computed. [2018-01-21 00:58:11,947 INFO L401 ceAbstractionStarter]: For program point L635(lines 635 636) no Hoare annotation was computed. [2018-01-21 00:58:11,947 INFO L401 ceAbstractionStarter]: For program point L634'(line 634) no Hoare annotation was computed. [2018-01-21 00:58:11,947 INFO L401 ceAbstractionStarter]: For program point L623(line 623) no Hoare annotation was computed. [2018-01-21 00:58:11,947 INFO L401 ceAbstractionStarter]: For program point L623'''''''(line 623) no Hoare annotation was computed. [2018-01-21 00:58:11,948 INFO L401 ceAbstractionStarter]: For program point L622(line 622) no Hoare annotation was computed. [2018-01-21 00:58:11,948 INFO L401 ceAbstractionStarter]: For program point L622'''(line 622) no Hoare annotation was computed. [2018-01-21 00:58:11,948 INFO L401 ceAbstractionStarter]: For program point L620(line 620) no Hoare annotation was computed. [2018-01-21 00:58:11,948 INFO L404 ceAbstractionStarter]: At program point L623''(line 623) the Hoare annotation is: true [2018-01-21 00:58:11,948 INFO L404 ceAbstractionStarter]: At program point L622'''''''(line 622) the Hoare annotation is: true [2018-01-21 00:58:11,948 INFO L401 ceAbstractionStarter]: For program point L620'''''''(line 620) no Hoare annotation was computed. [2018-01-21 00:58:11,948 INFO L401 ceAbstractionStarter]: For program point L623'(line 623) no Hoare annotation was computed. [2018-01-21 00:58:11,948 INFO L401 ceAbstractionStarter]: For program point L620''''(line 620) no Hoare annotation was computed. [2018-01-21 00:58:11,948 INFO L401 ceAbstractionStarter]: For program point L619'(line 619) no Hoare annotation was computed. [2018-01-21 00:58:11,949 INFO L401 ceAbstractionStarter]: For program point L622'''''(line 622) no Hoare annotation was computed. [2018-01-21 00:58:11,949 INFO L401 ceAbstractionStarter]: For program point L619(line 619) no Hoare annotation was computed. [2018-01-21 00:58:11,949 INFO L401 ceAbstractionStarter]: For program point L618(line 618) no Hoare annotation was computed. [2018-01-21 00:58:11,949 INFO L404 ceAbstractionStarter]: At program point L619''(line 619) the Hoare annotation is: true [2018-01-21 00:58:11,949 INFO L401 ceAbstractionStarter]: For program point L620'(line 620) no Hoare annotation was computed. [2018-01-21 00:58:11,949 INFO L401 ceAbstractionStarter]: For program point L622''''''(line 622) no Hoare annotation was computed. [2018-01-21 00:58:11,949 INFO L404 ceAbstractionStarter]: At program point L620''(line 620) the Hoare annotation is: true [2018-01-21 00:58:11,949 INFO L401 ceAbstractionStarter]: For program point L622''(line 622) no Hoare annotation was computed. [2018-01-21 00:58:11,950 INFO L404 ceAbstractionStarter]: At program point inspect_afterENTRY(lines 616 624) the Hoare annotation is: true [2018-01-21 00:58:11,950 INFO L401 ceAbstractionStarter]: For program point L623''''''(line 623) no Hoare annotation was computed. [2018-01-21 00:58:11,950 INFO L401 ceAbstractionStarter]: For program point inspect_afterErr0EnsuresViolation(lines 616 624) no Hoare annotation was computed. [2018-01-21 00:58:11,950 INFO L401 ceAbstractionStarter]: For program point L618'''(line 618) no Hoare annotation was computed. [2018-01-21 00:58:11,950 INFO L404 ceAbstractionStarter]: At program point L618'''''(line 618) the Hoare annotation is: true [2018-01-21 00:58:11,950 INFO L401 ceAbstractionStarter]: For program point L619''''''(line 619) no Hoare annotation was computed. [2018-01-21 00:58:11,950 INFO L401 ceAbstractionStarter]: For program point L619''''(line 619) no Hoare annotation was computed. [2018-01-21 00:58:11,950 INFO L401 ceAbstractionStarter]: For program point L620''''''(line 620) no Hoare annotation was computed. [2018-01-21 00:58:11,950 INFO L401 ceAbstractionStarter]: For program point L622'(line 622) no Hoare annotation was computed. [2018-01-21 00:58:11,951 INFO L401 ceAbstractionStarter]: For program point L623''''(line 623) no Hoare annotation was computed. [2018-01-21 00:58:11,951 INFO L401 ceAbstractionStarter]: For program point inspect_afterEXIT(lines 616 624) no Hoare annotation was computed. [2018-01-21 00:58:11,951 INFO L404 ceAbstractionStarter]: At program point L618'(line 618) the Hoare annotation is: true [2018-01-21 00:58:11,956 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:58:11,956 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:58:11,956 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:58:11,957 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:58:11,957 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:58:11,957 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:58:11,957 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:58:11,957 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 00:58:11,957 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:58:11,961 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2018-01-21 00:58:11,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 00:58:11,962 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:58:11,962 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 00:58:11,962 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 00:58:11,962 INFO L82 PathProgramCache]: Analyzing trace with hash 563166, now seen corresponding path program 1 times [2018-01-21 00:58:11,962 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:58:11,963 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:58:11,964 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:58:11,964 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:58:11,964 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:58:11,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:58:11,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:58:11,993 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:58:11,996 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:58:12,001 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:58:12,002 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:58:12,002 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:58:12,002 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:58:12,002 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:58:12,002 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:58:12,002 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:58:12,002 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == merge_pairErr0EnsuresViolation======== [2018-01-21 00:58:12,003 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:58:12,006 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2018-01-21 00:58:12,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-21 00:58:12,010 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:58:12,011 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:58:12,011 INFO L371 AbstractCegarLoop]: === Iteration 1 === [merge_pairErr0EnsuresViolation]=== [2018-01-21 00:58:12,011 INFO L82 PathProgramCache]: Analyzing trace with hash -2032860850, now seen corresponding path program 1 times [2018-01-21 00:58:12,011 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:58:12,012 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:58:12,012 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:58:12,013 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:58:12,013 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:58:12,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:58:12,027 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:58:12,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:58:12,053 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:58:12,054 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:58:12,054 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:58:12,054 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:58:12,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:58:12,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:58:12,055 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 2 states. [2018-01-21 00:58:12,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:58:12,077 INFO L93 Difference]: Finished difference Result 417 states and 571 transitions. [2018-01-21 00:58:12,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:58:12,078 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 53 [2018-01-21 00:58:12,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:58:12,083 INFO L225 Difference]: With dead ends: 417 [2018-01-21 00:58:12,083 INFO L226 Difference]: Without dead ends: 150 [2018-01-21 00:58:12,084 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:58:12,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-01-21 00:58:12,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-01-21 00:58:12,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-01-21 00:58:12,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 160 transitions. [2018-01-21 00:58:12,103 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 160 transitions. Word has length 53 [2018-01-21 00:58:12,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:58:12,103 INFO L432 AbstractCegarLoop]: Abstraction has 150 states and 160 transitions. [2018-01-21 00:58:12,103 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:58:12,103 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 160 transitions. [2018-01-21 00:58:12,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-01-21 00:58:12,105 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:58:12,105 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:58:12,105 INFO L371 AbstractCegarLoop]: === Iteration 2 === [merge_pairErr0EnsuresViolation]=== [2018-01-21 00:58:12,105 INFO L82 PathProgramCache]: Analyzing trace with hash -493560614, now seen corresponding path program 1 times [2018-01-21 00:58:12,105 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:58:12,106 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:58:12,106 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:58:12,106 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:58:12,106 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:58:12,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:58:12,124 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:58:12,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:58:12,187 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:58:12,187 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 00:58:12,187 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:58:12,189 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 00:58:12,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 00:58:12,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:58:12,190 INFO L87 Difference]: Start difference. First operand 150 states and 160 transitions. Second operand 3 states. [2018-01-21 00:58:12,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:58:12,222 INFO L93 Difference]: Finished difference Result 294 states and 314 transitions. [2018-01-21 00:58:12,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 00:58:12,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2018-01-21 00:58:12,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:58:12,224 INFO L225 Difference]: With dead ends: 294 [2018-01-21 00:58:12,225 INFO L226 Difference]: Without dead ends: 166 [2018-01-21 00:58:12,226 INFO L525 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 [2018-01-21 00:58:12,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-01-21 00:58:12,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 153. [2018-01-21 00:58:12,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-01-21 00:58:12,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 163 transitions. [2018-01-21 00:58:12,238 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 163 transitions. Word has length 75 [2018-01-21 00:58:12,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:58:12,238 INFO L432 AbstractCegarLoop]: Abstraction has 153 states and 163 transitions. [2018-01-21 00:58:12,238 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 00:58:12,239 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 163 transitions. [2018-01-21 00:58:12,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-01-21 00:58:12,242 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:58:12,242 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:58:12,242 INFO L371 AbstractCegarLoop]: === Iteration 3 === [merge_pairErr0EnsuresViolation]=== [2018-01-21 00:58:12,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1476607212, now seen corresponding path program 1 times [2018-01-21 00:58:12,243 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:58:12,243 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:58:12,244 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:58:12,244 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:58:12,244 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:58:12,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:58:12,302 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:58:12,372 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-21 00:58:12,372 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:58:12,372 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 00:58:12,372 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:58:12,373 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 00:58:12,373 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 00:58:12,373 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 00:58:12,373 INFO L87 Difference]: Start difference. First operand 153 states and 163 transitions. Second operand 3 states. [2018-01-21 00:58:12,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:58:12,389 INFO L93 Difference]: Finished difference Result 237 states and 258 transitions. [2018-01-21 00:58:12,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 00:58:12,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2018-01-21 00:58:12,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:58:12,391 INFO L225 Difference]: With dead ends: 237 [2018-01-21 00:58:12,391 INFO L226 Difference]: Without dead ends: 154 [2018-01-21 00:58:12,392 INFO L525 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 [2018-01-21 00:58:12,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-01-21 00:58:12,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-01-21 00:58:12,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-01-21 00:58:12,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 164 transitions. [2018-01-21 00:58:12,403 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 164 transitions. Word has length 91 [2018-01-21 00:58:12,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:58:12,404 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 164 transitions. [2018-01-21 00:58:12,404 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 00:58:12,404 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 164 transitions. [2018-01-21 00:58:12,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-01-21 00:58:12,406 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:58:12,406 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:58:12,407 INFO L371 AbstractCegarLoop]: === Iteration 4 === [merge_pairErr0EnsuresViolation]=== [2018-01-21 00:58:12,407 INFO L82 PathProgramCache]: Analyzing trace with hash 754057391, now seen corresponding path program 1 times [2018-01-21 00:58:12,407 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:58:12,408 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:58:12,408 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:58:12,408 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:58:12,408 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:58:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:58:12,457 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:58:13,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:58:13,077 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:58:13,077 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-01-21 00:58:13,077 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:58:13,078 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-21 00:58:13,078 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-21 00:58:13,079 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-01-21 00:58:13,079 INFO L87 Difference]: Start difference. First operand 154 states and 164 transitions. Second operand 17 states. [2018-01-21 00:58:13,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:58:13,923 INFO L93 Difference]: Finished difference Result 370 states and 407 transitions. [2018-01-21 00:58:13,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-21 00:58:13,924 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 93 [2018-01-21 00:58:13,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:58:13,927 INFO L225 Difference]: With dead ends: 370 [2018-01-21 00:58:13,927 INFO L226 Difference]: Without dead ends: 286 [2018-01-21 00:58:13,928 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=125, Invalid=687, Unknown=0, NotChecked=0, Total=812 [2018-01-21 00:58:13,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-01-21 00:58:13,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 221. [2018-01-21 00:58:13,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-01-21 00:58:13,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 242 transitions. [2018-01-21 00:58:13,955 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 242 transitions. Word has length 93 [2018-01-21 00:58:13,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:58:13,955 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 242 transitions. [2018-01-21 00:58:13,955 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-21 00:58:13,956 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 242 transitions. [2018-01-21 00:58:13,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-01-21 00:58:13,957 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:58:13,958 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:58:13,958 INFO L371 AbstractCegarLoop]: === Iteration 5 === [merge_pairErr0EnsuresViolation]=== [2018-01-21 00:58:13,958 INFO L82 PathProgramCache]: Analyzing trace with hash -514708738, now seen corresponding path program 1 times [2018-01-21 00:58:13,958 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:58:13,959 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:58:13,959 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:58:13,959 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:58:13,959 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:58:13,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:58:13,983 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:58:14,135 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:58:14,136 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:58:14,136 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-21 00:58:14,136 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:58:14,137 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-21 00:58:14,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-21 00:58:14,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-21 00:58:14,137 INFO L87 Difference]: Start difference. First operand 221 states and 242 transitions. Second operand 7 states. [2018-01-21 00:58:14,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:58:14,283 INFO L93 Difference]: Finished difference Result 343 states and 375 transitions. [2018-01-21 00:58:14,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-21 00:58:14,283 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2018-01-21 00:58:14,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:58:14,285 INFO L225 Difference]: With dead ends: 343 [2018-01-21 00:58:14,285 INFO L226 Difference]: Without dead ends: 256 [2018-01-21 00:58:14,285 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-21 00:58:14,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-01-21 00:58:14,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 231. [2018-01-21 00:58:14,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-01-21 00:58:14,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 253 transitions. [2018-01-21 00:58:14,299 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 253 transitions. Word has length 104 [2018-01-21 00:58:14,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:58:14,300 INFO L432 AbstractCegarLoop]: Abstraction has 231 states and 253 transitions. [2018-01-21 00:58:14,300 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-21 00:58:14,300 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 253 transitions. [2018-01-21 00:58:14,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-01-21 00:58:14,301 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:58:14,301 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:58:14,301 INFO L371 AbstractCegarLoop]: === Iteration 6 === [merge_pairErr0EnsuresViolation]=== [2018-01-21 00:58:14,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1958389758, now seen corresponding path program 1 times [2018-01-21 00:58:14,301 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:58:14,302 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:58:14,302 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:58:14,303 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:58:14,303 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:58:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:58:14,341 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:58:15,126 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:58:15,126 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:58:15,126 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:58:15,127 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 110 with the following transitions: [2018-01-21 00:58:15,129 INFO L201 CegarAbsIntRunner]: [13], [17], [23], [24], [25], [28], [29], [30], [32], [33], [34], [45], [46], [48], [52], [58], [62], [70], [71], [74], [161], [167], [171], [179], [180], [186], [190], [198], [199], [205], [209], [217], [218], [219], [225], [229], [235], [237], [241], [243], [246], [248], [249], [250], [255], [257], [258], [259], [260], [261], [262], [267], [269], [270], [271], [278], [283], [285], [290], [292], [421], [422], [424], [425], [426], [427], [428], [429], [430], [431], [432], [433], [434], [435], [436], [437], [441], [443], [444], [449], [450], [451], [455], [491], [492], [493], [494], [495], [496], [498], [503], [523], [524], [525], [526], [541], [542], [543] [2018-01-21 00:58:15,186 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 00:58:15,187 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 00:58:16,771 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 00:58:16,773 INFO L268 AbstractInterpreter]: Visited 98 different actions 256 times. Merged at 24 different actions 45 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 31 variables. [2018-01-21 00:58:16,785 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 00:58:16,786 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:58:16,786 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 00:58:16,793 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:58:16,793 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 00:58:16,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:58:16,879 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:58:17,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-21 00:58:17,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-21 00:58:17,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:58:17,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:58:17,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-21 00:58:17,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-21 00:58:17,040 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 00:58:17,042 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:58:17,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:58:17,054 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-01-21 00:58:17,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-21 00:58:17,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-21 00:58:17,331 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:58:17,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:58:17,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-21 00:58:17,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-21 00:58:17,345 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 00:58:17,347 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:58:17,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:58:17,351 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-01-21 00:58:17,452 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-21 00:58:17,452 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:58:17,570 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-21 00:58:17,590 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:58:17,591 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-21 00:58:17,594 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:58:17,595 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 00:58:17,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:58:17,756 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:58:17,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-21 00:58:17,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-21 00:58:17,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:58:17,942 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:58:17,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-21 00:58:17,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-21 00:58:17,958 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 00:58:17,960 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:58:17,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:58:17,968 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:22 [2018-01-21 00:58:18,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-01-21 00:58:18,012 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:58:18,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-01-21 00:58:18,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:58:18,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:58:18,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-21 00:58:18,030 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:58:18,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-21 00:58:18,030 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 00:58:18,034 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:58:18,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:58:18,040 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:28 [2018-01-21 00:58:18,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2018-01-21 00:58:18,591 INFO L682 Elim1Store]: detected equality via solver [2018-01-21 00:58:18,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 28 [2018-01-21 00:58:18,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:58:18,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:58:18,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-01-21 00:58:18,614 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:58:18,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-01-21 00:58:18,616 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 00:58:18,620 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:58:18,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:58:18,626 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:52, output treesize:19 [2018-01-21 00:58:18,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-21 00:58:18,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-01-21 00:58:18,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:58:18,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:58:18,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-21 00:58:18,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-21 00:58:18,804 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 00:58:18,805 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:58:18,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:58:18,814 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:30, output treesize:8 [2018-01-21 00:58:18,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-21 00:58:18,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 00:58:18,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:58:18,885 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2018-01-21 00:58:18,924 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:58:18,925 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:58:18,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-21 00:58:18,925 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 00:58:18,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-21 00:58:18,932 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2018-01-21 00:58:18,987 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:58:18,988 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:58:18,989 INFO L700 Elim1Store]: detected not equals via solver [2018-01-21 00:58:18,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-21 00:58:18,990 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-21 00:58:18,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:58:18,998 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:12 [2018-01-21 00:58:19,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-21 00:58:19,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-21 00:58:19,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:58:19,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:58:19,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-21 00:58:19,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-21 00:58:19,050 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 00:58:19,052 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:58:19,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:58:19,058 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:20 [2018-01-21 00:58:19,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-01-21 00:58:19,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-21 00:58:19,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:58:19,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:58:19,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-01-21 00:58:19,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-21 00:58:19,133 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 00:58:19,137 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:58:19,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:58:19,144 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:42, output treesize:16 [2018-01-21 00:58:19,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-01-21 00:58:19,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-01-21 00:58:19,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:58:19,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:58:19,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-21 00:58:19,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-21 00:58:19,198 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 00:58:19,199 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:58:19,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:58:19,201 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:30, output treesize:8 [2018-01-21 00:58:19,264 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:58:19,264 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 00:58:19,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-01-21 00:58:19,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-01-21 00:58:19,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-21 00:58:19,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-21 00:58:19,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-01-21 00:58:19,470 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-21 00:58:19,494 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:58:19,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-21 00:58:19,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-01-21 00:58:19,503 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-21 00:58:19,506 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:58:19,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-01-21 00:58:19,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-01-21 00:58:19,509 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-21 00:58:19,513 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:58:19,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-21 00:58:19,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-01-21 00:58:19,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-01-21 00:58:19,555 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-21 00:58:19,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-01-21 00:58:19,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-01-21 00:58:19,576 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-21 00:58:19,582 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:58:19,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-21 00:58:19,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-01-21 00:58:19,588 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-01-21 00:58:19,592 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:58:19,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-21 00:58:19,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-01-21 00:58:19,596 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-01-21 00:58:19,599 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-21 00:58:19,610 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-21 00:58:19,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-21 00:58:19,633 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:65, output treesize:26 [2018-01-21 00:58:20,776 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-21 00:58:20,778 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 4 imperfect interpolant sequences. [2018-01-21 00:58:20,778 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [27, 9, 6, 30] total 82 [2018-01-21 00:58:20,778 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:58:20,779 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-21 00:58:20,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-21 00:58:20,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=6324, Unknown=15, NotChecked=0, Total=6642 [2018-01-21 00:58:20,781 INFO L87 Difference]: Start difference. First operand 231 states and 253 transitions. Second operand 22 states. [2018-01-21 00:58:23,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:58:23,142 INFO L93 Difference]: Finished difference Result 441 states and 497 transitions. [2018-01-21 00:58:23,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-21 00:58:23,142 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 109 [2018-01-21 00:58:23,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:58:23,145 INFO L225 Difference]: With dead ends: 441 [2018-01-21 00:58:23,145 INFO L226 Difference]: Without dead ends: 347 [2018-01-21 00:58:23,149 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 377 SyntacticMatches, 12 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3175 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=476, Invalid=10429, Unknown=15, NotChecked=0, Total=10920 [2018-01-21 00:58:23,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-01-21 00:58:23,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 250. [2018-01-21 00:58:23,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-01-21 00:58:23,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 275 transitions. [2018-01-21 00:58:23,173 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 275 transitions. Word has length 109 [2018-01-21 00:58:23,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:58:23,174 INFO L432 AbstractCegarLoop]: Abstraction has 250 states and 275 transitions. [2018-01-21 00:58:23,174 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-21 00:58:23,174 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 275 transitions. [2018-01-21 00:58:23,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-01-21 00:58:23,176 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:58:23,176 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:58:23,176 INFO L371 AbstractCegarLoop]: === Iteration 7 === [merge_pairErr0EnsuresViolation]=== [2018-01-21 00:58:23,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1348075899, now seen corresponding path program 1 times [2018-01-21 00:58:23,176 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:58:23,177 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:58:23,177 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:58:23,178 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:58:23,178 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:58:23,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:58:23,347 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:58:23,992 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-01-21 00:58:23,992 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:58:23,992 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:58:23,993 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 117 with the following transitions: [2018-01-21 00:58:23,993 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [13], [17], [23], [24], [25], [32], [33], [34], [48], [52], [58], [62], [70], [71], [74], [161], [167], [171], [179], [180], [186], [190], [198], [199], [205], [209], [217], [218], [219], [225], [229], [235], [237], [241], [243], [246], [248], [249], [250], [255], [257], [258], [259], [260], [261], [262], [267], [269], [270], [271], [278], [283], [285], [290], [421], [422], [424], [425], [426], [427], [428], [429], [430], [431], [432], [433], [434], [435], [436], [437], [441], [443], [444], [447], [449], [450], [451], [455], [457], [458], [459], [462], [482], [491], [492], [493], [494], [495], [496], [498], [503], [523], [524], [525], [537], [538], [541], [542], [543] [2018-01-21 00:58:23,996 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 00:58:23,997 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 00:58:24,753 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (distinct Bool Int) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:399) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.handleInfeasibleCase(BaseRefinementStrategy.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:157) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:117) 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:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (distinct Bool Int) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:321) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:296) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.term(DiffWrapperScript.java:286) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.CongruenceClosureSmtUtils.lambda$1(CongruenceClosureSmtUtils.java:29) at java.util.stream.ReferencePipeline$3$1.accept(ReferencePipeline.java:193) at java.util.Iterator.forEachRemaining(Iterator.java:116) at java.util.Spliterators$IteratorSpliterator.forEachRemaining(Spliterators.java:1801) at java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:481) at java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:471) at java.util.stream.ReduceOps$ReduceOp.evaluateSequential(ReduceOps.java:708) at java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.util.stream.ReferencePipeline.collect(ReferencePipeline.java:499) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.CongruenceClosureSmtUtils.congruenceClosureToCube(CongruenceClosureSmtUtils.java:30) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.WeqCcManager.weqCcToTerm(WeqCcManager.java:935) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.EqConstraint.getTerm(EqConstraint.java:185) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.EqDisjunctiveConstraint.lambda$2(EqDisjunctiveConstraint.java:121) at java.util.stream.ReferencePipeline$3$1.accept(ReferencePipeline.java:193) at java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1548) at java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:481) at java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:471) at java.util.stream.ReduceOps$ReduceOp.evaluateSequential(ReduceOps.java:708) at java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.util.stream.ReferencePipeline.collect(ReferencePipeline.java:499) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.EqDisjunctiveConstraint.getTerm(EqDisjunctiveConstraint.java:121) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqPredicate.(EqPredicate.java:64) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqStateFactory.stateToPredicate(EqStateFactory.java:112) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqState.toEqPredicate(EqState.java:224) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqPostOperator.apply(EqPostOperator.java:121) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqPostOperator.apply(EqPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$16(DisjunctiveAbstractState.java:363) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:443) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:363) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateAbstractPost(FixpointEngine.java:249) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateFixpoint(FixpointEngine.java:134) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.run(FixpointEngine.java:105) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.tool.AbstractInterpreter.runWithoutTimeoutAndResults(AbstractInterpreter.java:148) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.generateFixpoints(CegarAbsIntRunner.java:216) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.constructInterpolantGenerator(BaseTaipanRefinementStrategy.java:379) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getInterpolantGenerator(BaseTaipanRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:388) ... 21 more [2018-01-21 00:58:24,758 INFO L168 Benchmark]: Toolchain (without parser) took 14406.58 ms. Allocated memory was 307.8 MB in the beginning and 805.8 MB in the end (delta: 498.1 MB). Free memory was 266.1 MB in the beginning and 323.0 MB in the end (delta: -56.9 MB). Peak memory consumption was 441.1 MB. Max. memory is 5.3 GB. [2018-01-21 00:58:24,759 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 307.8 MB. Free memory is still 272.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 00:58:24,759 INFO L168 Benchmark]: CACSL2BoogieTranslator took 240.24 ms. Allocated memory is still 307.8 MB. Free memory was 265.1 MB in the beginning and 252.9 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 5.3 GB. [2018-01-21 00:58:24,759 INFO L168 Benchmark]: Boogie Preprocessor took 46.79 ms. Allocated memory is still 307.8 MB. Free memory was 252.9 MB in the beginning and 250.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:58:24,760 INFO L168 Benchmark]: RCFGBuilder took 714.09 ms. Allocated memory is still 307.8 MB. Free memory was 250.9 MB in the beginning and 200.6 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 5.3 GB. [2018-01-21 00:58:24,760 INFO L168 Benchmark]: TraceAbstraction took 13398.55 ms. Allocated memory was 307.8 MB in the beginning and 805.8 MB in the end (delta: 498.1 MB). Free memory was 200.6 MB in the beginning and 323.0 MB in the end (delta: -122.4 MB). Peak memory consumption was 375.7 MB. Max. memory is 5.3 GB. [2018-01-21 00:58:24,762 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 307.8 MB. Free memory is still 272.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 240.24 ms. Allocated memory is still 307.8 MB. Free memory was 265.1 MB in the beginning and 252.9 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 46.79 ms. Allocated memory is still 307.8 MB. Free memory was 252.9 MB in the beginning and 250.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 714.09 ms. Allocated memory is still 307.8 MB. Free memory was 250.9 MB in the beginning and 200.6 MB in the end (delta: 50.3 MB). Peak memory consumption was 50.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 13398.55 ms. Allocated memory was 307.8 MB in the beginning and 805.8 MB in the end (delta: 498.1 MB). Free memory was 200.6 MB in the beginning and 323.0 MB in the end (delta: -122.4 MB). Peak memory consumption was 375.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 96 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 1075 LocStat_NO_SUPPORTING_DISEQUALITIES : 255 LocStat_NO_DISJUNCTIONS : -192 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 108 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 180 TransStat_NO_SUPPORTING_DISEQUALITIES : 60 TransStat_NO_DISJUNCTIONS : 121 TransStat_MAX_NO_DISJUNCTIONS : 3 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.185512 RENAME_VARIABLES(MILLISECONDS) : 0.136751 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.160449 PROJECTAWAY(MILLISECONDS) : 0.046345 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.002888 DISJOIN(MILLISECONDS) : 0.487877 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.163233 ADD_EQUALITY(MILLISECONDS) : 0.044987 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.012217 #CONJOIN_DISJUNCTIVE : 444 #RENAME_VARIABLES : 895 #UNFREEZE : 0 #CONJOIN : 704 #PROJECTAWAY : 609 #ADD_WEAK_EQUALITY : 94 #DISJOIN : 203 #RENAME_VARIABLES_DISJUNCTIVE : 849 #ADD_EQUALITY : 227 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 33 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 553]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: failErr0EnsuresViolation CFG has 9 procedures, 215 locations, 9 error locations. SAFE Result, 0.5s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 234 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=215occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 38 LocationsWithAnnotation, 92 PreInvPairs, 117 NumberOfFragments, 38 HoareAnnotationTreeSize, 92 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 38 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 15 NumberOfCodeBlocks, 15 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 14 ConstructedInterpolants, 0 QuantifiedInterpolants, 196 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 9 procedures, 215 locations, 9 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=215occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (distinct Bool Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (distinct Bool Int): de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:399) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/merge_sort_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_00-58-24-770.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/merge_sort_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-21_00-58-24-770.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/merge_sort_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-21_00-58-24-770.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/merge_sort_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_00-58-24-770.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/merge_sort_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_00-58-24-770.csv Received shutdown request...