java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:49:58,634 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:49:58,636 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:49:58,651 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:49:58,652 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:49:58,653 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:49:58,654 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:49:58,656 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:49:58,658 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:49:58,659 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:49:58,660 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:49:58,660 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:49:58,661 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:49:58,663 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:49:58,664 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:49:58,666 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:49:58,669 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:49:58,671 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:49:58,672 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:49:58,674 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:49:58,676 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:49:58,676 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:49:58,677 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:49:58,678 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:49:58,678 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:49:58,679 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:49:58,680 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:49:58,680 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:49:58,681 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:49:58,681 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:49:58,681 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:49:58,682 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf [2018-01-24 12:49:58,690 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:49:58,690 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:49:58,691 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:49:58,691 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:49:58,691 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:49:58,691 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:49:58,691 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:49:58,692 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:49:58,692 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:49:58,692 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:49:58,692 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:49:58,692 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:49:58,692 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:49:58,693 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:49:58,693 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:49:58,693 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:49:58,693 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:49:58,693 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:49:58,693 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:49:58,693 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:49:58,693 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:49:58,694 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:49:58,694 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:49:58,694 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:49:58,694 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:49:58,694 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:49:58,695 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:49:58,695 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:49:58,695 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 12:49:58,695 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:49:58,695 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:49:58,695 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:49:58,696 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:49:58,696 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:49:58,729 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:49:58,740 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:49:58,743 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:49:58,745 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:49:58,745 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:49:58,745 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i [2018-01-24 12:49:58,914 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:49:58,919 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:49:58,920 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:49:58,920 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:49:58,925 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:49:58,926 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:49:58" (1/1) ... [2018-01-24 12:49:58,929 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75d63a1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:49:58, skipping insertion in model container [2018-01-24 12:49:58,929 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:49:58" (1/1) ... [2018-01-24 12:49:58,943 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:49:58,980 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:49:59,099 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:49:59,119 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:49:59,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:49:59 WrapperNode [2018-01-24 12:49:59,125 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:49:59,125 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:49:59,125 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:49:59,126 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:49:59,137 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:49:59" (1/1) ... [2018-01-24 12:49:59,137 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:49:59" (1/1) ... [2018-01-24 12:49:59,147 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:49:59" (1/1) ... [2018-01-24 12:49:59,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:49:59" (1/1) ... [2018-01-24 12:49:59,151 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:49:59" (1/1) ... [2018-01-24 12:49:59,155 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:49:59" (1/1) ... [2018-01-24 12:49:59,156 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:49:59" (1/1) ... [2018-01-24 12:49:59,158 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:49:59,158 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:49:59,158 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:49:59,158 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:49:59,159 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:49:59" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:49:59,216 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:49:59,216 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:49:59,217 INFO L136 BoogieDeclarations]: Found implementation of procedure lis [2018-01-24 12:49:59,217 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:49:59,217 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 12:49:59,217 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 12:49:59,217 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:49:59,217 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:49:59,217 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:49:59,217 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 12:49:59,217 INFO L128 BoogieDeclarations]: Found specification of procedure lis [2018-01-24 12:49:59,217 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:49:59,218 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:49:59,218 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:49:59,553 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:49:59,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:49:59 BoogieIcfgContainer [2018-01-24 12:49:59,554 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:49:59,555 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:49:59,555 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:49:59,558 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:49:59,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:49:58" (1/3) ... [2018-01-24 12:49:59,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d3a9f57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:49:59, skipping insertion in model container [2018-01-24 12:49:59,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:49:59" (2/3) ... [2018-01-24 12:49:59,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d3a9f57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:49:59, skipping insertion in model container [2018-01-24 12:49:59,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:49:59" (3/3) ... [2018-01-24 12:49:59,562 INFO L105 eAbstractionObserver]: Analyzing ICFG lis-alloca_true-valid-memsafety_true-termination.i [2018-01-24 12:49:59,572 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:49:59,580 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-01-24 12:49:59,626 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:49:59,627 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:49:59,627 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:49:59,627 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:49:59,627 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:49:59,627 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:49:59,627 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:49:59,627 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:49:59,628 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:49:59,646 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2018-01-24 12:49:59,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 12:49:59,652 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:49:59,653 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:49:59,654 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-01-24 12:49:59,658 INFO L82 PathProgramCache]: Analyzing trace with hash -456745945, now seen corresponding path program 1 times [2018-01-24 12:49:59,660 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:49:59,702 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:49:59,702 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:49:59,702 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:49:59,702 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:49:59,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:49:59,771 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:49:59,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:49:59,895 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:49:59,895 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:49:59,896 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:49:59,900 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:49:59,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:49:59,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:49:59,993 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 4 states. [2018-01-24 12:50:00,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:50:00,122 INFO L93 Difference]: Finished difference Result 138 states and 163 transitions. [2018-01-24 12:50:00,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:50:00,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-01-24 12:50:00,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:50:00,135 INFO L225 Difference]: With dead ends: 138 [2018-01-24 12:50:00,136 INFO L226 Difference]: Without dead ends: 74 [2018-01-24 12:50:00,140 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:50:00,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-24 12:50:00,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-24 12:50:00,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-24 12:50:00,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-01-24 12:50:00,183 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 18 [2018-01-24 12:50:00,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:50:00,183 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-01-24 12:50:00,183 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:50:00,184 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-01-24 12:50:00,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 12:50:00,184 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:50:00,184 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:50:00,185 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-01-24 12:50:00,185 INFO L82 PathProgramCache]: Analyzing trace with hash -456745944, now seen corresponding path program 1 times [2018-01-24 12:50:00,185 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:50:00,187 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:00,187 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:00,187 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:00,187 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:50:00,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:00,205 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:50:00,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:00,362 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:50:00,362 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:50:00,362 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:50:00,364 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 12:50:00,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 12:50:00,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:50:00,365 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 7 states. [2018-01-24 12:50:00,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:50:00,695 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2018-01-24 12:50:00,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:50:00,696 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-01-24 12:50:00,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:50:00,699 INFO L225 Difference]: With dead ends: 99 [2018-01-24 12:50:00,699 INFO L226 Difference]: Without dead ends: 96 [2018-01-24 12:50:00,700 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:50:00,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-24 12:50:00,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 82. [2018-01-24 12:50:00,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-24 12:50:00,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2018-01-24 12:50:00,709 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 18 [2018-01-24 12:50:00,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:50:00,709 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2018-01-24 12:50:00,709 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 12:50:00,709 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2018-01-24 12:50:00,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 12:50:00,710 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:50:00,710 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:50:00,710 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-01-24 12:50:00,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1274222418, now seen corresponding path program 1 times [2018-01-24 12:50:00,710 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:50:00,711 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:00,711 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:00,711 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:00,711 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:50:00,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:00,726 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:50:00,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:00,765 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:50:00,765 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:50:00,765 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:50:00,766 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:50:00,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:50:00,766 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:50:00,766 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 4 states. [2018-01-24 12:50:00,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:50:00,836 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2018-01-24 12:50:00,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:50:00,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-24 12:50:00,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:50:00,837 INFO L225 Difference]: With dead ends: 82 [2018-01-24 12:50:00,837 INFO L226 Difference]: Without dead ends: 80 [2018-01-24 12:50:00,838 INFO L525 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-01-24 12:50:00,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-24 12:50:00,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-01-24 12:50:00,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-24 12:50:00,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2018-01-24 12:50:00,846 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 19 [2018-01-24 12:50:00,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:50:00,846 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2018-01-24 12:50:00,846 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:50:00,846 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2018-01-24 12:50:00,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 12:50:00,847 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:50:00,847 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:50:00,847 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-01-24 12:50:00,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1274222417, now seen corresponding path program 1 times [2018-01-24 12:50:00,847 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:50:00,848 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:00,848 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:00,848 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:00,849 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:50:00,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:00,863 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:50:00,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:00,973 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:50:00,973 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:50:00,973 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:50:00,974 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:50:00,974 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:50:00,974 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:50:00,974 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 8 states. [2018-01-24 12:50:01,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:50:01,184 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2018-01-24 12:50:01,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:50:01,184 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-01-24 12:50:01,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:50:01,186 INFO L225 Difference]: With dead ends: 99 [2018-01-24 12:50:01,186 INFO L226 Difference]: Without dead ends: 97 [2018-01-24 12:50:01,187 INFO L525 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-01-24 12:50:01,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-24 12:50:01,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 78. [2018-01-24 12:50:01,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-24 12:50:01,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2018-01-24 12:50:01,197 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 19 [2018-01-24 12:50:01,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:50:01,198 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2018-01-24 12:50:01,198 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:50:01,198 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2018-01-24 12:50:01,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 12:50:01,199 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:50:01,199 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:50:01,200 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-01-24 12:50:01,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1183954355, now seen corresponding path program 1 times [2018-01-24 12:50:01,200 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:50:01,201 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:01,201 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:01,201 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:01,201 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:50:01,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:01,215 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:50:01,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:01,291 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:50:01,292 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:50:01,292 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:50:01,292 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:50:01,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:50:01,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:50:01,293 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand 6 states. [2018-01-24 12:50:01,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:50:01,487 INFO L93 Difference]: Finished difference Result 181 states and 205 transitions. [2018-01-24 12:50:01,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:50:01,488 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-24 12:50:01,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:50:01,490 INFO L225 Difference]: With dead ends: 181 [2018-01-24 12:50:01,490 INFO L226 Difference]: Without dead ends: 128 [2018-01-24 12:50:01,491 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:50:01,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-01-24 12:50:01,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 120. [2018-01-24 12:50:01,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-01-24 12:50:01,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 140 transitions. [2018-01-24 12:50:01,507 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 140 transitions. Word has length 23 [2018-01-24 12:50:01,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:50:01,508 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 140 transitions. [2018-01-24 12:50:01,508 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:50:01,508 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 140 transitions. [2018-01-24 12:50:01,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 12:50:01,509 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:50:01,509 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:50:01,510 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-01-24 12:50:01,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1662425565, now seen corresponding path program 1 times [2018-01-24 12:50:01,510 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:50:01,511 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:01,511 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:01,511 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:01,511 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:50:01,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:01,526 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:50:01,646 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:01,646 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:50:01,647 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:50:01,658 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:01,658 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:50:01,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:01,688 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:50:01,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:01,752 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:50:01,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:01,820 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:50:01,820 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [9] total 13 [2018-01-24 12:50:01,820 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:50:01,820 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 12:50:01,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 12:50:01,821 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:50:01,821 INFO L87 Difference]: Start difference. First operand 120 states and 140 transitions. Second operand 7 states. [2018-01-24 12:50:01,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:50:01,920 INFO L93 Difference]: Finished difference Result 165 states and 185 transitions. [2018-01-24 12:50:01,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:50:01,920 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-01-24 12:50:01,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:50:01,921 INFO L225 Difference]: With dead ends: 165 [2018-01-24 12:50:01,921 INFO L226 Difference]: Without dead ends: 126 [2018-01-24 12:50:01,922 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-01-24 12:50:01,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-24 12:50:01,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 113. [2018-01-24 12:50:01,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-24 12:50:01,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 126 transitions. [2018-01-24 12:50:01,932 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 126 transitions. Word has length 23 [2018-01-24 12:50:01,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:50:01,932 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 126 transitions. [2018-01-24 12:50:01,932 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 12:50:01,932 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 126 transitions. [2018-01-24 12:50:01,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 12:50:01,933 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:50:01,933 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:50:01,933 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-01-24 12:50:01,933 INFO L82 PathProgramCache]: Analyzing trace with hash -404393547, now seen corresponding path program 1 times [2018-01-24 12:50:01,933 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:50:01,934 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:01,934 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:01,934 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:01,934 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:50:01,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:01,941 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:50:02,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:02,007 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:50:02,007 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:50:02,007 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:50:02,007 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:50:02,007 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:50:02,007 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:50:02,008 INFO L87 Difference]: Start difference. First operand 113 states and 126 transitions. Second operand 6 states. [2018-01-24 12:50:02,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:50:02,127 INFO L93 Difference]: Finished difference Result 191 states and 213 transitions. [2018-01-24 12:50:02,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:50:02,128 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-24 12:50:02,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:50:02,129 INFO L225 Difference]: With dead ends: 191 [2018-01-24 12:50:02,129 INFO L226 Difference]: Without dead ends: 117 [2018-01-24 12:50:02,129 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:50:02,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-24 12:50:02,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2018-01-24 12:50:02,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-01-24 12:50:02,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2018-01-24 12:50:02,138 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 23 [2018-01-24 12:50:02,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:50:02,139 INFO L432 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2018-01-24 12:50:02,139 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:50:02,139 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2018-01-24 12:50:02,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 12:50:02,140 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:50:02,140 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:50:02,140 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-01-24 12:50:02,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1044193829, now seen corresponding path program 1 times [2018-01-24 12:50:02,140 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:50:02,141 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:02,141 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:02,141 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:02,141 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:50:02,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:02,154 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:50:02,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:02,280 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:50:02,280 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:50:02,290 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:02,290 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:50:02,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:02,320 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:50:02,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 12:50:02,353 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:02,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:50:02,361 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:02,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:50:02,366 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-01-24 12:50:02,376 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:50:02,377 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:50:02,380 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-01-24 12:50:02,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:02,389 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-01-24 12:50:02,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:02,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:50:02,399 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-01-24 12:50:02,523 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:02,523 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:50:02,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:02,744 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:50:02,745 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 12:50:02,749 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:02,749 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:50:02,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:02,780 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:50:02,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 12:50:02,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:02,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:50:02,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:02,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:50:02,801 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-01-24 12:50:02,817 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:50:02,818 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-01-24 12:50:02,818 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:02,831 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:50:02,832 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:50:02,833 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-01-24 12:50:02,834 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:02,841 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-01-24 12:50:02,841 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:22 [2018-01-24 12:50:02,871 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:02,872 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:50:02,999 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:03,004 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:50:03,004 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7] total 18 [2018-01-24 12:50:03,004 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:50:03,005 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 12:50:03,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 12:50:03,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2018-01-24 12:50:03,006 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand 12 states. [2018-01-24 12:50:03,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:50:03,429 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2018-01-24 12:50:03,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:50:03,429 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2018-01-24 12:50:03,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:50:03,430 INFO L225 Difference]: With dead ends: 117 [2018-01-24 12:50:03,430 INFO L226 Difference]: Without dead ends: 112 [2018-01-24 12:50:03,431 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 73 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2018-01-24 12:50:03,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-01-24 12:50:03,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 104. [2018-01-24 12:50:03,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-24 12:50:03,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2018-01-24 12:50:03,440 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 23 [2018-01-24 12:50:03,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:50:03,440 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2018-01-24 12:50:03,440 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 12:50:03,440 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2018-01-24 12:50:03,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 12:50:03,441 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:50:03,442 INFO L322 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-01-24 12:50:03,442 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-01-24 12:50:03,442 INFO L82 PathProgramCache]: Analyzing trace with hash 186672598, now seen corresponding path program 1 times [2018-01-24 12:50:03,442 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:50:03,443 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:03,443 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:03,443 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:03,443 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:50:03,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:03,458 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:50:03,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:03,500 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:50:03,501 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:50:03,510 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:03,510 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:50:03,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:03,532 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:50:03,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:03,575 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:50:03,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:03,692 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:50:03,692 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 12:50:03,703 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:03,703 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:50:03,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:03,735 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:50:03,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:03,739 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:50:03,769 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:03,770 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 12:50:03,770 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6] total 9 [2018-01-24 12:50:03,770 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 12:50:03,771 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:50:03,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:50:03,771 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:50:03,771 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand 8 states. [2018-01-24 12:50:03,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:50:03,897 INFO L93 Difference]: Finished difference Result 222 states and 246 transitions. [2018-01-24 12:50:03,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:50:03,897 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-01-24 12:50:03,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:50:03,898 INFO L225 Difference]: With dead ends: 222 [2018-01-24 12:50:03,898 INFO L226 Difference]: Without dead ends: 176 [2018-01-24 12:50:03,899 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 102 SyntacticMatches, 7 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:50:03,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-01-24 12:50:03,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 124. [2018-01-24 12:50:03,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-24 12:50:03,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2018-01-24 12:50:03,910 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 28 [2018-01-24 12:50:03,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:50:03,910 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2018-01-24 12:50:03,910 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:50:03,910 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2018-01-24 12:50:03,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 12:50:03,911 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:50:03,911 INFO L322 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-01-24 12:50:03,912 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-01-24 12:50:03,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1928191573, now seen corresponding path program 2 times [2018-01-24 12:50:03,912 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:50:03,913 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:03,913 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:03,913 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:03,913 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:50:03,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:03,931 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:50:04,373 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:04,373 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:50:04,373 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:50:04,378 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:50:04,379 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 12:50:04,390 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:50:04,392 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:50:04,394 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:50:04,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:50:04,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:04,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-01-24 12:50:04,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:04,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:50:04,407 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-01-24 12:50:04,456 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:50:04,458 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-01-24 12:50:04,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:04,470 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:50:04,471 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:50:04,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-24 12:50:04,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:04,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 12:50:04,482 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:35 [2018-01-24 12:50:04,511 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:50:04,512 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:50:04,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 34 [2018-01-24 12:50:04,515 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:04,532 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:50:04,533 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:50:04,534 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:50:04,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-01-24 12:50:04,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:04,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-24 12:50:04,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:48, output treesize:40 [2018-01-24 12:50:04,736 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-01-24 12:50:04,737 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:50:05,704 WARN L143 SmtUtils]: Spent 711ms on a formula simplification that was a NOOP. DAG size: 53 [2018-01-24 12:50:05,897 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-01-24 12:50:05,927 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:50:05,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [13] total 27 [2018-01-24 12:50:05,928 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:50:05,928 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 12:50:05,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 12:50:05,929 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=641, Unknown=0, NotChecked=0, Total=756 [2018-01-24 12:50:05,929 INFO L87 Difference]: Start difference. First operand 124 states and 135 transitions. Second operand 10 states. [2018-01-24 12:50:06,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:50:06,351 INFO L93 Difference]: Finished difference Result 124 states and 135 transitions. [2018-01-24 12:50:06,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 12:50:06,351 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-01-24 12:50:06,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:50:06,352 INFO L225 Difference]: With dead ends: 124 [2018-01-24 12:50:06,352 INFO L226 Difference]: Without dead ends: 121 [2018-01-24 12:50:06,353 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=184, Invalid=938, Unknown=0, NotChecked=0, Total=1122 [2018-01-24 12:50:06,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-24 12:50:06,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-01-24 12:50:06,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-01-24 12:50:06,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 132 transitions. [2018-01-24 12:50:06,365 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 132 transitions. Word has length 33 [2018-01-24 12:50:06,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:50:06,365 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 132 transitions. [2018-01-24 12:50:06,365 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 12:50:06,365 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 132 transitions. [2018-01-24 12:50:06,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 12:50:06,366 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:50:06,366 INFO L322 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-01-24 12:50:06,367 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-01-24 12:50:06,367 INFO L82 PathProgramCache]: Analyzing trace with hash -355603392, now seen corresponding path program 1 times [2018-01-24 12:50:06,367 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:50:06,368 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:06,368 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:50:06,368 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:06,368 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:50:06,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:06,380 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:50:06,459 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-01-24 12:50:06,459 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:50:06,459 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 12:50:06,459 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:50:06,460 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:50:06,460 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:50:06,460 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:50:06,460 INFO L87 Difference]: Start difference. First operand 121 states and 132 transitions. Second operand 9 states. [2018-01-24 12:50:06,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:50:06,631 INFO L93 Difference]: Finished difference Result 159 states and 176 transitions. [2018-01-24 12:50:06,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:50:06,633 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-01-24 12:50:06,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:50:06,634 INFO L225 Difference]: With dead ends: 159 [2018-01-24 12:50:06,634 INFO L226 Difference]: Without dead ends: 158 [2018-01-24 12:50:06,635 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-01-24 12:50:06,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-01-24 12:50:06,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 125. [2018-01-24 12:50:06,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-01-24 12:50:06,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 137 transitions. [2018-01-24 12:50:06,649 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 137 transitions. Word has length 34 [2018-01-24 12:50:06,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:50:06,649 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 137 transitions. [2018-01-24 12:50:06,649 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:50:06,649 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 137 transitions. [2018-01-24 12:50:06,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-24 12:50:06,650 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:50:06,650 INFO L322 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-01-24 12:50:06,650 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-01-24 12:50:06,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1116063411, now seen corresponding path program 1 times [2018-01-24 12:50:06,651 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:50:06,651 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:06,652 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:06,652 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:06,652 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:50:06,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:06,661 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:50:06,705 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-01-24 12:50:06,705 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:50:06,706 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:50:06,706 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:50:06,706 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:50:06,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:50:06,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:50:06,706 INFO L87 Difference]: Start difference. First operand 125 states and 137 transitions. Second operand 3 states. [2018-01-24 12:50:06,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:50:06,731 INFO L93 Difference]: Finished difference Result 173 states and 192 transitions. [2018-01-24 12:50:06,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:50:06,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-01-24 12:50:06,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:50:06,733 INFO L225 Difference]: With dead ends: 173 [2018-01-24 12:50:06,733 INFO L226 Difference]: Without dead ends: 126 [2018-01-24 12:50:06,733 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:50:06,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-24 12:50:06,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-01-24 12:50:06,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-24 12:50:06,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2018-01-24 12:50:06,744 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 38 [2018-01-24 12:50:06,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:50:06,744 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2018-01-24 12:50:06,744 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:50:06,744 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2018-01-24 12:50:06,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-24 12:50:06,745 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:50:06,745 INFO L322 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-01-24 12:50:06,745 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-01-24 12:50:06,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1116072442, now seen corresponding path program 1 times [2018-01-24 12:50:06,746 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:50:06,746 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:06,746 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:06,746 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:06,746 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:50:06,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:06,756 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:50:07,014 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-01-24 12:50:07,014 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:50:07,014 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 12:50:07,014 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:50:07,014 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 12:50:07,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 12:50:07,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:50:07,015 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand 11 states. [2018-01-24 12:50:07,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:50:07,305 INFO L93 Difference]: Finished difference Result 127 states and 139 transitions. [2018-01-24 12:50:07,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 12:50:07,306 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-01-24 12:50:07,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:50:07,307 INFO L225 Difference]: With dead ends: 127 [2018-01-24 12:50:07,307 INFO L226 Difference]: Without dead ends: 125 [2018-01-24 12:50:07,307 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2018-01-24 12:50:07,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-01-24 12:50:07,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2018-01-24 12:50:07,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-24 12:50:07,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2018-01-24 12:50:07,322 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 38 [2018-01-24 12:50:07,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:50:07,322 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2018-01-24 12:50:07,322 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 12:50:07,323 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2018-01-24 12:50:07,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-24 12:50:07,323 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:50:07,324 INFO L322 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-01-24 12:50:07,324 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-01-24 12:50:07,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1390751146, now seen corresponding path program 1 times [2018-01-24 12:50:07,324 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:50:07,325 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:07,325 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:07,326 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:07,326 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:50:07,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:07,339 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:50:07,425 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-01-24 12:50:07,425 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:50:07,425 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 12:50:07,425 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 12:50:07,426 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:50:07,426 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:50:07,426 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:50:07,426 INFO L87 Difference]: Start difference. First operand 124 states and 136 transitions. Second operand 9 states. [2018-01-24 12:50:07,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:50:07,616 INFO L93 Difference]: Finished difference Result 189 states and 211 transitions. [2018-01-24 12:50:07,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:50:07,616 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-01-24 12:50:07,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:50:07,617 INFO L225 Difference]: With dead ends: 189 [2018-01-24 12:50:07,617 INFO L226 Difference]: Without dead ends: 143 [2018-01-24 12:50:07,618 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-01-24 12:50:07,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-01-24 12:50:07,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2018-01-24 12:50:07,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-01-24 12:50:07,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 157 transitions. [2018-01-24 12:50:07,638 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 157 transitions. Word has length 42 [2018-01-24 12:50:07,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:50:07,638 INFO L432 AbstractCegarLoop]: Abstraction has 142 states and 157 transitions. [2018-01-24 12:50:07,638 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:50:07,638 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 157 transitions. [2018-01-24 12:50:07,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-24 12:50:07,639 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:50:07,640 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:50:07,640 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-01-24 12:50:07,640 INFO L82 PathProgramCache]: Analyzing trace with hash -363955689, now seen corresponding path program 1 times [2018-01-24 12:50:07,640 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 12:50:07,641 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:07,641 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:07,641 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:50:07,641 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 12:50:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:07,660 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:50:08,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:08,050 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:50:08,050 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:50:08,057 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:08,057 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:50:08,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:08,073 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:50:08,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:50:08,083 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:08,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:50:08,085 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 12:50:08,108 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:50:08,109 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:50:08,109 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-01-24 12:50:08,109 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:08,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:50:08,111 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-24 12:50:08,137 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-01-24 12:50:08,138 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-01-24 12:50:08,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:08,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:50:08,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:50:08,146 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-01-24 12:50:08,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-01-24 12:50:08,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 12:50:08,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:08,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:50:08,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 12:50:08,177 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2018-01-24 12:50:08,233 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 22 treesize of output 20 [2018-01-24 12:50:08,234 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 5 treesize of output 1 [2018-01-24 12:50:08,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:08,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-01-24 12:50:08,238 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:08,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:50:08,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:50:08,242 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:29, output treesize:7 [2018-01-24 12:50:08,261 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:08,261 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:50:08,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2018-01-24 12:50:08,360 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 13 treesize of output 12 [2018-01-24 12:50:08,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:08,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2018-01-24 12:50:08,393 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 10 treesize of output 1 [2018-01-24 12:50:08,394 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:08,396 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:50:08,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-01-24 12:50:08,403 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2018-01-24 12:50:08,403 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-01-24 12:50:08,405 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:50:08,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-01-24 12:50:08,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-01-24 12:50:08,433 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:43, output treesize:37 [2018-01-24 12:50:08,555 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:50:08,575 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:50:08,575 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 12:50:08,579 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:50:08,580 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 12:50:08,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:50:08,619 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:50:08,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:50:08,634 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:50:08,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:50:08,635 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 12:50:08,782 WARN L1029 $PredicateComparison]: unable to prove that (and (not (= 0 |c_lis_#t~malloc1.base|)) (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) (not (= 0 |lis_#t~malloc0.base|)))))) is different from true [2018-01-24 12:50:08,788 WARN L1029 $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|)) (not (= 0 |lis_#t~malloc1.base|)) (= (select |c_old(#valid)| |lis_#t~malloc0.base|) 0) (not (= 0 |lis_#t~malloc0.base|)) (= |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-01-24 12:50:08,928 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 12:50:08,928 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 12:50:09,003 WARN L1007 $PredicateComparison]: unable to prove that (forall ((v_lis_~prev~2.base_26 Int) (v_lis_~best~2.base_39 Int)) (let ((.cse0 (store |c_#valid| v_lis_~best~2.base_39 1))) (or (not (= 0 (select .cse0 v_lis_~prev~2.base_26))) (= (store (store (store (store .cse0 v_lis_~prev~2.base_26 1) v_lis_~best~2.base_39 0) v_lis_~prev~2.base_26 0) |c_main_#t~malloc19.base| 0) |c_old(#valid)|) (= v_lis_~prev~2.base_26 0) (not (= (select |c_#valid| v_lis_~best~2.base_39) 0)) (= v_lis_~best~2.base_39 0)))) is different from false [2018-01-24 12:50:09,011 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_old(#valid)_BEFORE_CALL_2| term size 31 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:270) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:243) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:445) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:421) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:328) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:185) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:117) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-01-24 12:50:09,015 INFO L168 Benchmark]: Toolchain (without parser) took 10100.87 ms. Allocated memory was 307.2 MB in the beginning and 565.2 MB in the end (delta: 257.9 MB). Free memory was 267.3 MB in the beginning and 505.8 MB in the end (delta: -238.6 MB). Peak memory consumption was 19.4 MB. Max. memory is 5.3 GB. [2018-01-24 12:50:09,017 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 307.2 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:50:09,017 INFO L168 Benchmark]: CACSL2BoogieTranslator took 205.46 ms. Allocated memory is still 307.2 MB. Free memory was 266.3 MB in the beginning and 256.0 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 5.3 GB. [2018-01-24 12:50:09,017 INFO L168 Benchmark]: Boogie Preprocessor took 32.41 ms. Allocated memory is still 307.2 MB. Free memory was 256.0 MB in the beginning and 254.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:50:09,017 INFO L168 Benchmark]: RCFGBuilder took 396.29 ms. Allocated memory is still 307.2 MB. Free memory was 254.0 MB in the beginning and 230.3 MB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 5.3 GB. [2018-01-24 12:50:09,018 INFO L168 Benchmark]: TraceAbstraction took 9459.18 ms. Allocated memory was 307.2 MB in the beginning and 565.2 MB in the end (delta: 257.9 MB). Free memory was 230.3 MB in the beginning and 505.8 MB in the end (delta: -275.5 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:50:09,019 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.13 ms. Allocated memory is still 307.2 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 205.46 ms. Allocated memory is still 307.2 MB. Free memory was 266.3 MB in the beginning and 256.0 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.41 ms. Allocated memory is still 307.2 MB. Free memory was 256.0 MB in the beginning and 254.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 396.29 ms. Allocated memory is still 307.2 MB. Free memory was 254.0 MB in the beginning and 230.3 MB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 9459.18 ms. Allocated memory was 307.2 MB in the beginning and 565.2 MB in the end (delta: 257.9 MB). Free memory was 230.3 MB in the beginning and 505.8 MB in the end (delta: -275.5 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_old(#valid)_BEFORE_CALL_2| term size 31 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_old(#valid)_BEFORE_CALL_2| term size 31: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/lis-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-50-09-028.csv Received shutdown request...