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_false-unreach-call_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-20 22:32:22,687 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 22:32:22,688 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 22:32:22,703 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 22:32:22,704 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 22:32:22,705 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 22:32:22,706 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 22:32:22,707 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 22:32:22,709 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 22:32:22,710 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 22:32:22,711 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 22:32:22,711 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 22:32:22,712 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 22:32:22,713 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 22:32:22,714 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 22:32:22,717 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 22:32:22,719 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 22:32:22,721 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 22:32:22,722 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 22:32:22,724 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 22:32:22,726 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 22:32:22,726 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 22:32:22,726 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 22:32:22,727 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 22:32:22,728 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 22:32:22,730 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 22:32:22,730 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 22:32:22,731 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 22:32:22,731 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 22:32:22,731 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 22:32:22,732 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 22:32:22,732 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:32:22,741 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 22:32:22,741 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 22:32:22,742 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 22:32:22,742 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 22:32:22,742 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 22:32:22,742 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 22:32:22,742 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 22:32:22,743 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 22:32:22,743 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 22:32:22,743 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 22:32:22,743 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 22:32:22,744 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 22:32:22,744 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 22:32:22,744 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 22:32:22,744 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 22:32:22,744 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 22:32:22,744 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 22:32:22,744 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 22:32:22,745 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 22:32:22,745 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 22:32:22,745 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 22:32:22,745 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 22:32:22,745 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 22:32:22,745 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 22:32:22,746 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 22:32:22,746 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 22:32:22,746 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 22:32:22,746 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 22:32:22,746 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 22:32:22,746 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 22:32:22,747 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 22:32:22,747 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-20 22:32:22,747 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 22:32:22,747 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 22:32:22,747 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 22:32:22,748 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 22:32:22,748 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 22:32:22,780 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 22:32:22,790 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 22:32:22,793 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 22:32:22,794 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 22:32:22,794 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 22:32:22,795 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-01_false-unreach-call_false-valid-deref.i [2018-01-20 22:32:22,978 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 22:32:22,982 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 22:32:22,983 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 22:32:22,983 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 22:32:22,988 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 22:32:22,989 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 10:32:22" (1/1) ... [2018-01-20 22:32:22,992 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:32:22, skipping insertion in model container [2018-01-20 22:32:22,992 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 10:32:22" (1/1) ... [2018-01-20 22:32:23,005 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 22:32:23,045 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 22:32:23,179 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 22:32:23,208 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 22:32:23,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:32:23 WrapperNode [2018-01-20 22:32:23,219 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 22:32:23,220 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 22:32:23,220 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 22:32:23,221 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 22:32:23,231 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:32:23" (1/1) ... [2018-01-20 22:32:23,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:32:23" (1/1) ... [2018-01-20 22:32:23,242 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:32:23" (1/1) ... [2018-01-20 22:32:23,242 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:32:23" (1/1) ... [2018-01-20 22:32:23,251 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:32:23" (1/1) ... [2018-01-20 22:32:23,258 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:32:23" (1/1) ... [2018-01-20 22:32:23,261 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:32:23" (1/1) ... [2018-01-20 22:32:23,264 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 22:32:23,265 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 22:32:23,265 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 22:32:23,265 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 22:32:23,266 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:32:23" (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:32:23,313 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 22:32:23,313 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 22:32:23,314 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 22:32:23,314 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-20 22:32:23,314 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-20 22:32:23,314 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 22:32:23,314 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 22:32:23,314 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 22:32:23,315 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-20 22:32:23,315 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-20 22:32:23,315 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-20 22:32:23,315 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-20 22:32:23,315 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 22:32:23,315 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 22:32:23,316 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 22:32:23,739 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 22:32:23,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:32:23 BoogieIcfgContainer [2018-01-20 22:32:23,740 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 22:32:23,741 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 22:32:23,741 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 22:32:23,743 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 22:32:23,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 10:32:22" (1/3) ... [2018-01-20 22:32:23,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b62b6df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:32:23, skipping insertion in model container [2018-01-20 22:32:23,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 10:32:23" (2/3) ... [2018-01-20 22:32:23,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b62b6df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:32:23, skipping insertion in model container [2018-01-20 22:32:23,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:32:23" (3/3) ... [2018-01-20 22:32:23,748 INFO L105 eAbstractionObserver]: Analyzing ICFG sll-01_false-unreach-call_false-valid-deref.i [2018-01-20 22:32:23,757 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 22:32:23,765 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-20 22:32:23,816 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:32:23,816 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:32:23,816 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:32:23,816 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:32:23,816 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:32:23,817 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:32:23,817 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:32:23,817 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 22:32:23,818 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:32:23,843 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2018-01-20 22:32:23,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-20 22:32:23,849 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:32:23,850 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-20 22:32:23,850 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 22:32:23,856 INFO L82 PathProgramCache]: Analyzing trace with hash 400739, now seen corresponding path program 1 times [2018-01-20 22:32:23,858 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:32:23,859 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:32:23,920 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:23,920 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:32:23,920 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:23,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:32:23,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:32:23,988 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 22:32:23,996 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:32:24,005 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:32:24,005 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:32:24,005 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:32:24,005 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:32:24,005 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:32:24,006 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:32:24,006 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:32:24,006 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 22:32:24,006 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:32:24,010 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2018-01-20 22:32:24,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-20 22:32:24,012 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:32:24,013 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:32:24,013 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:32:24,013 INFO L82 PathProgramCache]: Analyzing trace with hash -63616992, now seen corresponding path program 1 times [2018-01-20 22:32:24,013 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:32:24,014 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:32:24,015 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:24,015 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:32:24,015 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:24,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:32:24,038 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:32:24,078 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:32:24,080 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:32:24,081 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:32:24,082 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:32:24,181 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:32:24,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:32:24,185 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 2 states. [2018-01-20 22:32:24,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:32:24,220 INFO L93 Difference]: Finished difference Result 243 states and 349 transitions. [2018-01-20 22:32:24,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:32:24,222 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2018-01-20 22:32:24,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:32:24,230 INFO L225 Difference]: With dead ends: 243 [2018-01-20 22:32:24,230 INFO L226 Difference]: Without dead ends: 123 [2018-01-20 22:32:24,234 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:32:24,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-20 22:32:24,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-01-20 22:32:24,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-20 22:32:24,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 133 transitions. [2018-01-20 22:32:24,277 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 133 transitions. Word has length 23 [2018-01-20 22:32:24,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:32:24,277 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 133 transitions. [2018-01-20 22:32:24,277 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:32:24,277 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2018-01-20 22:32:24,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-20 22:32:24,278 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:32:24,278 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:32:24,278 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:32:24,279 INFO L82 PathProgramCache]: Analyzing trace with hash -980023246, now seen corresponding path program 1 times [2018-01-20 22:32:24,279 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:32:24,279 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:32:24,280 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:24,280 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:32:24,280 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:32:24,307 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:32:24,435 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:32:24,435 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:32:24,435 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 22:32:24,437 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:32:24,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:32:24,437 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:32:24,438 INFO L87 Difference]: Start difference. First operand 123 states and 133 transitions. Second operand 5 states. [2018-01-20 22:32:24,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:32:24,682 INFO L93 Difference]: Finished difference Result 289 states and 315 transitions. [2018-01-20 22:32:24,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-20 22:32:24,682 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-01-20 22:32:24,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:32:24,686 INFO L225 Difference]: With dead ends: 289 [2018-01-20 22:32:24,686 INFO L226 Difference]: Without dead ends: 194 [2018-01-20 22:32:24,688 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:32:24,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-01-20 22:32:24,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 127. [2018-01-20 22:32:24,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-01-20 22:32:24,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2018-01-20 22:32:24,696 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 36 [2018-01-20 22:32:24,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:32:24,697 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2018-01-20 22:32:24,697 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:32:24,697 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2018-01-20 22:32:24,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-20 22:32:24,698 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:32:24,698 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:32:24,698 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:32:24,698 INFO L82 PathProgramCache]: Analyzing trace with hash -465624459, now seen corresponding path program 1 times [2018-01-20 22:32:24,698 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:32:24,698 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:32:24,699 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:24,699 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:32:24,699 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:32:24,717 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:32:24,780 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:32:24,780 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:32:24,780 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 22:32:24,781 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:32:24,781 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:32:24,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:32:24,782 INFO L87 Difference]: Start difference. First operand 127 states and 137 transitions. Second operand 5 states. [2018-01-20 22:32:24,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:32:24,891 INFO L93 Difference]: Finished difference Result 212 states and 230 transitions. [2018-01-20 22:32:24,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 22:32:24,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-01-20 22:32:24,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:32:24,894 INFO L225 Difference]: With dead ends: 212 [2018-01-20 22:32:24,894 INFO L226 Difference]: Without dead ends: 185 [2018-01-20 22:32:24,895 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:32:24,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-01-20 22:32:24,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 131. [2018-01-20 22:32:24,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-01-20 22:32:24,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 141 transitions. [2018-01-20 22:32:24,906 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 141 transitions. Word has length 38 [2018-01-20 22:32:24,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:32:24,907 INFO L432 AbstractCegarLoop]: Abstraction has 131 states and 141 transitions. [2018-01-20 22:32:24,907 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:32:24,907 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 141 transitions. [2018-01-20 22:32:24,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-20 22:32:24,909 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:32:24,909 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:32:24,910 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 22:32:24,910 INFO L82 PathProgramCache]: Analyzing trace with hash 700231337, now seen corresponding path program 1 times [2018-01-20 22:32:24,910 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:32:24,910 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:32:24,911 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:24,911 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:32:24,911 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:24,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:32:24,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 22:32:24,971 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 22:32:24,982 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:32:24,992 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:32:24,993 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 22:32:25,010 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 22:32:25,010 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 22:32:25,010 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 22:32:25,010 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 22:32:25,011 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 22:32:25,011 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 22:32:25,011 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 22:32:25,011 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-20 22:32:25,011 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 22:32:25,013 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2018-01-20 22:32:25,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-20 22:32:25,014 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:32:25,014 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:32:25,014 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-20 22:32:25,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1135260480, now seen corresponding path program 1 times [2018-01-20 22:32:25,015 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:32:25,015 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:32:25,016 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:25,016 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:32:25,016 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:25,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:32:25,022 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:32:25,030 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:32:25,031 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:32:25,031 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 22:32:25,031 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 22:32:25,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 22:32:25,032 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 22:32:25,032 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 2 states. [2018-01-20 22:32:25,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:32:25,038 INFO L93 Difference]: Finished difference Result 243 states and 349 transitions. [2018-01-20 22:32:25,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 22:32:25,039 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-01-20 22:32:25,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:32:25,040 INFO L225 Difference]: With dead ends: 243 [2018-01-20 22:32:25,040 INFO L226 Difference]: Without dead ends: 121 [2018-01-20 22:32:25,041 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:32:25,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-20 22:32:25,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-01-20 22:32:25,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-01-20 22:32:25,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2018-01-20 22:32:25,049 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 21 [2018-01-20 22:32:25,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:32:25,050 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2018-01-20 22:32:25,050 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 22:32:25,050 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2018-01-20 22:32:25,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-20 22:32:25,051 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:32:25,051 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:32:25,051 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-20 22:32:25,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1152051538, now seen corresponding path program 1 times [2018-01-20 22:32:25,052 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:32:25,052 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:32:25,053 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:25,053 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:32:25,053 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:25,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:32:25,063 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:32:25,150 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:32:25,151 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:32:25,151 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 22:32:25,151 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:32:25,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:32:25,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:32:25,152 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand 5 states. [2018-01-20 22:32:25,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:32:25,287 INFO L93 Difference]: Finished difference Result 285 states and 310 transitions. [2018-01-20 22:32:25,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-20 22:32:25,288 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-01-20 22:32:25,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:32:25,290 INFO L225 Difference]: With dead ends: 285 [2018-01-20 22:32:25,290 INFO L226 Difference]: Without dead ends: 192 [2018-01-20 22:32:25,291 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:32:25,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-01-20 22:32:25,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 125. [2018-01-20 22:32:25,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-20 22:32:25,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2018-01-20 22:32:25,300 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 34 [2018-01-20 22:32:25,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:32:25,301 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2018-01-20 22:32:25,301 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:32:25,301 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2018-01-20 22:32:25,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-20 22:32:25,302 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:32:25,303 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:32:25,303 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-20 22:32:25,303 INFO L82 PathProgramCache]: Analyzing trace with hash -934561707, now seen corresponding path program 1 times [2018-01-20 22:32:25,303 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:32:25,303 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:32:25,304 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:25,304 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:32:25,305 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:25,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:32:25,316 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:32:25,379 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:32:25,379 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:32:25,379 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 22:32:25,380 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:32:25,380 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:32:25,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:32:25,380 INFO L87 Difference]: Start difference. First operand 125 states and 135 transitions. Second operand 5 states. [2018-01-20 22:32:25,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:32:25,478 INFO L93 Difference]: Finished difference Result 208 states and 226 transitions. [2018-01-20 22:32:25,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-20 22:32:25,478 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-01-20 22:32:25,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:32:25,480 INFO L225 Difference]: With dead ends: 208 [2018-01-20 22:32:25,480 INFO L226 Difference]: Without dead ends: 183 [2018-01-20 22:32:25,481 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:32:25,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-01-20 22:32:25,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 129. [2018-01-20 22:32:25,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-20 22:32:25,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 139 transitions. [2018-01-20 22:32:25,487 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 139 transitions. Word has length 36 [2018-01-20 22:32:25,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:32:25,488 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 139 transitions. [2018-01-20 22:32:25,488 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:32:25,488 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 139 transitions. [2018-01-20 22:32:25,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-20 22:32:25,489 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:32:25,489 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:32:25,489 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-20 22:32:25,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1469660791, now seen corresponding path program 1 times [2018-01-20 22:32:25,490 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:32:25,490 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:32:25,490 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:25,491 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:32:25,491 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:25,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:32:25,510 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:32:25,647 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:32:25,647 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:32:25,647 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:32:25,655 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:32:25,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:32:25,700 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:32:25,788 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:32:25,818 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:32:25,853 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:32:25,854 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 8 [2018-01-20 22:32:25,854 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-20 22:32:25,854 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-20 22:32:25,854 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=43, Unknown=1, NotChecked=12, Total=72 [2018-01-20 22:32:25,855 INFO L87 Difference]: Start difference. First operand 129 states and 139 transitions. Second operand 9 states. [2018-01-20 22:32:26,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:32:26,119 INFO L93 Difference]: Finished difference Result 216 states and 233 transitions. [2018-01-20 22:32:26,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-20 22:32:26,119 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2018-01-20 22:32:26,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:32:26,121 INFO L225 Difference]: With dead ends: 216 [2018-01-20 22:32:26,121 INFO L226 Difference]: Without dead ends: 213 [2018-01-20 22:32:26,122 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:32:26,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-01-20 22:32:26,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 180. [2018-01-20 22:32:26,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-01-20 22:32:26,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 196 transitions. [2018-01-20 22:32:26,133 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 196 transitions. Word has length 56 [2018-01-20 22:32:26,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:32:26,133 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 196 transitions. [2018-01-20 22:32:26,133 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-20 22:32:26,133 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 196 transitions. [2018-01-20 22:32:26,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-20 22:32:26,134 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:32:26,135 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:32:26,135 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation]=== [2018-01-20 22:32:26,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1423084331, now seen corresponding path program 1 times [2018-01-20 22:32:26,135 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:32:26,135 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:32:26,136 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:26,136 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:32:26,136 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:32:26,151 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:32:26,261 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:32:26,262 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:32:26,262 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-20 22:32:26,262 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-20 22:32:26,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-20 22:32:26,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-20 22:32:26,263 INFO L87 Difference]: Start difference. First operand 180 states and 196 transitions. Second operand 7 states. [2018-01-20 22:32:26,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:32:26,585 INFO L93 Difference]: Finished difference Result 277 states and 301 transitions. [2018-01-20 22:32:26,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-20 22:32:26,585 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2018-01-20 22:32:26,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:32:26,586 INFO L225 Difference]: With dead ends: 277 [2018-01-20 22:32:26,586 INFO L226 Difference]: Without dead ends: 252 [2018-01-20 22:32:26,587 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:32:26,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-01-20 22:32:26,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 225. [2018-01-20 22:32:26,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-01-20 22:32:26,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 246 transitions. [2018-01-20 22:32:26,597 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 246 transitions. Word has length 61 [2018-01-20 22:32:26,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:32:26,598 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 246 transitions. [2018-01-20 22:32:26,598 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-20 22:32:26,598 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 246 transitions. [2018-01-20 22:32:26,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-01-20 22:32:26,599 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:32:26,599 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:32:26,599 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation]=== [2018-01-20 22:32:26,600 INFO L82 PathProgramCache]: Analyzing trace with hash -299432594, now seen corresponding path program 1 times [2018-01-20 22:32:26,600 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:32:26,600 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:32:26,601 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:26,601 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:32:26,601 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:26,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:32:26,618 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:32:26,840 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:32:26,841 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:32:26,841 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-20 22:32:26,841 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-20 22:32:26,842 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-20 22:32:26,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-01-20 22:32:26,842 INFO L87 Difference]: Start difference. First operand 225 states and 246 transitions. Second operand 11 states. [2018-01-20 22:32:27,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:32:27,421 INFO L93 Difference]: Finished difference Result 450 states and 488 transitions. [2018-01-20 22:32:27,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-20 22:32:27,422 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2018-01-20 22:32:27,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:32:27,423 INFO L225 Difference]: With dead ends: 450 [2018-01-20 22:32:27,424 INFO L226 Difference]: Without dead ends: 351 [2018-01-20 22:32:27,425 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-01-20 22:32:27,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-01-20 22:32:27,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 220. [2018-01-20 22:32:27,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-01-20 22:32:27,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 240 transitions. [2018-01-20 22:32:27,437 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 240 transitions. Word has length 63 [2018-01-20 22:32:27,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:32:27,437 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 240 transitions. [2018-01-20 22:32:27,437 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-20 22:32:27,438 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 240 transitions. [2018-01-20 22:32:27,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-20 22:32:27,438 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:32:27,438 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:32:27,438 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation]=== [2018-01-20 22:32:27,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1131620500, now seen corresponding path program 2 times [2018-01-20 22:32:27,439 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:32:27,439 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:32:27,439 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:27,439 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:32:27,440 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:27,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:32:27,451 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:32:27,580 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:32:27,580 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:32:27,580 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:32:27,586 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 22:32:27,597 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:32:27,606 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:32:27,609 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:32:27,614 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:32:27,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-20 22:32:27,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-20 22:32:27,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:27,699 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:27,700 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:32:27,700 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-01-20 22:32:27,734 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:32:27,755 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:32:27,755 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-01-20 22:32:27,755 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-20 22:32:27,756 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-20 22:32:27,756 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-01-20 22:32:27,756 INFO L87 Difference]: Start difference. First operand 220 states and 240 transitions. Second operand 17 states. [2018-01-20 22:32:28,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:32:28,156 INFO L93 Difference]: Finished difference Result 403 states and 442 transitions. [2018-01-20 22:32:28,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-20 22:32:28,156 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 65 [2018-01-20 22:32:28,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:32:28,157 INFO L225 Difference]: With dead ends: 403 [2018-01-20 22:32:28,158 INFO L226 Difference]: Without dead ends: 300 [2018-01-20 22:32:28,158 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2018-01-20 22:32:28,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-01-20 22:32:28,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 223. [2018-01-20 22:32:28,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-01-20 22:32:28,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 241 transitions. [2018-01-20 22:32:28,168 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 241 transitions. Word has length 65 [2018-01-20 22:32:28,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:32:28,168 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 241 transitions. [2018-01-20 22:32:28,168 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-20 22:32:28,169 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 241 transitions. [2018-01-20 22:32:28,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-20 22:32:28,169 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:32:28,169 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:32:28,170 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation]=== [2018-01-20 22:32:28,170 INFO L82 PathProgramCache]: Analyzing trace with hash 2083551600, now seen corresponding path program 1 times [2018-01-20 22:32:28,170 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:32:28,170 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:32:28,170 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:28,171 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:32:28,171 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:32:28,179 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:32:28,287 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:32:28,288 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:32:28,288 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-20 22:32:28,288 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-20 22:32:28,288 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-20 22:32:28,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-20 22:32:28,289 INFO L87 Difference]: Start difference. First operand 223 states and 241 transitions. Second operand 7 states. [2018-01-20 22:32:28,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:32:28,467 INFO L93 Difference]: Finished difference Result 294 states and 315 transitions. [2018-01-20 22:32:28,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-20 22:32:28,467 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2018-01-20 22:32:28,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:32:28,469 INFO L225 Difference]: With dead ends: 294 [2018-01-20 22:32:28,469 INFO L226 Difference]: Without dead ends: 233 [2018-01-20 22:32:28,469 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-01-20 22:32:28,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-01-20 22:32:28,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 229. [2018-01-20 22:32:28,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-01-20 22:32:28,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 247 transitions. [2018-01-20 22:32:28,485 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 247 transitions. Word has length 69 [2018-01-20 22:32:28,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:32:28,486 INFO L432 AbstractCegarLoop]: Abstraction has 229 states and 247 transitions. [2018-01-20 22:32:28,486 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-20 22:32:28,486 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 247 transitions. [2018-01-20 22:32:28,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-01-20 22:32:28,486 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:32:28,487 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:32:28,487 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation]=== [2018-01-20 22:32:28,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1488132338, now seen corresponding path program 1 times [2018-01-20 22:32:28,487 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:32:28,487 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:32:28,488 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:28,488 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:32:28,488 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:28,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:32:28,503 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:32:29,131 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:32:29,131 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:32:29,131 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:32:29,139 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:32:29,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:32:29,172 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:32:29,242 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:32:29,244 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:32:29,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:29,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:29,246 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:32:29,247 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:3 [2018-01-20 22:32:29,289 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:32:29,309 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:32:29,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2018-01-20 22:32:29,310 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-20 22:32:29,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-20 22:32:29,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2018-01-20 22:32:29,311 INFO L87 Difference]: Start difference. First operand 229 states and 247 transitions. Second operand 20 states. [2018-01-20 22:32:30,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:32:30,929 INFO L93 Difference]: Finished difference Result 493 states and 531 transitions. [2018-01-20 22:32:30,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-01-20 22:32:30,929 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 74 [2018-01-20 22:32:30,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:32:30,931 INFO L225 Difference]: With dead ends: 493 [2018-01-20 22:32:30,931 INFO L226 Difference]: Without dead ends: 337 [2018-01-20 22:32:30,932 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:32:30,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-01-20 22:32:30,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 289. [2018-01-20 22:32:30,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-01-20 22:32:30,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 315 transitions. [2018-01-20 22:32:30,943 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 315 transitions. Word has length 74 [2018-01-20 22:32:30,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:32:30,943 INFO L432 AbstractCegarLoop]: Abstraction has 289 states and 315 transitions. [2018-01-20 22:32:30,943 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-20 22:32:30,943 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 315 transitions. [2018-01-20 22:32:30,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-20 22:32:30,944 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:32:30,944 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:32:30,944 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation]=== [2018-01-20 22:32:30,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1328388303, now seen corresponding path program 1 times [2018-01-20 22:32:30,944 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:32:30,944 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:32:30,945 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:30,945 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:32:30,945 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:32:30,955 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:32:31,027 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:32:31,028 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 22:32:31,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 22:32:31,028 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 22:32:31,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 22:32:31,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-20 22:32:31,029 INFO L87 Difference]: Start difference. First operand 289 states and 315 transitions. Second operand 5 states. [2018-01-20 22:32:31,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:32:31,317 INFO L93 Difference]: Finished difference Result 530 states and 581 transitions. [2018-01-20 22:32:31,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-20 22:32:31,318 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2018-01-20 22:32:31,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:32:31,319 INFO L225 Difference]: With dead ends: 530 [2018-01-20 22:32:31,319 INFO L226 Difference]: Without dead ends: 305 [2018-01-20 22:32:31,320 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:32:31,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-01-20 22:32:31,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 293. [2018-01-20 22:32:31,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-01-20 22:32:31,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 318 transitions. [2018-01-20 22:32:31,330 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 318 transitions. Word has length 79 [2018-01-20 22:32:31,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:32:31,330 INFO L432 AbstractCegarLoop]: Abstraction has 293 states and 318 transitions. [2018-01-20 22:32:31,330 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 22:32:31,330 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 318 transitions. [2018-01-20 22:32:31,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-20 22:32:31,331 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:32:31,331 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:32:31,331 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation]=== [2018-01-20 22:32:31,331 INFO L82 PathProgramCache]: Analyzing trace with hash 764698094, now seen corresponding path program 1 times [2018-01-20 22:32:31,331 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:32:31,332 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:32:31,332 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:31,332 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:32:31,332 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:31,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:32:31,344 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:32:31,494 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:32:31,494 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:32:31,495 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:32:31,499 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:32:31,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:32:31,524 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:32:31,531 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:32:31,531 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:31,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:31,533 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-20 22:32:31,545 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:31,546 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:31,548 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:32:31,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:31,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:31,554 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2018-01-20 22:32:31,565 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:32:31,568 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:32:31,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:31,570 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:31,585 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:32:31,585 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-01-20 22:32:31,662 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:31,665 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:32:31,666 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:32:31,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:31,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:31,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:31,676 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-01-20 22:32:31,696 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:32:31,699 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:31,700 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:32:31,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:31,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:31,715 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:32:31,715 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-01-20 22:32:31,794 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:32:31,802 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:32:31,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:31,828 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:31,828 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:32:31,829 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:31,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:31,835 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:32:31,836 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:48, output treesize:4 [2018-01-20 22:32:31,906 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:32:31,927 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:32:31,927 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 21 [2018-01-20 22:32:31,927 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-20 22:32:31,927 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-20 22:32:31,927 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2018-01-20 22:32:31,928 INFO L87 Difference]: Start difference. First operand 293 states and 318 transitions. Second operand 21 states. [2018-01-20 22:32:32,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:32:32,832 INFO L93 Difference]: Finished difference Result 603 states and 656 transitions. [2018-01-20 22:32:32,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-20 22:32:32,833 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 81 [2018-01-20 22:32:32,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:32:32,835 INFO L225 Difference]: With dead ends: 603 [2018-01-20 22:32:32,835 INFO L226 Difference]: Without dead ends: 571 [2018-01-20 22:32:32,836 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 70 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=246, Invalid=1236, Unknown=0, NotChecked=0, Total=1482 [2018-01-20 22:32:32,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2018-01-20 22:32:32,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 444. [2018-01-20 22:32:32,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-01-20 22:32:32,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 484 transitions. [2018-01-20 22:32:32,862 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 484 transitions. Word has length 81 [2018-01-20 22:32:32,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:32:32,863 INFO L432 AbstractCegarLoop]: Abstraction has 444 states and 484 transitions. [2018-01-20 22:32:32,863 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-20 22:32:32,863 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 484 transitions. [2018-01-20 22:32:32,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-01-20 22:32:32,864 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:32:32,864 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:32:32,865 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr0EnsuresViolation]=== [2018-01-20 22:32:32,865 INFO L82 PathProgramCache]: Analyzing trace with hash -917967199, now seen corresponding path program 1 times [2018-01-20 22:32:32,865 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:32:32,865 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:32:32,866 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:32,866 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:32:32,866 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:32:32,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:32:32,885 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:32:33,372 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:32:33,372 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:32:33,372 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:32:33,377 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:32:33,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:32:33,402 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:32:33,404 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:32:33,405 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:33,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:33,406 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-20 22:32:33,426 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:33,426 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:33,427 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:32:33,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:33,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:33,436 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:25 [2018-01-20 22:32:33,443 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:32:33,446 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:32:33,447 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:33,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:33,455 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:32:33,455 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-01-20 22:32:33,517 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:33,521 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:32:33,523 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:32:33,523 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:33,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:33,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:33,538 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2018-01-20 22:32:33,568 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:33,569 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:33,569 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:33,570 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:32:33,570 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:33,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:33,577 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:43 [2018-01-20 22:32:33,601 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:33,604 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:32:33,607 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:33,609 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:32:33,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:33,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:33,625 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:32:33,625 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:55 [2018-01-20 22:32:33,686 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:33,691 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:32:33,693 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:32:33,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:33,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:33,711 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:32:33,711 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:64 [2018-01-20 22:32:33,787 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:32:33,793 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:32:33,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:33,802 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:33,811 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:32:33,811 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:110, output treesize:96 [2018-01-20 22:32:37,925 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:32:37,930 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:32:37,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:37,938 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:32:37,938 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:37,945 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:32:37,946 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:32:37,946 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:32:37,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:32:37,951 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:32:37,951 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:103, output treesize:4 [2018-01-20 22:32:38,050 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:32:38,070 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:32:38,071 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 30 [2018-01-20 22:32:38,071 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-20 22:32:38,071 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-20 22:32:38,071 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=758, Unknown=2, NotChecked=0, Total=870 [2018-01-20 22:32:38,071 INFO L87 Difference]: Start difference. First operand 444 states and 484 transitions. Second operand 30 states. [2018-01-20 22:32:54,772 WARN L143 SmtUtils]: Spent 2029ms on a formula simplification that was a NOOP. DAG size: 64 [2018-01-20 22:33:02,821 WARN L143 SmtUtils]: Spent 2025ms on a formula simplification that was a NOOP. DAG size: 60 [2018-01-20 22:33:22,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:33:22,083 INFO L93 Difference]: Finished difference Result 785 states and 857 transitions. [2018-01-20 22:33:22,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-01-20 22:33:22,084 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 86 [2018-01-20 22:33:22,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:33:22,087 INFO L225 Difference]: With dead ends: 785 [2018-01-20 22:33:22,088 INFO L226 Difference]: Without dead ends: 753 [2018-01-20 22:33:22,089 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:33:22,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2018-01-20 22:33:22,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 456. [2018-01-20 22:33:22,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2018-01-20 22:33:22,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 497 transitions. [2018-01-20 22:33:22,112 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 497 transitions. Word has length 86 [2018-01-20 22:33:22,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:33:22,113 INFO L432 AbstractCegarLoop]: Abstraction has 456 states and 497 transitions. [2018-01-20 22:33:22,113 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-20 22:33:22,113 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 497 transitions. [2018-01-20 22:33:22,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-01-20 22:33:22,114 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:33:22,115 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:33:22,115 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr0EnsuresViolation]=== [2018-01-20 22:33:22,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1519296570, now seen corresponding path program 2 times [2018-01-20 22:33:22,115 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:33:22,115 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:33:22,116 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:33:22,116 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 22:33:22,116 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:33:22,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:33:22,136 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 22:33:22,832 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:33:22,832 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-20 22:33:22,832 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:33:22,840 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-20 22:33:22,852 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:33:22,865 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-20 22:33:22,868 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-20 22:33:22,873 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-20 22:33:22,983 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:33:22,985 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:33:22,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:33:22,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:33:22,996 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:33:22,998 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:33:22,998 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:33:23,006 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:33:23,028 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:33:23,029 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:89, output treesize:83 [2018-01-20 22:33:23,149 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:33:23,153 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:33:23,156 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:33:23,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:33:23,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:33:23,187 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:33:23,190 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:33:23,193 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:33:23,193 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:33:23,204 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:33:23,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-20 22:33:23,227 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:107, output treesize:99 [2018-01-20 22:33:23,276 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:33:23,280 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:33:23,282 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:33:23,283 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:33:23,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:33:23,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:33:23,316 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:33:23,319 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:33:23,321 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:33:23,322 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:33:23,322 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-20 22:33:23,331 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:33:23,350 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:33:23,350 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:135, output treesize:119 [2018-01-20 22:33:23,510 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:33:23,515 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:33:23,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-01-20 22:33:23,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-20 22:33:23,604 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:33:23,605 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:33:23,605 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-20 22:33:23,615 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:33:23,661 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:33:23,673 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:33:23,677 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:33:23,677 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-20 22:33:23,693 INFO L700 Elim1Store]: detected not equals via solver [2018-01-20 22:33:23,694 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:33:23,695 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-20 22:33:23,704 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-20 22:33:23,733 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:33:23,734 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:133, output treesize:55 [2018-01-20 22:33:24,016 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:33:24,022 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:33:24,601 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:33:24,609 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:33:24,684 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:33:24,705 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-20 22:33:24,705 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 34 [2018-01-20 22:33:24,706 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-20 22:33:24,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-20 22:33:24,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=822, Unknown=21, NotChecked=244, Total=1190 [2018-01-20 22:33:24,706 INFO L87 Difference]: Start difference. First operand 456 states and 497 transitions. Second operand 35 states. [2018-01-20 22:33:26,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 22:33:26,607 INFO L93 Difference]: Finished difference Result 546 states and 593 transitions. [2018-01-20 22:33:26,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-20 22:33:26,608 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 101 [2018-01-20 22:33:26,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 22:33:26,609 INFO L225 Difference]: With dead ends: 546 [2018-01-20 22:33:26,610 INFO L226 Difference]: Without dead ends: 543 [2018-01-20 22:33:26,611 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 86 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=257, Invalid=2089, Unknown=22, NotChecked=388, Total=2756 [2018-01-20 22:33:26,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-01-20 22:33:26,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 505. [2018-01-20 22:33:26,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2018-01-20 22:33:26,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 551 transitions. [2018-01-20 22:33:26,635 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 551 transitions. Word has length 101 [2018-01-20 22:33:26,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 22:33:26,636 INFO L432 AbstractCegarLoop]: Abstraction has 505 states and 551 transitions. [2018-01-20 22:33:26,636 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-01-20 22:33:26,636 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 551 transitions. [2018-01-20 22:33:26,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-01-20 22:33:26,638 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 22:33:26,638 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:33:26,638 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr0EnsuresViolation]=== [2018-01-20 22:33:26,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1680009768, now seen corresponding path program 1 times [2018-01-20 22:33:26,639 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-20 22:33:26,639 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-20 22:33:26,639 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:33:26,640 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-20 22:33:26,640 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 22:33:26,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 22:33:26,661 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-01-20 22:33:27,355 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-20 22:33:27,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 10:33:27 BoogieIcfgContainer [2018-01-20 22:33:27,357 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-20 22:33:27,358 INFO L168 Benchmark]: Toolchain (without parser) took 64379.71 ms. Allocated memory was 302.5 MB in the beginning and 655.9 MB in the end (delta: 353.4 MB). Free memory was 262.4 MB in the beginning and 497.4 MB in the end (delta: -235.0 MB). Peak memory consumption was 118.4 MB. Max. memory is 5.3 GB. [2018-01-20 22:33:27,359 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 302.5 MB. Free memory is still 268.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 22:33:27,359 INFO L168 Benchmark]: CACSL2BoogieTranslator took 237.23 ms. Allocated memory is still 302.5 MB. Free memory was 261.4 MB in the beginning and 249.3 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:33:27,359 INFO L168 Benchmark]: Boogie Preprocessor took 44.10 ms. Allocated memory is still 302.5 MB. Free memory was 249.3 MB in the beginning and 247.3 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:33:27,359 INFO L168 Benchmark]: RCFGBuilder took 475.12 ms. Allocated memory is still 302.5 MB. Free memory was 246.3 MB in the beginning and 213.3 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:33:27,360 INFO L168 Benchmark]: TraceAbstraction took 63616.26 ms. Allocated memory was 302.5 MB in the beginning and 655.9 MB in the end (delta: 353.4 MB). Free memory was 213.3 MB in the beginning and 497.4 MB in the end (delta: -284.1 MB). Peak memory consumption was 69.2 MB. Max. memory is 5.3 GB. [2018-01-20 22:33:27,361 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 302.5 MB. Free memory is still 268.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 237.23 ms. Allocated memory is still 302.5 MB. Free memory was 261.4 MB in the beginning and 249.3 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 44.10 ms. Allocated memory is still 302.5 MB. Free memory was 249.3 MB in the beginning and 247.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 475.12 ms. Allocated memory is still 302.5 MB. Free memory was 246.3 MB in the beginning and 213.3 MB in the end (delta: 33.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 63616.26 ms. Allocated memory was 302.5 MB in the beginning and 655.9 MB in the end (delta: 353.4 MB). Free memory was 213.3 MB in the beginning and 497.4 MB in the end (delta: -284.1 MB). Peak memory consumption was 69.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, 126 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=126occurred 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}] [L1031] COND FALSE !(!(len <= 1)) VAL [end={10:0}, inner={0:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1031] COND FALSE !(0) VAL [end={10:0}, inner={0:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1033] 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}] [L1033] 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}] [L1037] COND TRUE ((void*)0) != list VAL [end={0:0}, inner={0:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1039] 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}] [L1039] end = list->inner [L1041] COND FALSE !(((void*)0) != end) VAL [end={0:0}, inner={0:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1049] 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}] [L1049] end = list->next [L1050] FCALL free(list) VAL [end={0:0}, inner={0:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L1051] list = end VAL [end={0:0}, inner={0:0}, len=0, list={0:0}, malloc(sizeof(SLL))={10:0}] [L1037] COND FALSE !(((void*)0) != list) VAL [end={0:0}, inner={0:0}, len=0, list={0:0}, malloc(sizeof(SLL))={10:0}] [L1054] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 3 procedures, 126 locations, 3 error locations. UNSAFE Result, 1.0s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 361 SDtfs, 441 SDslu, 441 SDs, 0 SdLazy, 165 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=131occurred 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, 121 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 InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 16 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 3 procedures, 126 locations, 3 error locations. TIMEOUT Result, 62.3s OverallTime, 14 OverallIterations, 3 TraceHistogramMax, 50.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1816 SDtfs, 4864 SDslu, 12260 SDs, 0 SdLazy, 7148 SolverSat, 341 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 10.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 732 GetRequests, 432 SyntacticMatches, 19 SemanticMatches, 281 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 2444 ImplicationChecksByTransitivity, 47.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=505occurred 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, 915 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 9.9s InterpolantComputationTime, 1289 NumberOfCodeBlocks, 1289 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1270 ConstructedInterpolants, 134 QuantifiedInterpolants, 2088053 SizeOfPredicates, 60 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_false-unreach-call_false-valid-deref.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-20_22-33-27-369.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_false-unreach-call_false-valid-deref.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-20_22-33-27-369.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_false-unreach-call_false-valid-deref.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-20_22-33-27-369.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_false-unreach-call_false-valid-deref.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-20_22-33-27-369.csv Completed graceful shutdown