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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 17:25:36,706 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 17:25:36,708 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 17:25:36,717 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 17:25:36,718 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 17:25:36,718 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 17:25:36,719 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 17:25:36,721 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 17:25:36,722 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 17:25:36,723 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 17:25:36,723 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 17:25:36,724 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 17:25:36,724 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 17:25:36,725 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 17:25:36,726 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 17:25:36,728 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 17:25:36,729 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 17:25:36,731 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 17:25:36,732 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 17:25:36,733 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 17:25:36,734 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 17:25:36,735 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 17:25:36,735 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 17:25:36,736 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 17:25:36,736 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 17:25:36,737 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 17:25:36,737 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 17:25:36,738 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 17:25:36,738 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 17:25:36,738 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 17:25:36,739 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 17:25:36,739 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-04 17:25:36,748 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 17:25:36,748 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 17:25:36,749 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 17:25:36,749 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 17:25:36,749 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 17:25:36,749 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 17:25:36,750 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 17:25:36,750 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 17:25:36,750 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 17:25:36,750 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 17:25:36,750 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 17:25:36,750 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 17:25:36,750 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 17:25:36,751 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 17:25:36,751 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 17:25:36,751 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 17:25:36,751 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 17:25:36,751 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 17:25:36,751 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 17:25:36,751 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 17:25:36,752 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 17:25:36,752 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 17:25:36,752 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 17:25:36,752 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-02-04 17:25:36,776 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 17:25:36,785 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 17:25:36,787 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 17:25:36,788 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 17:25:36,789 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 17:25:36,789 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i [2018-02-04 17:25:36,918 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 17:25:36,919 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 17:25:36,920 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 17:25:36,920 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 17:25:36,924 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 17:25:36,924 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:25:36" (1/1) ... [2018-02-04 17:25:36,926 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@454f3215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:25:36, skipping insertion in model container [2018-02-04 17:25:36,926 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 05:25:36" (1/1) ... [2018-02-04 17:25:36,936 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:25:36,963 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 17:25:37,050 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:25:37,066 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 17:25:37,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:25:37 WrapperNode [2018-02-04 17:25:37,072 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 17:25:37,073 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 17:25:37,073 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 17:25:37,073 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 17:25:37,085 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:25:37" (1/1) ... [2018-02-04 17:25:37,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:25:37" (1/1) ... [2018-02-04 17:25:37,091 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:25:37" (1/1) ... [2018-02-04 17:25:37,091 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:25:37" (1/1) ... [2018-02-04 17:25:37,095 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:25:37" (1/1) ... [2018-02-04 17:25:37,098 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:25:37" (1/1) ... [2018-02-04 17:25:37,099 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:25:37" (1/1) ... [2018-02-04 17:25:37,101 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 17:25:37,101 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 17:25:37,101 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 17:25:37,102 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 17:25:37,102 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:25:37" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-04 17:25:37,140 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 17:25:37,140 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 17:25:37,140 INFO L136 BoogieDeclarations]: Found implementation of procedure lis [2018-02-04 17:25:37,140 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 17:25:37,140 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 17:25:37,141 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 17:25:37,141 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 17:25:37,141 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 17:25:37,141 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 17:25:37,141 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 17:25:37,141 INFO L128 BoogieDeclarations]: Found specification of procedure lis [2018-02-04 17:25:37,141 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 17:25:37,141 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 17:25:37,141 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 17:25:37,339 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 17:25:37,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:25:37 BoogieIcfgContainer [2018-02-04 17:25:37,339 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 17:25:37,340 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 17:25:37,340 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 17:25:37,343 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 17:25:37,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 05:25:36" (1/3) ... [2018-02-04 17:25:37,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cbec76f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:25:37, skipping insertion in model container [2018-02-04 17:25:37,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 05:25:37" (2/3) ... [2018-02-04 17:25:37,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cbec76f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 05:25:37, skipping insertion in model container [2018-02-04 17:25:37,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 05:25:37" (3/3) ... [2018-02-04 17:25:37,346 INFO L107 eAbstractionObserver]: Analyzing ICFG lis-alloca_true-valid-memsafety_true-termination.i [2018-02-04 17:25:37,353 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 17:25:37,359 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-02-04 17:25:37,390 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 17:25:37,390 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 17:25:37,390 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 17:25:37,390 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 17:25:37,390 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 17:25:37,390 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 17:25:37,390 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 17:25:37,391 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 17:25:37,391 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 17:25:37,401 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2018-02-04 17:25:37,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 17:25:37,409 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:37,410 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:25:37,410 INFO L371 AbstractCegarLoop]: === Iteration 1 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:37,414 INFO L82 PathProgramCache]: Analyzing trace with hash -456745945, now seen corresponding path program 1 times [2018-02-04 17:25:37,416 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:37,416 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:37,448 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:37,448 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:37,448 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:37,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:37,498 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:37,515 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:25:37,516 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:25:37,516 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:25:37,517 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:37,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:37,562 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:25:37,653 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-02-04 17:25:37,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:25:37,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:25:37,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 17:25:37,680 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:25:37,682 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:25:37,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-04 17:25:37,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:25:37,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:25:37,692 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-02-04 17:25:37,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:25:37,709 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:25:37,710 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 17:25:37,711 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 17:25:37,720 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 17:25:37,720 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:25:37,721 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 5 states. [2018-02-04 17:25:37,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:37,837 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2018-02-04 17:25:37,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 17:25:37,838 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-04 17:25:37,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:37,844 INFO L225 Difference]: With dead ends: 77 [2018-02-04 17:25:37,844 INFO L226 Difference]: Without dead ends: 74 [2018-02-04 17:25:37,845 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:25:37,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-04 17:25:37,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-02-04 17:25:37,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-02-04 17:25:37,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-02-04 17:25:37,867 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 18 [2018-02-04 17:25:37,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:37,867 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-02-04 17:25:37,867 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 17:25:37,868 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-02-04 17:25:37,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 17:25:37,868 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:37,868 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:25:37,868 INFO L371 AbstractCegarLoop]: === Iteration 2 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:37,868 INFO L82 PathProgramCache]: Analyzing trace with hash -456745944, now seen corresponding path program 1 times [2018-02-04 17:25:37,868 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:37,868 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:37,869 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:37,869 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:37,869 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:37,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:37,881 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:37,887 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:25:37,887 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:25:37,888 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:25:37,888 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:37,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:37,921 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:25:37,933 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-02-04 17:25:37,933 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:25:37,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:25:37,938 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-02-04 17:25:37,958 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 16 treesize of output 15 [2018-02-04 17:25:37,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:25:37,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:25:37,964 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:21 [2018-02-04 17:25:38,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:25:38,029 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:25:38,029 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 17:25:38,029 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 17:25:38,030 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 17:25:38,030 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-04 17:25:38,030 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 9 states. [2018-02-04 17:25:38,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:38,255 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2018-02-04 17:25:38,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 17:25:38,255 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-02-04 17:25:38,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:38,256 INFO L225 Difference]: With dead ends: 88 [2018-02-04 17:25:38,256 INFO L226 Difference]: Without dead ends: 88 [2018-02-04 17:25:38,257 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-02-04 17:25:38,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-02-04 17:25:38,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 82. [2018-02-04 17:25:38,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-02-04 17:25:38,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2018-02-04 17:25:38,261 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 18 [2018-02-04 17:25:38,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:38,261 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2018-02-04 17:25:38,261 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 17:25:38,261 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2018-02-04 17:25:38,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 17:25:38,262 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:38,262 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:25:38,262 INFO L371 AbstractCegarLoop]: === Iteration 3 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:38,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1274222418, now seen corresponding path program 1 times [2018-02-04 17:25:38,262 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:38,262 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:38,263 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:38,263 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:38,263 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:38,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:38,278 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:38,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:25:38,307 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:25:38,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:25:38,308 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 17:25:38,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 17:25:38,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 17:25:38,308 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand 4 states. [2018-02-04 17:25:38,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:38,341 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2018-02-04 17:25:38,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 17:25:38,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-02-04 17:25:38,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:38,342 INFO L225 Difference]: With dead ends: 80 [2018-02-04 17:25:38,342 INFO L226 Difference]: Without dead ends: 80 [2018-02-04 17:25:38,342 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 17:25:38,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-02-04 17:25:38,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-02-04 17:25:38,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-04 17:25:38,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2018-02-04 17:25:38,346 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 19 [2018-02-04 17:25:38,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:38,346 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2018-02-04 17:25:38,346 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 17:25:38,346 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2018-02-04 17:25:38,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 17:25:38,347 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:38,347 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:25:38,347 INFO L371 AbstractCegarLoop]: === Iteration 4 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:38,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1274222417, now seen corresponding path program 1 times [2018-02-04 17:25:38,347 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:38,347 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:38,348 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:38,348 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:38,348 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:38,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:38,360 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:38,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:25:38,446 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:25:38,446 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 17:25:38,446 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 17:25:38,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 17:25:38,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:25:38,447 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand 8 states. [2018-02-04 17:25:38,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:38,629 INFO L93 Difference]: Finished difference Result 97 states and 108 transitions. [2018-02-04 17:25:38,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 17:25:38,629 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-02-04 17:25:38,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:38,630 INFO L225 Difference]: With dead ends: 97 [2018-02-04 17:25:38,630 INFO L226 Difference]: Without dead ends: 97 [2018-02-04 17:25:38,631 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-02-04 17:25:38,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-02-04 17:25:38,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 78. [2018-02-04 17:25:38,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-02-04 17:25:38,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2018-02-04 17:25:38,636 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 19 [2018-02-04 17:25:38,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:38,636 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2018-02-04 17:25:38,636 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 17:25:38,636 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2018-02-04 17:25:38,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 17:25:38,637 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:38,637 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:25:38,637 INFO L371 AbstractCegarLoop]: === Iteration 5 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:38,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1662425565, now seen corresponding path program 1 times [2018-02-04 17:25:38,637 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:38,637 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:38,638 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:38,638 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:38,638 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:38,649 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:38,697 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:25:38,697 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:25:38,697 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:25:38,698 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:38,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:38,722 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:25:38,749 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:25:38,750 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:25:38,750 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 11 [2018-02-04 17:25:38,750 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 17:25:38,750 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 17:25:38,750 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-02-04 17:25:38,751 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand 11 states. [2018-02-04 17:25:38,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:38,900 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2018-02-04 17:25:38,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 17:25:38,900 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-02-04 17:25:38,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:38,901 INFO L225 Difference]: With dead ends: 118 [2018-02-04 17:25:38,901 INFO L226 Difference]: Without dead ends: 118 [2018-02-04 17:25:38,902 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-02-04 17:25:38,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-02-04 17:25:38,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 113. [2018-02-04 17:25:38,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-02-04 17:25:38,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2018-02-04 17:25:38,908 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 23 [2018-02-04 17:25:38,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:38,908 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2018-02-04 17:25:38,908 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 17:25:38,908 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2018-02-04 17:25:38,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-04 17:25:38,909 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:38,909 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 17:25:38,909 INFO L371 AbstractCegarLoop]: === Iteration 6 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:38,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1044193829, now seen corresponding path program 1 times [2018-02-04 17:25:38,910 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:38,910 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:38,910 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:38,911 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:38,911 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:38,921 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:38,924 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:25:38,924 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:25:38,924 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:25:38,925 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:38,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:38,950 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:25:38,953 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-02-04 17:25:38,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:25:38,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:25:38,957 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-02-04 17:25:38,968 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 16 treesize of output 15 [2018-02-04 17:25:38,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:25:38,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:25:38,973 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:18 [2018-02-04 17:25:39,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:25:39,013 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:25:39,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-04 17:25:39,014 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 17:25:39,014 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 17:25:39,014 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-04 17:25:39,014 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand 7 states. [2018-02-04 17:25:39,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:39,194 INFO L93 Difference]: Finished difference Result 158 states and 174 transitions. [2018-02-04 17:25:39,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 17:25:39,194 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-02-04 17:25:39,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:39,197 INFO L225 Difference]: With dead ends: 158 [2018-02-04 17:25:39,197 INFO L226 Difference]: Without dead ends: 158 [2018-02-04 17:25:39,197 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-02-04 17:25:39,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-02-04 17:25:39,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 132. [2018-02-04 17:25:39,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-02-04 17:25:39,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 157 transitions. [2018-02-04 17:25:39,203 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 157 transitions. Word has length 23 [2018-02-04 17:25:39,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:39,203 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 157 transitions. [2018-02-04 17:25:39,203 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 17:25:39,203 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 157 transitions. [2018-02-04 17:25:39,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 17:25:39,204 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:39,204 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-04 17:25:39,204 INFO L371 AbstractCegarLoop]: === Iteration 7 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:39,204 INFO L82 PathProgramCache]: Analyzing trace with hash 186672598, now seen corresponding path program 1 times [2018-02-04 17:25:39,204 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:39,205 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:39,205 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:39,205 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:39,206 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:39,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:39,215 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:39,243 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:25:39,243 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:25:39,243 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:25:39,244 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:39,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:39,253 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:25:39,263 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:25:39,264 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 17:25:39,264 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-02-04 17:25:39,264 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 17:25:39,264 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 17:25:39,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-04 17:25:39,264 INFO L87 Difference]: Start difference. First operand 132 states and 157 transitions. Second operand 8 states. [2018-02-04 17:25:39,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:39,339 INFO L93 Difference]: Finished difference Result 215 states and 256 transitions. [2018-02-04 17:25:39,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 17:25:39,340 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-02-04 17:25:39,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:39,340 INFO L225 Difference]: With dead ends: 215 [2018-02-04 17:25:39,340 INFO L226 Difference]: Without dead ends: 215 [2018-02-04 17:25:39,341 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-02-04 17:25:39,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-02-04 17:25:39,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 152. [2018-02-04 17:25:39,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-02-04 17:25:39,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 180 transitions. [2018-02-04 17:25:39,348 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 180 transitions. Word has length 28 [2018-02-04 17:25:39,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:39,348 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 180 transitions. [2018-02-04 17:25:39,348 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 17:25:39,349 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 180 transitions. [2018-02-04 17:25:39,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 17:25:39,349 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:39,349 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-04 17:25:39,350 INFO L371 AbstractCegarLoop]: === Iteration 8 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:39,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1928191573, now seen corresponding path program 2 times [2018-02-04 17:25:39,350 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:39,350 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:39,350 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:39,350 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:39,350 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:39,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:39,362 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:39,368 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:25:39,368 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:25:39,368 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:25:39,369 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:25:39,384 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-02-04 17:25:39,385 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:25:39,388 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:25:39,396 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-02-04 17:25:39,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:25:39,403 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-02-04 17:25:39,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:25:39,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:25:39,408 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-02-04 17:25:39,442 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:25:39,443 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:25:39,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-04 17:25:39,444 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:25:39,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-02-04 17:25:39,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:25:39,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 17:25:39,460 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:22 [2018-02-04 17:25:39,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2018-02-04 17:25:39,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:25:39,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-04 17:25:39,491 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:29 [2018-02-04 17:25:39,560 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 17:25:39,561 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:25:39,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 17:25:39,561 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 17:25:39,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 17:25:39,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-04 17:25:39,562 INFO L87 Difference]: Start difference. First operand 152 states and 180 transitions. Second operand 9 states. [2018-02-04 17:25:39,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:39,742 INFO L93 Difference]: Finished difference Result 149 states and 171 transitions. [2018-02-04 17:25:39,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 17:25:39,742 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-02-04 17:25:39,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:39,743 INFO L225 Difference]: With dead ends: 149 [2018-02-04 17:25:39,743 INFO L226 Difference]: Without dead ends: 149 [2018-02-04 17:25:39,743 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-02-04 17:25:39,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-02-04 17:25:39,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-02-04 17:25:39,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-02-04 17:25:39,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 171 transitions. [2018-02-04 17:25:39,747 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 171 transitions. Word has length 33 [2018-02-04 17:25:39,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:39,748 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 171 transitions. [2018-02-04 17:25:39,748 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 17:25:39,748 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 171 transitions. [2018-02-04 17:25:39,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 17:25:39,749 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:39,749 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-04 17:25:39,749 INFO L371 AbstractCegarLoop]: === Iteration 9 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:39,749 INFO L82 PathProgramCache]: Analyzing trace with hash -355603392, now seen corresponding path program 1 times [2018-02-04 17:25:39,749 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:39,749 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:39,750 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:39,750 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 17:25:39,750 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:39,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:39,760 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:39,822 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 17:25:39,822 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:25:39,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 17:25:39,823 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 17:25:39,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 17:25:39,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-02-04 17:25:39,824 INFO L87 Difference]: Start difference. First operand 149 states and 171 transitions. Second operand 9 states. [2018-02-04 17:25:39,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:39,902 INFO L93 Difference]: Finished difference Result 208 states and 243 transitions. [2018-02-04 17:25:39,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 17:25:39,902 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-02-04 17:25:39,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:39,903 INFO L225 Difference]: With dead ends: 208 [2018-02-04 17:25:39,903 INFO L226 Difference]: Without dead ends: 208 [2018-02-04 17:25:39,904 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-02-04 17:25:39,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-02-04 17:25:39,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 157. [2018-02-04 17:25:39,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-02-04 17:25:39,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 181 transitions. [2018-02-04 17:25:39,911 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 181 transitions. Word has length 34 [2018-02-04 17:25:39,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:39,911 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 181 transitions. [2018-02-04 17:25:39,911 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 17:25:39,912 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 181 transitions. [2018-02-04 17:25:39,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-02-04 17:25:39,912 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:39,913 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-04 17:25:39,913 INFO L371 AbstractCegarLoop]: === Iteration 10 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:39,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1903660313, now seen corresponding path program 1 times [2018-02-04 17:25:39,913 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:39,913 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:39,914 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:39,914 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:39,914 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:39,923 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:40,055 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-04 17:25:40,055 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:25:40,055 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-04 17:25:40,055 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 17:25:40,056 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 17:25:40,056 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-02-04 17:25:40,056 INFO L87 Difference]: Start difference. First operand 157 states and 181 transitions. Second operand 13 states. [2018-02-04 17:25:40,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:40,220 INFO L93 Difference]: Finished difference Result 157 states and 181 transitions. [2018-02-04 17:25:40,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 17:25:40,220 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2018-02-04 17:25:40,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:40,221 INFO L225 Difference]: With dead ends: 157 [2018-02-04 17:25:40,221 INFO L226 Difference]: Without dead ends: 157 [2018-02-04 17:25:40,222 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=151, Invalid=401, Unknown=0, NotChecked=0, Total=552 [2018-02-04 17:25:40,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-02-04 17:25:40,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 125. [2018-02-04 17:25:40,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-02-04 17:25:40,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 137 transitions. [2018-02-04 17:25:40,224 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 137 transitions. Word has length 37 [2018-02-04 17:25:40,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:40,224 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 137 transitions. [2018-02-04 17:25:40,224 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 17:25:40,224 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 137 transitions. [2018-02-04 17:25:40,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 17:25:40,225 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:40,226 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-04 17:25:40,226 INFO L371 AbstractCegarLoop]: === Iteration 11 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:40,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1116063411, now seen corresponding path program 1 times [2018-02-04 17:25:40,226 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:40,226 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:40,227 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:40,227 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:40,227 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:40,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:40,233 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:40,243 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 17:25:40,244 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:25:40,244 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 17:25:40,244 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-04 17:25:40,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-04 17:25:40,244 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 17:25:40,244 INFO L87 Difference]: Start difference. First operand 125 states and 137 transitions. Second operand 3 states. [2018-02-04 17:25:40,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:40,249 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2018-02-04 17:25:40,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-04 17:25:40,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-02-04 17:25:40,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:40,250 INFO L225 Difference]: With dead ends: 126 [2018-02-04 17:25:40,250 INFO L226 Difference]: Without dead ends: 126 [2018-02-04 17:25:40,250 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-04 17:25:40,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-02-04 17:25:40,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-02-04 17:25:40,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-02-04 17:25:40,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2018-02-04 17:25:40,253 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 38 [2018-02-04 17:25:40,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:40,253 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2018-02-04 17:25:40,253 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-04 17:25:40,253 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2018-02-04 17:25:40,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 17:25:40,254 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:40,255 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-04 17:25:40,255 INFO L371 AbstractCegarLoop]: === Iteration 12 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:40,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1116072442, now seen corresponding path program 1 times [2018-02-04 17:25:40,255 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:40,255 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:40,256 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:40,256 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:40,256 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:40,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:40,263 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:40,322 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 17:25:40,323 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:25:40,323 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 17:25:40,323 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 17:25:40,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 17:25:40,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-02-04 17:25:40,323 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand 11 states. [2018-02-04 17:25:40,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:40,482 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2018-02-04 17:25:40,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 17:25:40,482 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-02-04 17:25:40,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:40,483 INFO L225 Difference]: With dead ends: 125 [2018-02-04 17:25:40,483 INFO L226 Difference]: Without dead ends: 125 [2018-02-04 17:25:40,483 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2018-02-04 17:25:40,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-04 17:25:40,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2018-02-04 17:25:40,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-02-04 17:25:40,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2018-02-04 17:25:40,486 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 38 [2018-02-04 17:25:40,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:40,486 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2018-02-04 17:25:40,486 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 17:25:40,486 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2018-02-04 17:25:40,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-02-04 17:25:40,487 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:40,487 INFO L351 BasicCegarLoop]: trace histogram [3, 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] [2018-02-04 17:25:40,487 INFO L371 AbstractCegarLoop]: === Iteration 13 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:40,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1390751146, now seen corresponding path program 1 times [2018-02-04 17:25:40,488 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:40,488 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:40,488 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:40,488 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:40,489 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:40,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:40,496 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:40,561 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 17:25:40,562 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:25:40,562 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 17:25:40,562 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 17:25:40,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 17:25:40,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-04 17:25:40,562 INFO L87 Difference]: Start difference. First operand 124 states and 136 transitions. Second operand 9 states. [2018-02-04 17:25:40,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:40,656 INFO L93 Difference]: Finished difference Result 143 states and 158 transitions. [2018-02-04 17:25:40,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 17:25:40,656 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-02-04 17:25:40,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:40,657 INFO L225 Difference]: With dead ends: 143 [2018-02-04 17:25:40,657 INFO L226 Difference]: Without dead ends: 143 [2018-02-04 17:25:40,657 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-02-04 17:25:40,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-02-04 17:25:40,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2018-02-04 17:25:40,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-02-04 17:25:40,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 157 transitions. [2018-02-04 17:25:40,661 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 157 transitions. Word has length 42 [2018-02-04 17:25:40,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:40,661 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 157 transitions. [2018-02-04 17:25:40,661 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 17:25:40,661 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 157 transitions. [2018-02-04 17:25:40,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-04 17:25:40,661 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:40,662 INFO L351 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] [2018-02-04 17:25:40,662 INFO L371 AbstractCegarLoop]: === Iteration 14 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:40,662 INFO L82 PathProgramCache]: Analyzing trace with hash -363955689, now seen corresponding path program 1 times [2018-02-04 17:25:40,662 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:40,662 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:40,663 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:40,663 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:40,663 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:40,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:40,673 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:40,676 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:25:40,676 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:25:40,676 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:25:40,677 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:40,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:40,694 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:25:40,702 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-02-04 17:25:40,702 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:25:40,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:25:40,707 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-02-04 17:25:40,725 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:25:40,726 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 17:25:40,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 12 [2018-02-04 17:25:40,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 17:25:40,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:25:40,732 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-02-04 17:25:40,750 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 15 treesize of output 12 [2018-02-04 17:25:40,751 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 12 treesize of output 11 [2018-02-04 17:25:40,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:25:40,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:25:40,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:25:40,767 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-02-04 17:25:40,792 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 27 treesize of output 28 [2018-02-04 17:25:40,793 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 12 treesize of output 11 [2018-02-04 17:25:40,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:25:40,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:25:40,805 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-02-04 17:25:40,805 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:43 [2018-02-04 17:25:40,862 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 34 treesize of output 32 [2018-02-04 17:25:40,865 INFO L682 Elim1Store]: detected equality via solver [2018-02-04 17:25:40,866 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 19 treesize of output 15 [2018-02-04 17:25:40,866 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 17:25:40,873 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 9 treesize of output 1 [2018-02-04 17:25:40,874 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 17:25:40,876 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:25:40,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 17:25:40,887 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:64, output treesize:7 [2018-02-04 17:25:40,906 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 17:25:40,906 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:25:40,906 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-04 17:25:40,907 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 17:25:40,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 17:25:40,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-02-04 17:25:40,907 INFO L87 Difference]: Start difference. First operand 142 states and 157 transitions. Second operand 11 states. [2018-02-04 17:25:42,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:42,331 INFO L93 Difference]: Finished difference Result 168 states and 184 transitions. [2018-02-04 17:25:42,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 17:25:42,331 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2018-02-04 17:25:42,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:42,333 INFO L225 Difference]: With dead ends: 168 [2018-02-04 17:25:42,333 INFO L226 Difference]: Without dead ends: 168 [2018-02-04 17:25:42,333 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=109, Invalid=232, Unknown=1, NotChecked=0, Total=342 [2018-02-04 17:25:42,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-02-04 17:25:42,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 147. [2018-02-04 17:25:42,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-02-04 17:25:42,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 161 transitions. [2018-02-04 17:25:42,339 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 161 transitions. Word has length 44 [2018-02-04 17:25:42,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:42,339 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 161 transitions. [2018-02-04 17:25:42,339 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 17:25:42,340 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 161 transitions. [2018-02-04 17:25:42,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-02-04 17:25:42,340 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:42,343 INFO L351 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] [2018-02-04 17:25:42,343 INFO L371 AbstractCegarLoop]: === Iteration 15 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:42,343 INFO L82 PathProgramCache]: Analyzing trace with hash -2022275116, now seen corresponding path program 1 times [2018-02-04 17:25:42,343 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:42,343 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:42,344 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:42,344 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:42,344 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:42,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:42,351 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:42,353 INFO L430 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-02-04 17:25:42,353 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:25:42,353 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:25:42,354 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:42,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:42,365 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:25:42,405 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|lis_#t~malloc0.base| Int)) (let ((.cse0 (store |c_old(#valid)| |lis_#t~malloc0.base| 1))) (and (= 0 (select .cse0 |c_lis_#t~malloc1.base|)) (= |c_#valid| (store (store .cse0 |c_lis_#t~malloc1.base| 1) |lis_#t~malloc0.base| 0)) (= (select |c_old(#valid)| |lis_#t~malloc0.base|) 0)))) is different from true [2018-02-04 17:25:42,410 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|lis_#t~malloc1.base| Int) (|lis_#t~malloc0.base| Int)) (let ((.cse0 (store |c_old(#valid)| |lis_#t~malloc0.base| 1))) (and (= 0 (select .cse0 |lis_#t~malloc1.base|)) (= (select |c_old(#valid)| |lis_#t~malloc0.base|) 0) (= |c_#valid| (store (store (store .cse0 |lis_#t~malloc1.base| 1) |lis_#t~malloc0.base| 0) |lis_#t~malloc1.base| 0))))) is different from true [2018-02-04 17:25:42,436 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|lis_#t~malloc1.base| Int) (|main_#t~malloc19.base| Int) (|lis_#t~malloc0.base| Int)) (let ((.cse1 (store |c_old(#valid)| |main_#t~malloc19.base| 1))) (let ((.cse0 (store .cse1 |lis_#t~malloc0.base| 1))) (and (= (store (store (store (store .cse0 |lis_#t~malloc1.base| 1) |lis_#t~malloc0.base| 0) |lis_#t~malloc1.base| 0) |main_#t~malloc19.base| 0) |c_#valid|) (= 0 (select .cse0 |lis_#t~malloc1.base|)) (= 0 (select |c_old(#valid)| |main_#t~malloc19.base|)) (= (select .cse1 |lis_#t~malloc0.base|) 0))))) is different from true [2018-02-04 17:25:42,445 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 17:25:42,445 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 17:25:42,445 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 17:25:42,446 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 17:25:42,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 17:25:42,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=33, Unknown=3, NotChecked=36, Total=90 [2018-02-04 17:25:42,446 INFO L87 Difference]: Start difference. First operand 147 states and 161 transitions. Second operand 10 states. [2018-02-04 17:25:42,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:42,516 INFO L93 Difference]: Finished difference Result 146 states and 160 transitions. [2018-02-04 17:25:42,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 17:25:42,516 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2018-02-04 17:25:42,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:42,517 INFO L225 Difference]: With dead ends: 146 [2018-02-04 17:25:42,517 INFO L226 Difference]: Without dead ends: 72 [2018-02-04 17:25:42,517 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=43, Unknown=4, NotChecked=42, Total=110 [2018-02-04 17:25:42,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-02-04 17:25:42,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-02-04 17:25:42,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-04 17:25:42,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2018-02-04 17:25:42,522 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 46 [2018-02-04 17:25:42,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:42,522 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2018-02-04 17:25:42,522 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 17:25:42,522 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2018-02-04 17:25:42,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-04 17:25:42,523 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:42,523 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-02-04 17:25:42,523 INFO L371 AbstractCegarLoop]: === Iteration 16 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:42,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1787354498, now seen corresponding path program 1 times [2018-02-04 17:25:42,523 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:42,524 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:42,524 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:42,524 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:42,524 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:42,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:42,532 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:42,606 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-02-04 17:25:42,606 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:25:42,606 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:25:42,607 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:42,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:42,615 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:25:42,652 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-02-04 17:25:42,652 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:25:42,652 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 13 [2018-02-04 17:25:42,652 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 17:25:42,652 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 17:25:42,652 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-02-04 17:25:42,652 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand 13 states. [2018-02-04 17:25:42,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:42,794 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2018-02-04 17:25:42,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 17:25:42,795 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2018-02-04 17:25:42,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:42,795 INFO L225 Difference]: With dead ends: 88 [2018-02-04 17:25:42,795 INFO L226 Difference]: Without dead ends: 88 [2018-02-04 17:25:42,796 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=428, Unknown=0, NotChecked=0, Total=552 [2018-02-04 17:25:42,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-02-04 17:25:42,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 72. [2018-02-04 17:25:42,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-02-04 17:25:42,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2018-02-04 17:25:42,798 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 47 [2018-02-04 17:25:42,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:42,798 INFO L432 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2018-02-04 17:25:42,798 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 17:25:42,798 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-02-04 17:25:42,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-04 17:25:42,799 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 17:25:42,799 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 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] [2018-02-04 17:25:42,799 INFO L371 AbstractCegarLoop]: === Iteration 17 === [lisErr10RequiresViolation, lisErr19RequiresViolation, lisErr6RequiresViolation, lisErr20RequiresViolation, lisErr18RequiresViolation, lisErr7RequiresViolation, lisErr5RequiresViolation, lisErr13RequiresViolation, lisErr0RequiresViolation, lisErr9RequiresViolation, lisErr2RequiresViolation, lisErr15RequiresViolation, lisErr8RequiresViolation, lisErr17RequiresViolation, lisErr4RequiresViolation, lisErr12RequiresViolation, lisErr21RequiresViolation, lisErr11RequiresViolation, lisErr3RequiresViolation, lisErr1RequiresViolation, lisErr16RequiresViolation, lisErr14RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 17:25:42,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1878068012, now seen corresponding path program 2 times [2018-02-04 17:25:42,799 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-02-04 17:25:42,799 INFO L67 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-02-04 17:25:42,800 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:42,800 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 17:25:42,800 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 17:25:42,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 17:25:42,808 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 17:25:42,897 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-02-04 17:25:42,897 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 17:25:42,897 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-02-04 17:25:42,898 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 17:25:42,917 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 17:25:42,917 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 17:25:42,920 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 17:25:42,979 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-02-04 17:25:42,979 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 17:25:42,979 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 20 [2018-02-04 17:25:42,979 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 17:25:42,980 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 17:25:42,980 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2018-02-04 17:25:42,980 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 20 states. [2018-02-04 17:25:43,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 17:25:43,393 INFO L93 Difference]: Finished difference Result 171 states and 189 transitions. [2018-02-04 17:25:43,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-04 17:25:43,393 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 55 [2018-02-04 17:25:43,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 17:25:43,394 INFO L225 Difference]: With dead ends: 171 [2018-02-04 17:25:43,394 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 17:25:43,394 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=393, Invalid=1413, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 17:25:43,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 17:25:43,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 17:25:43,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 17:25:43,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 17:25:43,400 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2018-02-04 17:25:43,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 17:25:43,400 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 17:25:43,401 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 17:25:43,401 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 17:25:43,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 17:25:43,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 05:25:43 BoogieIcfgContainer [2018-02-04 17:25:43,404 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 17:25:43,405 INFO L168 Benchmark]: Toolchain (without parser) took 6486.09 ms. Allocated memory was 401.1 MB in the beginning and 710.9 MB in the end (delta: 309.9 MB). Free memory was 357.9 MB in the beginning and 677.3 MB in the end (delta: -319.4 MB). Peak memory consumption was 246.0 MB. Max. memory is 5.3 GB. [2018-02-04 17:25:43,406 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 401.1 MB. Free memory is still 364.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 17:25:43,406 INFO L168 Benchmark]: CACSL2BoogieTranslator took 152.65 ms. Allocated memory is still 401.1 MB. Free memory was 357.9 MB in the beginning and 347.3 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 17:25:43,406 INFO L168 Benchmark]: Boogie Preprocessor took 28.45 ms. Allocated memory is still 401.1 MB. Free memory was 347.3 MB in the beginning and 346.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 17:25:43,406 INFO L168 Benchmark]: RCFGBuilder took 238.08 ms. Allocated memory is still 401.1 MB. Free memory was 346.0 MB in the beginning and 320.0 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 5.3 GB. [2018-02-04 17:25:43,407 INFO L168 Benchmark]: TraceAbstraction took 6064.36 ms. Allocated memory was 401.1 MB in the beginning and 710.9 MB in the end (delta: 309.9 MB). Free memory was 320.0 MB in the beginning and 677.3 MB in the end (delta: -357.3 MB). Peak memory consumption was 208.0 MB. Max. memory is 5.3 GB. [2018-02-04 17:25:43,407 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.20 ms. Allocated memory is still 401.1 MB. Free memory is still 364.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 152.65 ms. Allocated memory is still 401.1 MB. Free memory was 357.9 MB in the beginning and 347.3 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.45 ms. Allocated memory is still 401.1 MB. Free memory was 347.3 MB in the beginning and 346.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 238.08 ms. Allocated memory is still 401.1 MB. Free memory was 346.0 MB in the beginning and 320.0 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 6064.36 ms. Allocated memory was 401.1 MB in the beginning and 710.9 MB in the end (delta: 309.9 MB). Free memory was 320.0 MB in the beginning and 677.3 MB in the end (delta: -357.3 MB). Peak memory consumption was 208.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 556]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 23 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 84 locations, 23 error locations. SAFE Result, 6.0s OverallTime, 17 OverallIterations, 4 TraceHistogramMax, 3.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 896 SDtfs, 3268 SDslu, 2616 SDs, 0 SdLazy, 2161 SolverSat, 267 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 522 GetRequests, 285 SyntacticMatches, 7 SemanticMatches, 230 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=157occurred in iteration=9, 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, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 241 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 897 NumberOfCodeBlocks, 887 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 694 ConstructedInterpolants, 52 QuantifiedInterpolants, 181428 SizeOfPredicates, 46 NumberOfNonLiveVariables, 1234 ConjunctsInSsa, 118 ConjunctsInUnsatCore, 21 InterpolantComputations, 14 PerfectInterpolantSequences, 143/183 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_17-25-43-414.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_17-25-43-414.csv Received shutdown request...