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_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-01_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-20 22:29:15,577 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 22:29:15,579 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 22:29:15,592 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 22:29:15,592 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 22:29:15,593 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 22:29:15,595 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 22:29:15,597 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 22:29:15,599 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 22:29:15,600 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 22:29:15,600 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 22:29:15,600 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 22:29:15,601 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 22:29:15,603 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 22:29:15,604 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 22:29:15,607 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 22:29:15,609 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 22:29:15,611 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 22:29:15,612 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 22:29:15,613 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 22:29:15,616 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 22:29:15,616 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 22:29:15,616 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 22:29:15,617 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 22:29:15,618 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 22:29:15,620 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 22:29:15,620 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 22:29:15,621 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 22:29:15,621 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 22:29:15,621 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 22:29:15,622 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 22:29:15,622 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf [2018-01-20 22:29:15,632 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 22:29:15,633 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 22:29:15,633 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 22:29:15,634 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 22:29:15,634 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 22:29:15,634 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 22:29:15,634 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 22:29:15,635 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 22:29:15,635 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 22:29:15,635 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 22:29:15,636 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 22:29:15,636 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 22:29:15,636 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 22:29:15,636 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 22:29:15,636 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 22:29:15,637 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 22:29:15,637 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 22:29:15,637 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 22:29:15,637 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 22:29:15,637 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 22:29:15,638 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 22:29:15,638 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 22:29:15,638 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 22:29:15,638 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 22:29:15,638 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 22:29:15,639 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 22:29:15,639 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 22:29:15,639 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 22:29:15,639 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 22:29:15,639 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 22:29:15,640 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 22:29:15,640 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-20 22:29:15,640 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 22:29:15,640 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 22:29:15,640 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 22:29:15,641 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 22:29:15,641 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 22:29:15,676 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 22:29:15,689 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 22:29:15,693 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 22:29:15,694 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 22:29:15,695 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 22:29:15,696 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-01_true-unreach-call_true-valid-memsafety.i [2018-01-20 22:29:15,877 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 22:29:15,882 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 22:29:15,883 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 22:29:15,883 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 22:29:15,888 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 22:29:15,889 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 10:29:15" (1/1) ... [2018-01-20 22:29:15,891 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39c1589c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:29:15, skipping insertion in model container [2018-01-20 22:29:15,891 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 10:29:15" (1/1) ... [2018-01-20 22:29:15,909 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 22:29:15,952 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 22:29:16,074 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 22:29:16,099 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 22:29:16,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:29:16 WrapperNode [2018-01-20 22:29:16,106 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 22:29:16,107 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 22:29:16,107 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 22:29:16,107 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 22:29:16,117 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:29:16" (1/1) ... [2018-01-20 22:29:16,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:29:16" (1/1) ... [2018-01-20 22:29:16,128 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:29:16" (1/1) ... [2018-01-20 22:29:16,128 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:29:16" (1/1) ... [2018-01-20 22:29:16,135 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:29:16" (1/1) ... [2018-01-20 22:29:16,142 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:29:16" (1/1) ... [2018-01-20 22:29:16,144 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:29:16" (1/1) ... [2018-01-20 22:29:16,147 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 22:29:16,147 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 22:29:16,148 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 22:29:16,148 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 22:29:16,148 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:29:16" (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-20 22:29:16,193 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 22:29:16,193 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 22:29:16,193 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 22:29:16,193 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-20 22:29:16,193 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-20 22:29:16,194 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 22:29:16,194 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 22:29:16,194 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 22:29:16,194 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-20 22:29:16,194 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-20 22:29:16,194 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-20 22:29:16,195 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-20 22:29:16,195 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 22:29:16,195 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 22:29:16,195 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 22:29:16,647 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 22:29:16,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:29:16 BoogieIcfgContainer [2018-01-20 22:29:16,647 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 22:29:16,648 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 22:29:16,648 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 22:29:16,650 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 22:29:16,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 10:29:15" (1/3) ... [2018-01-20 22:29:16,651 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69fab11e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:29:16, skipping insertion in model container [2018-01-20 22:29:16,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:29:16" (2/3) ... [2018-01-20 22:29:16,651 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69fab11e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:29:16, skipping insertion in model container [2018-01-20 22:29:16,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:29:16" (3/3) ... [2018-01-20 22:29:16,653 INFO L105 eAbstractionObserver]: Analyzing ICFG sll-01_true-unreach-call_true-valid-memsafety.i [2018-01-20 22:29:16,659 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 22:29:16,665 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-20 22:29:16,708 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:29:16,709 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:29:16,709 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:29:16,709 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:29:16,709 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:29:16,709 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:29:16,709 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:29:16,709 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 22:29:16,710 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:29:16,726 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states. [2018-01-20 22:29:16,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-20 22:29:16,730 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:29:16,731 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-20 22:29:16,731 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 22:29:16,735 INFO L82 PathProgramCache]: Analyzing trace with hash 393051, now seen corresponding path program 1 times [2018-01-20 22:29:16,736 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:29:16,737 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:29:16,777 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:29:16,778 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:29:16,778 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:29:16,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:29:16,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:29:16,830 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 22:29:16,836 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:29:16,842 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:29:16,843 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:29:16,843 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:29:16,843 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:29:16,843 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:29:16,843 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:29:16,843 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:29:16,843 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 22:29:16,843 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:29:16,846 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states. [2018-01-20 22:29:16,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-20 22:29:16,848 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:29:16,848 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] [2018-01-20 22:29:16,848 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:29:16,848 INFO L82 PathProgramCache]: Analyzing trace with hash -232031712, now seen corresponding path program 1 times [2018-01-20 22:29:16,848 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:29:16,848 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:29:16,849 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:29:16,849 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:29:16,850 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:29:16,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:29:16,872 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:29:16,910 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-20 22:29:16,912 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:29:16,912 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:29:16,914 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:29:17,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:29:17,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:29:17,012 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 2 states. [2018-01-20 22:29:17,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:29:17,045 INFO L93 Difference]: Finished difference Result 237 states and 341 transitions. [2018-01-20 22:29:17,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:29:17,047 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2018-01-20 22:29:17,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:29:17,058 INFO L225 Difference]: With dead ends: 237 [2018-01-20 22:29:17,058 INFO L226 Difference]: Without dead ends: 120 [2018-01-20 22:29:17,061 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-20 22:29:17,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-20 22:29:17,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-01-20 22:29:17,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-01-20 22:29:17,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 129 transitions. [2018-01-20 22:29:17,100 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 129 transitions. Word has length 23 [2018-01-20 22:29:17,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:29:17,101 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 129 transitions. [2018-01-20 22:29:17,101 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:29:17,101 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 129 transitions. [2018-01-20 22:29:17,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-20 22:29:17,103 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:29:17,103 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] [2018-01-20 22:29:17,103 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:29:17,103 INFO L82 PathProgramCache]: Analyzing trace with hash -448715966, now seen corresponding path program 1 times [2018-01-20 22:29:17,104 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:29:17,104 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:29:17,105 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:29:17,105 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:29:17,105 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:29:17,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:29:17,131 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:29:17,297 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-20 22:29:17,298 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:29:17,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 22:29:17,299 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:29:17,300 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:29:17,300 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:29:17,300 INFO L87 Difference]: Start difference. First operand 120 states and 129 transitions. Second operand 5 states. [2018-01-20 22:29:17,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:29:17,556 INFO L93 Difference]: Finished difference Result 280 states and 303 transitions. [2018-01-20 22:29:17,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-20 22:29:17,556 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-01-20 22:29:17,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:29:17,561 INFO L225 Difference]: With dead ends: 280 [2018-01-20 22:29:17,561 INFO L226 Difference]: Without dead ends: 188 [2018-01-20 22:29:17,563 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-20 22:29:17,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-01-20 22:29:17,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 124. [2018-01-20 22:29:17,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-20 22:29:17,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 133 transitions. [2018-01-20 22:29:17,575 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 133 transitions. Word has length 36 [2018-01-20 22:29:17,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:29:17,575 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 133 transitions. [2018-01-20 22:29:17,575 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:29:17,576 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 133 transitions. [2018-01-20 22:29:17,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-20 22:29:17,577 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:29:17,577 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] [2018-01-20 22:29:17,577 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:29:17,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1412768891, now seen corresponding path program 1 times [2018-01-20 22:29:17,578 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:29:17,578 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:29:17,579 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:29:17,579 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:29:17,579 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:29:17,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:29:17,597 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:29:17,662 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-20 22:29:17,663 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:29:17,663 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 22:29:17,663 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:29:17,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:29:17,664 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:29:17,664 INFO L87 Difference]: Start difference. First operand 124 states and 133 transitions. Second operand 5 states. [2018-01-20 22:29:17,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:29:17,767 INFO L93 Difference]: Finished difference Result 206 states and 222 transitions. [2018-01-20 22:29:17,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 22:29:17,768 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-01-20 22:29:17,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:29:17,770 INFO L225 Difference]: With dead ends: 206 [2018-01-20 22:29:17,770 INFO L226 Difference]: Without dead ends: 179 [2018-01-20 22:29:17,771 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-20 22:29:17,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-01-20 22:29:17,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 128. [2018-01-20 22:29:17,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-01-20 22:29:17,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2018-01-20 22:29:17,782 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 38 [2018-01-20 22:29:17,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:29:17,782 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2018-01-20 22:29:17,783 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:29:17,783 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2018-01-20 22:29:17,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-20 22:29:17,785 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:29:17,785 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] [2018-01-20 22:29:17,785 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:29:17,785 INFO L82 PathProgramCache]: Analyzing trace with hash -812324167, now seen corresponding path program 1 times [2018-01-20 22:29:17,785 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:29:17,785 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:29:17,786 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:29:17,786 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:29:17,786 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:29:17,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:29:17,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:29:17,841 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 22:29:17,853 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:29:17,862 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:29:17,863 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:29:17,879 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:29:17,880 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:29:17,880 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:29:17,880 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:29:17,880 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:29:17,880 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:29:17,880 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:29:17,880 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-20 22:29:17,880 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:29:17,883 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states. [2018-01-20 22:29:17,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-20 22:29:17,884 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:29:17,884 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] [2018-01-20 22:29:17,884 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-20 22:29:17,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1381245512, now seen corresponding path program 1 times [2018-01-20 22:29:17,885 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:29:17,885 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:29:17,886 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:29:17,886 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:29:17,886 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:29:17,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:29:17,892 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:29:17,901 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-20 22:29:17,901 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:29:17,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:29:17,901 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:29:17,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:29:17,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:29:17,902 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 2 states. [2018-01-20 22:29:17,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:29:17,909 INFO L93 Difference]: Finished difference Result 237 states and 341 transitions. [2018-01-20 22:29:17,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:29:17,909 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-01-20 22:29:17,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:29:17,911 INFO L225 Difference]: With dead ends: 237 [2018-01-20 22:29:17,911 INFO L226 Difference]: Without dead ends: 118 [2018-01-20 22:29:17,912 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-20 22:29:17,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-20 22:29:17,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-01-20 22:29:17,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-20 22:29:17,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2018-01-20 22:29:17,920 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 21 [2018-01-20 22:29:17,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:29:17,921 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2018-01-20 22:29:17,921 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:29:17,921 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2018-01-20 22:29:17,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-20 22:29:17,922 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:29:17,922 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] [2018-01-20 22:29:17,922 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-20 22:29:17,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1359124646, now seen corresponding path program 1 times [2018-01-20 22:29:17,923 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:29:17,923 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:29:17,924 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:29:17,924 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:29:17,924 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:29:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:29:17,935 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:29:17,994 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-20 22:29:17,994 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:29:17,994 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 22:29:17,995 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:29:17,995 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:29:17,995 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:29:17,995 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand 5 states. [2018-01-20 22:29:18,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:29:18,119 INFO L93 Difference]: Finished difference Result 276 states and 298 transitions. [2018-01-20 22:29:18,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-20 22:29:18,120 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-01-20 22:29:18,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:29:18,122 INFO L225 Difference]: With dead ends: 276 [2018-01-20 22:29:18,122 INFO L226 Difference]: Without dead ends: 186 [2018-01-20 22:29:18,123 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-20 22:29:18,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-01-20 22:29:18,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 122. [2018-01-20 22:29:18,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-20 22:29:18,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 131 transitions. [2018-01-20 22:29:18,134 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 131 transitions. Word has length 34 [2018-01-20 22:29:18,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:29:18,134 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 131 transitions. [2018-01-20 22:29:18,135 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:29:18,135 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2018-01-20 22:29:18,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-20 22:29:18,137 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:29:18,137 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] [2018-01-20 22:29:18,137 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-20 22:29:18,137 INFO L82 PathProgramCache]: Analyzing trace with hash -166833059, now seen corresponding path program 1 times [2018-01-20 22:29:18,137 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:29:18,138 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:29:18,138 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:29:18,139 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:29:18,139 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:29:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:29:18,149 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:29:18,192 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-20 22:29:18,192 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:29:18,193 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 22:29:18,193 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:29:18,193 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:29:18,194 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:29:18,194 INFO L87 Difference]: Start difference. First operand 122 states and 131 transitions. Second operand 5 states. [2018-01-20 22:29:18,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:29:18,320 INFO L93 Difference]: Finished difference Result 202 states and 218 transitions. [2018-01-20 22:29:18,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 22:29:18,321 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-01-20 22:29:18,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:29:18,323 INFO L225 Difference]: With dead ends: 202 [2018-01-20 22:29:18,323 INFO L226 Difference]: Without dead ends: 177 [2018-01-20 22:29:18,323 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-20 22:29:18,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-01-20 22:29:18,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 126. [2018-01-20 22:29:18,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-20 22:29:18,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2018-01-20 22:29:18,331 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 36 [2018-01-20 22:29:18,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:29:18,332 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2018-01-20 22:29:18,332 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:29:18,332 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2018-01-20 22:29:18,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-20 22:29:18,334 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:29:18,334 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] [2018-01-20 22:29:18,334 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-20 22:29:18,335 INFO L82 PathProgramCache]: Analyzing trace with hash -742743919, now seen corresponding path program 1 times [2018-01-20 22:29:18,335 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:29:18,335 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:29:18,336 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:29:18,336 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:29:18,336 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:29:18,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:29:18,355 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:29:18,489 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 22:29:18,490 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:29:18,490 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP 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-20 22:29:18,498 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:29:18,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:29:18,537 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:29:18,625 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~list~5.base Int)) (and (= 0 (select |c_old(#valid)| main_~list~5.base)) (= |c_#valid| (store |c_old(#valid)| main_~list~5.base 0)) (not (= 0 main_~list~5.base)))) is different from true [2018-01-20 22:29:18,656 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2018-01-20 22:29:18,692 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:29:18,692 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 8 [2018-01-20 22:29:18,692 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-20 22:29:18,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-20 22:29:18,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=43, Unknown=1, NotChecked=12, Total=72 [2018-01-20 22:29:18,693 INFO L87 Difference]: Start difference. First operand 126 states and 135 transitions. Second operand 9 states. [2018-01-20 22:29:18,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:29:18,905 INFO L93 Difference]: Finished difference Result 210 states and 225 transitions. [2018-01-20 22:29:18,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-20 22:29:18,906 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2018-01-20 22:29:18,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:29:18,907 INFO L225 Difference]: With dead ends: 210 [2018-01-20 22:29:18,908 INFO L226 Difference]: Without dead ends: 207 [2018-01-20 22:29:18,908 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=114, Unknown=1, NotChecked=22, Total=182 [2018-01-20 22:29:18,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-01-20 22:29:18,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 174. [2018-01-20 22:29:18,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-01-20 22:29:18,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 188 transitions. [2018-01-20 22:29:18,919 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 188 transitions. Word has length 56 [2018-01-20 22:29:18,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:29:18,920 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 188 transitions. [2018-01-20 22:29:18,920 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-20 22:29:18,920 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 188 transitions. [2018-01-20 22:29:18,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-20 22:29:18,922 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:29:18,922 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] [2018-01-20 22:29:18,922 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-20 22:29:18,922 INFO L82 PathProgramCache]: Analyzing trace with hash -88253661, now seen corresponding path program 1 times [2018-01-20 22:29:18,922 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:29:18,922 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:29:18,923 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:29:18,924 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:29:18,924 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:29:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:29:18,939 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:29:19,074 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 22:29:19,074 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:29:19,074 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-20 22:29:19,075 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-20 22:29:19,075 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-20 22:29:19,075 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-20 22:29:19,075 INFO L87 Difference]: Start difference. First operand 174 states and 188 transitions. Second operand 7 states. [2018-01-20 22:29:19,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:29:19,366 INFO L93 Difference]: Finished difference Result 268 states and 289 transitions. [2018-01-20 22:29:19,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-20 22:29:19,367 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2018-01-20 22:29:19,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:29:19,368 INFO L225 Difference]: With dead ends: 268 [2018-01-20 22:29:19,368 INFO L226 Difference]: Without dead ends: 243 [2018-01-20 22:29:19,368 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-01-20 22:29:19,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-01-20 22:29:19,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 216. [2018-01-20 22:29:19,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-01-20 22:29:19,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 234 transitions. [2018-01-20 22:29:19,377 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 234 transitions. Word has length 61 [2018-01-20 22:29:19,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:29:19,378 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 234 transitions. [2018-01-20 22:29:19,378 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-20 22:29:19,378 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 234 transitions. [2018-01-20 22:29:19,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-20 22:29:19,379 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:29:19,379 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] [2018-01-20 22:29:19,379 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation]=== [2018-01-20 22:29:19,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1451296922, now seen corresponding path program 1 times [2018-01-20 22:29:19,379 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:29:19,380 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:29:19,380 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:29:19,381 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:29:19,381 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:29:19,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:29:19,395 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:29:19,604 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-20 22:29:19,604 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:29:19,604 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-20 22:29:19,605 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-20 22:29:19,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-20 22:29:19,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-01-20 22:29:19,605 INFO L87 Difference]: Start difference. First operand 216 states and 234 transitions. Second operand 11 states. [2018-01-20 22:29:20,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:29:20,054 INFO L93 Difference]: Finished difference Result 435 states and 468 transitions. [2018-01-20 22:29:20,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-20 22:29:20,087 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2018-01-20 22:29:20,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:29:20,088 INFO L225 Difference]: With dead ends: 435 [2018-01-20 22:29:20,089 INFO L226 Difference]: Without dead ends: 339 [2018-01-20 22:29:20,089 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-01-20 22:29:20,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-01-20 22:29:20,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 211. [2018-01-20 22:29:20,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-01-20 22:29:20,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 228 transitions. [2018-01-20 22:29:20,102 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 228 transitions. Word has length 63 [2018-01-20 22:29:20,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:29:20,103 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 228 transitions. [2018-01-20 22:29:20,103 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-20 22:29:20,103 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 228 transitions. [2018-01-20 22:29:20,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-20 22:29:20,104 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:29:20,104 INFO L322 BasicCegarLoop]: trace histogram [3, 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] [2018-01-20 22:29:20,104 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation]=== [2018-01-20 22:29:20,105 INFO L82 PathProgramCache]: Analyzing trace with hash 719042180, now seen corresponding path program 2 times [2018-01-20 22:29:20,105 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:29:20,105 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:29:20,106 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:29:20,106 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:29:20,106 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:29:20,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:29:20,116 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:29:20,362 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:29:20,362 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:29:20,362 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:29:20,368 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 22:29:20,389 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:29:20,412 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:29:20,419 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:29:20,423 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:29:20,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-20 22:29:20,443 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-20 22:29:20,443 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:20,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:20,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:20,446 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-01-20 22:29:20,469 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-20 22:29:20,472 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:20,474 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-20 22:29:20,474 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:20,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:20,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:20,482 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2018-01-20 22:29:20,546 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 24 treesize of output 18 [2018-01-20 22:29:20,549 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:20,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 18 treesize of output 10 [2018-01-20 22:29:20,549 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:20,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:20,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:20,553 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:3 [2018-01-20 22:29:20,612 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:29:20,632 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:29:20,632 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2018-01-20 22:29:20,632 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-20 22:29:20,633 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-20 22:29:20,633 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2018-01-20 22:29:20,633 INFO L87 Difference]: Start difference. First operand 211 states and 228 transitions. Second operand 19 states. [2018-01-20 22:29:21,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:29:21,151 INFO L93 Difference]: Finished difference Result 401 states and 433 transitions. [2018-01-20 22:29:21,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-20 22:29:21,151 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 65 [2018-01-20 22:29:21,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:29:21,152 INFO L225 Difference]: With dead ends: 401 [2018-01-20 22:29:21,152 INFO L226 Difference]: Without dead ends: 304 [2018-01-20 22:29:21,153 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=669, Unknown=0, NotChecked=0, Total=812 [2018-01-20 22:29:21,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-01-20 22:29:21,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 214. [2018-01-20 22:29:21,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-01-20 22:29:21,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 229 transitions. [2018-01-20 22:29:21,164 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 229 transitions. Word has length 65 [2018-01-20 22:29:21,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:29:21,164 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 229 transitions. [2018-01-20 22:29:21,164 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-20 22:29:21,164 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 229 transitions. [2018-01-20 22:29:21,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-20 22:29:21,165 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:29:21,165 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] [2018-01-20 22:29:21,166 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation]=== [2018-01-20 22:29:21,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1069337952, now seen corresponding path program 1 times [2018-01-20 22:29:21,166 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:29:21,166 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:29:21,166 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:29:21,167 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:29:21,167 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:29:21,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:29:21,176 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:29:21,405 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 22:29:21,405 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:29:21,406 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-20 22:29:21,406 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-20 22:29:21,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-20 22:29:21,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-20 22:29:21,406 INFO L87 Difference]: Start difference. First operand 214 states and 229 transitions. Second operand 7 states. [2018-01-20 22:29:21,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:29:21,696 INFO L93 Difference]: Finished difference Result 282 states and 299 transitions. [2018-01-20 22:29:21,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-20 22:29:21,697 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2018-01-20 22:29:21,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:29:21,698 INFO L225 Difference]: With dead ends: 282 [2018-01-20 22:29:21,698 INFO L226 Difference]: Without dead ends: 224 [2018-01-20 22:29:21,699 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-01-20 22:29:21,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-01-20 22:29:21,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 220. [2018-01-20 22:29:21,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-01-20 22:29:21,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 235 transitions. [2018-01-20 22:29:21,708 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 235 transitions. Word has length 69 [2018-01-20 22:29:21,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:29:21,708 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 235 transitions. [2018-01-20 22:29:21,708 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-20 22:29:21,709 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 235 transitions. [2018-01-20 22:29:21,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-01-20 22:29:21,709 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:29:21,709 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] [2018-01-20 22:29:21,709 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation]=== [2018-01-20 22:29:21,709 INFO L82 PathProgramCache]: Analyzing trace with hash 16076814, now seen corresponding path program 1 times [2018-01-20 22:29:21,710 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:29:21,710 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:29:21,710 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:29:21,711 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:29:21,711 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:29:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:29:21,726 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:29:22,362 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 22:29:22,363 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:29:22,363 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:29:22,368 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:29:22,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:29:22,396 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:29:22,464 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 19 treesize of output 15 [2018-01-20 22:29:22,466 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 15 treesize of output 3 [2018-01-20 22:29:22,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:22,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:22,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:22,470 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:3 [2018-01-20 22:29:22,513 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 22:29:22,533 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:29:22,533 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2018-01-20 22:29:22,534 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-20 22:29:22,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-20 22:29:22,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2018-01-20 22:29:22,534 INFO L87 Difference]: Start difference. First operand 220 states and 235 transitions. Second operand 20 states. [2018-01-20 22:29:23,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:29:23,859 INFO L93 Difference]: Finished difference Result 478 states and 511 transitions. [2018-01-20 22:29:23,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-01-20 22:29:23,859 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 74 [2018-01-20 22:29:23,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:29:23,861 INFO L225 Difference]: With dead ends: 478 [2018-01-20 22:29:23,861 INFO L226 Difference]: Without dead ends: 325 [2018-01-20 22:29:23,863 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 76 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=308, Invalid=2554, Unknown=0, NotChecked=0, Total=2862 [2018-01-20 22:29:23,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-01-20 22:29:23,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 277. [2018-01-20 22:29:23,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-01-20 22:29:23,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 299 transitions. [2018-01-20 22:29:23,880 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 299 transitions. Word has length 74 [2018-01-20 22:29:23,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:29:23,881 INFO L432 AbstractCegarLoop]: Abstraction has 277 states and 299 transitions. [2018-01-20 22:29:23,881 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-20 22:29:23,881 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 299 transitions. [2018-01-20 22:29:23,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-20 22:29:23,882 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:29:23,882 INFO L322 BasicCegarLoop]: trace histogram [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] [2018-01-20 22:29:23,882 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation]=== [2018-01-20 22:29:23,883 INFO L82 PathProgramCache]: Analyzing trace with hash -687773399, now seen corresponding path program 1 times [2018-01-20 22:29:23,883 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:29:23,883 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:29:23,884 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:29:23,884 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:29:23,884 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:29:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:29:23,896 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:29:23,949 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-20 22:29:23,950 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:29:23,950 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 22:29:23,950 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:29:23,950 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:29:23,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:29:23,951 INFO L87 Difference]: Start difference. First operand 277 states and 299 transitions. Second operand 5 states. [2018-01-20 22:29:24,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:29:24,080 INFO L93 Difference]: Finished difference Result 506 states and 549 transitions. [2018-01-20 22:29:24,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-20 22:29:24,081 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2018-01-20 22:29:24,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:29:24,082 INFO L225 Difference]: With dead ends: 506 [2018-01-20 22:29:24,082 INFO L226 Difference]: Without dead ends: 293 [2018-01-20 22:29:24,082 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-20 22:29:24,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-01-20 22:29:24,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 281. [2018-01-20 22:29:24,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-01-20 22:29:24,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 302 transitions. [2018-01-20 22:29:24,093 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 302 transitions. Word has length 79 [2018-01-20 22:29:24,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:29:24,093 INFO L432 AbstractCegarLoop]: Abstraction has 281 states and 302 transitions. [2018-01-20 22:29:24,093 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:29:24,093 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 302 transitions. [2018-01-20 22:29:24,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-20 22:29:24,093 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:29:24,094 INFO L322 BasicCegarLoop]: trace histogram [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] [2018-01-20 22:29:24,094 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation]=== [2018-01-20 22:29:24,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1760297446, now seen corresponding path program 1 times [2018-01-20 22:29:24,094 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:29:24,094 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:29:24,095 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:29:24,095 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:29:24,095 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:29:24,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:29:24,106 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:29:24,328 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 22:29:24,328 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:29:24,328 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:29:24,333 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:29:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:29:24,364 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:29:24,367 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-20 22:29:24,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:24,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:24,373 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-20 22:29:24,393 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:24,394 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:24,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-20 22:29:24,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:24,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:24,402 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2018-01-20 22:29:24,415 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-20 22:29:24,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-01-20 22:29:24,418 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:24,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:24,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:24,431 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-01-20 22:29:24,510 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:24,513 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 35 treesize of output 36 [2018-01-20 22:29:24,515 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-20 22:29:24,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:24,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:24,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:24,546 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-01-20 22:29:24,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2018-01-20 22:29:24,592 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:24,592 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 20 treesize of output 31 [2018-01-20 22:29:24,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:24,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:24,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:29:24,606 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-01-20 22:29:24,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 30 [2018-01-20 22:29:24,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 18 treesize of output 9 [2018-01-20 22:29:24,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:24,757 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:24,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 13 treesize of output 6 [2018-01-20 22:29:24,758 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:24,763 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:24,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:24,766 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:48, output treesize:4 [2018-01-20 22:29:24,816 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 22:29:24,836 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:29:24,836 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 21 [2018-01-20 22:29:24,837 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-20 22:29:24,837 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-20 22:29:24,837 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2018-01-20 22:29:24,837 INFO L87 Difference]: Start difference. First operand 281 states and 302 transitions. Second operand 21 states. [2018-01-20 22:29:25,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:29:25,788 INFO L93 Difference]: Finished difference Result 576 states and 620 transitions. [2018-01-20 22:29:25,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-20 22:29:25,788 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 81 [2018-01-20 22:29:25,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:29:25,791 INFO L225 Difference]: With dead ends: 576 [2018-01-20 22:29:25,791 INFO L226 Difference]: Without dead ends: 544 [2018-01-20 22:29:25,792 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 70 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=246, Invalid=1236, Unknown=0, NotChecked=0, Total=1482 [2018-01-20 22:29:25,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2018-01-20 22:29:25,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 423. [2018-01-20 22:29:25,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-01-20 22:29:25,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 456 transitions. [2018-01-20 22:29:25,816 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 456 transitions. Word has length 81 [2018-01-20 22:29:25,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:29:25,816 INFO L432 AbstractCegarLoop]: Abstraction has 423 states and 456 transitions. [2018-01-20 22:29:25,817 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-20 22:29:25,817 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 456 transitions. [2018-01-20 22:29:25,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-01-20 22:29:25,818 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:29:25,818 INFO L322 BasicCegarLoop]: trace histogram [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] [2018-01-20 22:29:25,818 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation]=== [2018-01-20 22:29:25,819 INFO L82 PathProgramCache]: Analyzing trace with hash -126513239, now seen corresponding path program 1 times [2018-01-20 22:29:25,819 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:29:25,819 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:29:25,820 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:29:25,820 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:29:25,820 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:29:25,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:29:25,840 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:29:26,231 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 22:29:26,231 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:29:26,231 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:29:26,236 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:29:26,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:29:26,267 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:29:26,278 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-20 22:29:26,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:26,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:26,280 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-20 22:29:26,289 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:26,290 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:26,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 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-20 22:29:26,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:26,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:26,297 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:25 [2018-01-20 22:29:26,309 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-20 22:29:26,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-01-20 22:29:26,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:26,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:26,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:26,321 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-01-20 22:29:26,386 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:26,388 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 44 treesize of output 45 [2018-01-20 22:29:26,390 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-20 22:29:26,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:26,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:26,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:26,401 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2018-01-20 22:29:26,426 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:26,426 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:26,427 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:26,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-01-20 22:29:26,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:26,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:26,435 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:43 [2018-01-20 22:29:26,460 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:26,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 51 [2018-01-20 22:29:26,465 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:26,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-20 22:29:26,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:26,474 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:26,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:26,481 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:55 [2018-01-20 22:29:26,525 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:26,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 86 [2018-01-20 22:29:26,532 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 14 treesize of output 13 [2018-01-20 22:29:26,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:26,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:26,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-20 22:29:26,549 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:64 [2018-01-20 22:29:26,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 79 [2018-01-20 22:29:26,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 26 treesize of output 37 [2018-01-20 22:29:26,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:26,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:26,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-20 22:29:26,637 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:110, output treesize:96 [2018-01-20 22:29:30,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 60 [2018-01-20 22:29:30,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-01-20 22:29:30,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:30,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 17 [2018-01-20 22:29:30,762 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:30,769 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:29:30,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-01-20 22:29:30,770 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:29:30,773 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:30,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:29:30,776 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:103, output treesize:4 [2018-01-20 22:29:30,870 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 22:29:30,903 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:29:30,903 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 30 [2018-01-20 22:29:30,904 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-20 22:29:30,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-20 22:29:30,904 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=758, Unknown=2, NotChecked=0, Total=870 [2018-01-20 22:29:30,904 INFO L87 Difference]: Start difference. First operand 423 states and 456 transitions. Second operand 30 states. [2018-01-20 22:29:43,628 WARN L143 SmtUtils]: Spent 106ms on a formula simplification that was a NOOP. DAG size: 58 [2018-01-20 22:29:47,701 WARN L143 SmtUtils]: Spent 2031ms on a formula simplification that was a NOOP. DAG size: 64 [2018-01-20 22:29:55,825 WARN L143 SmtUtils]: Spent 2099ms on a formula simplification that was a NOOP. DAG size: 60 [2018-01-20 22:30:15,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:30:15,034 INFO L93 Difference]: Finished difference Result 743 states and 801 transitions. [2018-01-20 22:30:15,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-01-20 22:30:15,034 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 86 [2018-01-20 22:30:15,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:30:15,036 INFO L225 Difference]: With dead ends: 743 [2018-01-20 22:30:15,036 INFO L226 Difference]: Without dead ends: 711 [2018-01-20 22:30:15,037 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 70 SyntacticMatches, 6 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 917 ImplicationChecksByTransitivity, 41.5s TimeCoverageRelationStatistics Valid=557, Invalid=3085, Unknown=18, NotChecked=0, Total=3660 [2018-01-20 22:30:15,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2018-01-20 22:30:15,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 435. [2018-01-20 22:30:15,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-01-20 22:30:15,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 469 transitions. [2018-01-20 22:30:15,062 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 469 transitions. Word has length 86 [2018-01-20 22:30:15,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:30:15,062 INFO L432 AbstractCegarLoop]: Abstraction has 435 states and 469 transitions. [2018-01-20 22:30:15,062 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-20 22:30:15,063 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 469 transitions. [2018-01-20 22:30:15,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-01-20 22:30:15,064 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:30:15,064 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-01-20 22:30:15,064 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation]=== [2018-01-20 22:30:15,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1530957106, now seen corresponding path program 2 times [2018-01-20 22:30:15,065 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:30:15,065 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:30:15,066 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:30:15,066 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:30:15,066 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:30:15,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:30:15,084 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:30:15,873 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-20 22:30:15,874 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:30:15,874 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:30:15,879 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 22:30:15,891 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:30:15,902 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:30:15,905 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:30:15,909 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:30:16,014 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 44 treesize of output 41 [2018-01-20 22:30:16,016 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-20 22:30:16,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:30:16,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:30:16,026 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 44 treesize of output 41 [2018-01-20 22:30:16,027 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-20 22:30:16,028 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:30:16,035 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:30:16,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:30:16,058 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:89, output treesize:83 [2018-01-20 22:30:16,172 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:16,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 54 [2018-01-20 22:30:16,177 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-20 22:30:16,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:30:16,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:30:16,204 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:16,206 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 53 treesize of output 54 [2018-01-20 22:30:16,208 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-20 22:30:16,208 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:30:16,218 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:30:16,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:30:16,241 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:107, output treesize:99 [2018-01-20 22:30:16,292 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:16,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 65 [2018-01-20 22:30:16,300 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:16,301 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 20 treesize of output 31 [2018-01-20 22:30:16,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:30:16,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:30:16,340 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:16,343 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 65 [2018-01-20 22:30:16,346 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:16,346 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 20 treesize of output 31 [2018-01-20 22:30:16,346 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:30:16,357 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:30:16,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-20 22:30:16,379 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:135, output treesize:119 [2018-01-20 22:30:16,531 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:16,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 54 [2018-01-20 22:30:16,536 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:16,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 13 treesize of output 6 [2018-01-20 22:30:16,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:30:16,551 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 27 treesize of output 18 [2018-01-20 22:30:16,552 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:30:16,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:30:16,587 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:16,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 54 [2018-01-20 22:30:16,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 33 treesize of output 22 [2018-01-20 22:30:16,594 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-20 22:30:16,609 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:30:16,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 13 treesize of output 6 [2018-01-20 22:30:16,610 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-20 22:30:16,642 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:30:16,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:30:16,662 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:133, output treesize:55 [2018-01-20 22:30:16,867 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~list~5.base Int)) (let ((.cse0 (store |c_old(#valid)| main_~list~5.base 1))) (and (= (select .cse0 c_main_~end~5.base) 0) (= 0 (select |c_old(#valid)| main_~list~5.base)) (= |c_#valid| (store (store .cse0 c_main_~end~5.base 1) main_~list~5.base 0)) (not (= 0 main_~list~5.base))))) is different from true [2018-01-20 22:30:16,876 WARN L1029 $PredicateComparison]: unable to prove that (exists ((v_subst_1 Int)) (let ((.cse0 (store |c_old(#valid)| v_subst_1 1))) (and (= 0 (select |c_old(#valid)| v_subst_1)) (not (= 0 v_subst_1)) (= |c_#valid| (store (store .cse0 c_main_~list~5.base 1) v_subst_1 0)) (= (select .cse0 c_main_~list~5.base) 0)))) is different from true [2018-01-20 22:30:17,461 WARN L1029 $PredicateComparison]: unable to prove that (or (and (not (= c_main_~list~5.offset 0)) (exists ((v_prenex_8 Int)) (let ((.cse0 (store |c_old(#valid)| v_prenex_8 1))) (and (not (= 0 v_prenex_8)) (= 0 (select |c_old(#valid)| v_prenex_8)) (= (select .cse0 c_main_~list~5.base) 0) (= |c_#valid| (store (store .cse0 c_main_~list~5.base 1) v_prenex_8 0)))))) (and (exists ((v_subst_1 Int)) (let ((.cse1 (store |c_old(#valid)| v_subst_1 1))) (and (= 0 (select |c_old(#valid)| v_subst_1)) (not (= 0 v_subst_1)) (= |c_#valid| (store (store .cse1 c_main_~list~5.base 1) v_subst_1 0)) (= (select .cse1 c_main_~list~5.base) 0)))) (not (= 0 c_main_~list~5.base)))) is different from true [2018-01-20 22:30:17,471 WARN L1029 $PredicateComparison]: unable to prove that (exists ((main_~list~5.base Int) (v_subst_1 Int)) (let ((.cse0 (store |c_old(#valid)| v_subst_1 1))) (and (= 0 (select |c_old(#valid)| v_subst_1)) (not (= 0 v_subst_1)) (= |c_#valid| (store (store (store .cse0 main_~list~5.base 1) v_subst_1 0) main_~list~5.base 0)) (= (select .cse0 main_~list~5.base) 0) (not (= 0 main_~list~5.base))))) is different from true [2018-01-20 22:30:17,552 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 9 not checked. [2018-01-20 22:30:17,572 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:30:17,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 34 [2018-01-20 22:30:17,573 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-20 22:30:17,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-20 22:30:17,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=822, Unknown=21, NotChecked=244, Total=1190 [2018-01-20 22:30:17,573 INFO L87 Difference]: Start difference. First operand 435 states and 469 transitions. Second operand 35 states. [2018-01-20 22:30:18,508 WARN L146 SmtUtils]: Spent 155ms on a formula simplification. DAG size of input: 68 DAG size of output 36 [2018-01-20 22:30:19,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:30:19,641 INFO L93 Difference]: Finished difference Result 522 states and 561 transitions. [2018-01-20 22:30:19,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-20 22:30:19,642 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 101 [2018-01-20 22:30:19,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:30:19,643 INFO L225 Difference]: With dead ends: 522 [2018-01-20 22:30:19,643 INFO L226 Difference]: Without dead ends: 519 [2018-01-20 22:30:19,644 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 86 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=257, Invalid=2089, Unknown=22, NotChecked=388, Total=2756 [2018-01-20 22:30:19,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2018-01-20 22:30:19,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 481. [2018-01-20 22:30:19,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2018-01-20 22:30:19,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 519 transitions. [2018-01-20 22:30:19,669 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 519 transitions. Word has length 101 [2018-01-20 22:30:19,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:30:19,669 INFO L432 AbstractCegarLoop]: Abstraction has 481 states and 519 transitions. [2018-01-20 22:30:19,670 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-01-20 22:30:19,670 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 519 transitions. [2018-01-20 22:30:19,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-01-20 22:30:19,671 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:30:19,672 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-01-20 22:30:19,672 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation]=== [2018-01-20 22:30:19,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1385355232, now seen corresponding path program 1 times [2018-01-20 22:30:19,672 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:30:19,672 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:30:19,673 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:30:19,673 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:30:19,673 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:30:19,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:30:19,695 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:30:20,407 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-20 22:30:20,407 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:30:20,407 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-20 22:30:20,413 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:30:20,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:30:20,446 INFO L270 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2018-01-20 22:30:20,578 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-20 22:30:20,578 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-20 22:30:20,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 10:30:20 BoogieIcfgContainer [2018-01-20 22:30:20,580 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-20 22:30:20,581 INFO L168 Benchmark]: Toolchain (without parser) took 64703.59 ms. Allocated memory was 298.3 MB in the beginning and 676.3 MB in the end (delta: 378.0 MB). Free memory was 256.2 MB in the beginning and 542.9 MB in the end (delta: -286.7 MB). Peak memory consumption was 91.4 MB. Max. memory is 5.3 GB. [2018-01-20 22:30:20,583 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 298.3 MB. Free memory is still 262.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 22:30:20,583 INFO L168 Benchmark]: CACSL2BoogieTranslator took 223.65 ms. Allocated memory is still 298.3 MB. Free memory was 255.2 MB in the beginning and 243.2 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. [2018-01-20 22:30:20,583 INFO L168 Benchmark]: Boogie Preprocessor took 40.14 ms. Allocated memory is still 298.3 MB. Free memory was 243.2 MB in the beginning and 241.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-20 22:30:20,584 INFO L168 Benchmark]: RCFGBuilder took 500.07 ms. Allocated memory is still 298.3 MB. Free memory was 241.2 MB in the beginning and 208.1 MB in the end (delta: 33.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 5.3 GB. [2018-01-20 22:30:20,584 INFO L168 Benchmark]: TraceAbstraction took 63932.35 ms. Allocated memory was 298.3 MB in the beginning and 676.3 MB in the end (delta: 378.0 MB). Free memory was 208.1 MB in the beginning and 542.9 MB in the end (delta: -334.8 MB). Peak memory consumption was 43.2 MB. Max. memory is 5.3 GB. [2018-01-20 22:30:20,586 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.19 ms. Allocated memory is still 298.3 MB. Free memory is still 262.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 223.65 ms. Allocated memory is still 298.3 MB. Free memory was 255.2 MB in the beginning and 243.2 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.14 ms. Allocated memory is still 298.3 MB. Free memory was 243.2 MB in the beginning and 241.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 500.07 ms. Allocated memory is still 298.3 MB. Free memory was 241.2 MB in the beginning and 208.1 MB in the end (delta: 33.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 63932.35 ms. Allocated memory was 298.3 MB in the beginning and 676.3 MB in the end (delta: 378.0 MB). Free memory was 208.1 MB in the beginning and 542.9 MB in the end (delta: -334.8 MB). Peak memory consumption was 43.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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 3 procedures, 123 locations, 3 error locations. UNSAFE Result, 0.1s 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=123occurred 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 - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L991] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={10:0}] [L991] SLL* list = malloc(sizeof(SLL)); VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L992] FCALL list->next = ((void*)0) VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L993] COND FALSE !(!(list != ((void*)0))) VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L993] COND FALSE !(0) VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L993] COND TRUE __VERIFIER_nondet_int() [L993] FCALL list->inner = ((void*)0) VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L993] EXPR, FCALL list->inner VAL [list={10:0}, list->inner={0:0}, malloc(sizeof(SLL))={10:0}] [L993] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={10:0}, list->inner={0:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=0, malloc(sizeof(SLL))={10:0}] [L993] EXPR, FCALL list->inner VAL [list={10:0}, list->inner={0:0}, list->inner={0:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=0, malloc(sizeof(SLL))={10:0}] [L993] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={10:0}, list->inner={0:0}, list->inner={0:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={10:0}] [L993] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L993] COND FALSE !(0) VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L995] SLL* end = list; VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={10:0}] [L998] COND FALSE !(__VERIFIER_nondet_int()) [L1008] end = ((void*)0) [L1009] end = list VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1012] COND FALSE !(!(((void*)0) != end)) VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1012] COND FALSE !(0) VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1014] COND TRUE ((void*)0) != end [L1016] int len = 0; VAL [end={10:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1017] EXPR, FCALL end->inner VAL [end={10:0}, end->inner={0:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1017] SLL* inner = end->inner; [L1018] COND FALSE !(((void*)0) != inner) VAL [end={10:0}, inner={0:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1029] COND FALSE !(!(len <= 1)) VAL [end={10:0}, inner={0:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1029] COND FALSE !(0) VAL [end={10:0}, inner={0:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1031] EXPR, FCALL end->next VAL [end={10:0}, end->next={0:0}, inner={0:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1031] end = end->next [L1014] COND FALSE !(((void*)0) != end) VAL [end={0:0}, inner={0:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1035] COND TRUE ((void*)0) != list VAL [end={0:0}, inner={0:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1037] EXPR, FCALL list->inner VAL [end={0:0}, inner={0:0}, len=0, list={10:0}, list->inner={0:0}, malloc(sizeof(SLL))={10:0}] [L1037] end = list->inner [L1039] COND FALSE !(((void*)0) != end) VAL [end={0:0}, inner={0:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1047] EXPR, FCALL list->next VAL [end={0:0}, inner={0:0}, len=0, list={10:0}, list->next={0:0}, malloc(sizeof(SLL))={10:0}] [L1047] end = list->next [L1048] FCALL free(list) VAL [end={0:0}, inner={0:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1049] list = end VAL [end={0:0}, inner={0:0}, len=0, list={0:0}, malloc(sizeof(SLL))={10:0}] [L1035] COND FALSE !(((void*)0) != list) VAL [end={0:0}, inner={0:0}, len=0, list={0:0}, malloc(sizeof(SLL))={10:0}] [L1052] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 3 procedures, 123 locations, 3 error locations. UNSAFE Result, 1.0s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 350 SDtfs, 417 SDslu, 428 SDs, 0 SdLazy, 161 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=3, 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, 3 MinimizatonAttempts, 115 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 155 NumberOfCodeBlocks, 155 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 94 ConstructedInterpolants, 0 QuantifiedInterpolants, 7469 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 988). Cancelled while BasicCegarLoop was analyzing trace of length 107 with TraceHistMax 3, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 3 procedures, 123 locations, 3 error locations. TIMEOUT Result, 62.7s OverallTime, 14 OverallIterations, 3 TraceHistogramMax, 50.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1747 SDtfs, 4583 SDslu, 12247 SDs, 0 SdLazy, 7256 SolverSat, 341 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 10.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 739 GetRequests, 433 SyntacticMatches, 18 SemanticMatches, 288 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 2513 ImplicationChecksByTransitivity, 47.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=481occurred in iteration=13, 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.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 892 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 1289 NumberOfCodeBlocks, 1289 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1270 ConstructedInterpolants, 134 QuantifiedInterpolants, 2124085 SizeOfPredicates, 59 NumberOfNonLiveVariables, 1209 ConjunctsInSsa, 159 ConjunctsInUnsatCore, 19 InterpolantComputations, 7 PerfectInterpolantSequences, 69/155 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-20_22-30-20-596.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-20_22-30-20-596.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-20_22-30-20-596.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-20_22-30-20-596.csv Completed graceful shutdown