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/ldv-memsafety/memleaks_test4_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 13:33:51,535 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 13:33:51,537 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 13:33:51,553 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 13:33:51,553 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 13:33:51,554 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 13:33:51,555 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 13:33:51,557 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 13:33:51,559 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 13:33:51,560 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 13:33:51,560 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 13:33:51,561 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 13:33:51,562 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 13:33:51,563 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 13:33:51,564 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 13:33:51,566 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 13:33:51,568 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 13:33:51,570 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 13:33:51,572 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 13:33:51,573 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 13:33:51,575 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 13:33:51,575 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 13:33:51,576 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 13:33:51,577 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 13:33:51,578 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 13:33:51,579 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 13:33:51,579 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 13:33:51,580 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 13:33:51,580 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 13:33:51,580 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 13:33:51,581 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 13:33:51,581 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 13:33:51,591 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 13:33:51,592 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 13:33:51,592 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 13:33:51,592 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 13:33:51,593 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 13:33:51,593 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 13:33:51,593 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 13:33:51,595 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 13:33:51,595 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 13:33:51,596 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 13:33:51,596 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 13:33:51,596 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 13:33:51,596 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 13:33:51,596 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 13:33:51,596 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 13:33:51,596 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 13:33:51,597 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 13:33:51,597 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 13:33:51,597 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 13:33:51,597 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 13:33:51,597 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 13:33:51,598 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 13:33:51,598 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 13:33:51,598 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 13:33:51,598 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 13:33:51,598 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 13:33:51,599 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 13:33:51,599 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 13:33:51,599 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 13:33:51,599 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 13:33:51,599 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 13:33:51,599 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 13:33:51,600 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 13:33:51,600 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 13:33:51,631 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 13:33:51,641 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 13:33:51,644 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 13:33:51,645 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 13:33:51,646 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 13:33:51,646 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test4_true-valid-memsafety_true-termination.i [2018-01-24 13:33:51,872 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 13:33:51,877 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 13:33:51,878 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 13:33:51,878 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 13:33:51,883 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 13:33:51,884 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:33:51" (1/1) ... [2018-01-24 13:33:51,887 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c105265 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:33:51, skipping insertion in model container [2018-01-24 13:33:51,887 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:33:51" (1/1) ... [2018-01-24 13:33:51,900 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:33:51,949 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:33:52,066 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:33:52,080 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:33:52,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:33:52 WrapperNode [2018-01-24 13:33:52,088 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 13:33:52,089 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 13:33:52,089 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 13:33:52,089 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 13:33:52,104 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:33:52" (1/1) ... [2018-01-24 13:33:52,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:33:52" (1/1) ... [2018-01-24 13:33:52,112 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:33:52" (1/1) ... [2018-01-24 13:33:52,113 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:33:52" (1/1) ... [2018-01-24 13:33:52,116 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:33:52" (1/1) ... [2018-01-24 13:33:52,118 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:33:52" (1/1) ... [2018-01-24 13:33:52,119 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:33:52" (1/1) ... [2018-01-24 13:33:52,121 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 13:33:52,121 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 13:33:52,121 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 13:33:52,121 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 13:33:52,122 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:33:52" (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 13:33:52,189 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 13:33:52,190 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 13:33:52,190 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-24 13:33:52,190 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 13:33:52,190 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 13:33:52,190 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 13:33:52,190 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 13:33:52,190 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 13:33:52,190 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 13:33:52,190 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 13:33:52,191 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 13:33:52,191 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-24 13:33:52,191 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 13:33:52,191 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 13:33:52,191 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 13:33:52,191 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 13:33:52,317 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 13:33:52,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:33:52 BoogieIcfgContainer [2018-01-24 13:33:52,318 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 13:33:52,318 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 13:33:52,319 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 13:33:52,320 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 13:33:52,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 01:33:51" (1/3) ... [2018-01-24 13:33:52,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c6ba913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:33:52, skipping insertion in model container [2018-01-24 13:33:52,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:33:52" (2/3) ... [2018-01-24 13:33:52,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c6ba913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:33:52, skipping insertion in model container [2018-01-24 13:33:52,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:33:52" (3/3) ... [2018-01-24 13:33:52,324 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test4_true-valid-memsafety_true-termination.i [2018-01-24 13:33:52,331 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 13:33:52,337 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-01-24 13:33:52,380 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 13:33:52,380 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 13:33:52,380 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 13:33:52,381 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 13:33:52,381 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 13:33:52,381 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 13:33:52,381 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 13:33:52,381 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 13:33:52,382 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 13:33:52,396 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-01-24 13:33:52,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 13:33:52,401 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:33:52,402 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:33:52,403 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 13:33:52,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1042309263, now seen corresponding path program 1 times [2018-01-24 13:33:52,408 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:33:52,457 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:33:52,458 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:33:52,458 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:33:52,458 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:33:52,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:33:52,512 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:33:52,589 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 13:33:52,592 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:33:52,592 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 13:33:52,592 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:33:52,595 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 13:33:52,609 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 13:33:52,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:33:52,613 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. [2018-01-24 13:33:52,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:33:52,789 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-01-24 13:33:52,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 13:33:52,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-01-24 13:33:52,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:33:52,799 INFO L225 Difference]: With dead ends: 43 [2018-01-24 13:33:52,799 INFO L226 Difference]: Without dead ends: 36 [2018-01-24 13:33:52,802 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 13:33:52,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-24 13:33:52,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2018-01-24 13:33:52,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-01-24 13:33:52,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-01-24 13:33:52,834 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 16 [2018-01-24 13:33:52,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:33:52,835 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-01-24 13:33:52,835 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 13:33:52,835 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-01-24 13:33:52,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 13:33:52,836 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:33:52,837 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 13:33:52,837 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 13:33:52,837 INFO L82 PathProgramCache]: Analyzing trace with hash -96589069, now seen corresponding path program 1 times [2018-01-24 13:33:52,837 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:33:52,838 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:33:52,839 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:33:52,839 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:33:52,839 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:33:52,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:33:52,860 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:33:52,941 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 13:33:52,941 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:33:52,942 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 13:33:52,942 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:33:52,944 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 13:33:52,944 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 13:33:52,944 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 13:33:52,944 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 6 states. [2018-01-24 13:33:53,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:33:53,042 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-01-24 13:33:53,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:33:53,042 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-01-24 13:33:53,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:33:53,044 INFO L225 Difference]: With dead ends: 44 [2018-01-24 13:33:53,044 INFO L226 Difference]: Without dead ends: 40 [2018-01-24 13:33:53,045 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:33:53,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-24 13:33:53,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 27. [2018-01-24 13:33:53,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-01-24 13:33:53,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-01-24 13:33:53,052 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 18 [2018-01-24 13:33:53,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:33:53,052 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-01-24 13:33:53,053 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 13:33:53,053 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-01-24 13:33:53,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 13:33:53,054 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:33:53,054 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:33:53,054 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 13:33:53,055 INFO L82 PathProgramCache]: Analyzing trace with hash 220833638, now seen corresponding path program 1 times [2018-01-24 13:33:53,055 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:33:53,057 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:33:53,057 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:33:53,057 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:33:53,057 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:33:53,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:33:53,075 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:33:53,136 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 13:33:53,136 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:33:53,136 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 13:33:53,143 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:33:53,143 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:33:53,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:33:53,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:33:53,144 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 5 states. [2018-01-24 13:33:53,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:33:53,162 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-01-24 13:33:53,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:33:53,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-24 13:33:53,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:33:53,164 INFO L225 Difference]: With dead ends: 33 [2018-01-24 13:33:53,164 INFO L226 Difference]: Without dead ends: 32 [2018-01-24 13:33:53,164 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:33:53,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-01-24 13:33:53,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-01-24 13:33:53,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-01-24 13:33:53,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-01-24 13:33:53,171 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 20 [2018-01-24 13:33:53,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:33:53,171 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-01-24 13:33:53,171 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:33:53,172 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-01-24 13:33:53,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 13:33:53,172 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:33:53,173 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:33:53,173 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 13:33:53,173 INFO L82 PathProgramCache]: Analyzing trace with hash 220833639, now seen corresponding path program 1 times [2018-01-24 13:33:53,173 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:33:53,175 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:33:53,176 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:33:53,176 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:33:53,176 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:33:53,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:33:53,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:33:53,229 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 13:33:53,229 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:33:53,229 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 13:33:53,230 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:33:53,230 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:33:53,230 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:33:53,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:33:53,230 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 5 states. [2018-01-24 13:33:53,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:33:53,242 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-01-24 13:33:53,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:33:53,243 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-24 13:33:53,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:33:53,244 INFO L225 Difference]: With dead ends: 37 [2018-01-24 13:33:53,244 INFO L226 Difference]: Without dead ends: 36 [2018-01-24 13:33:53,244 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:33:53,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-24 13:33:53,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2018-01-24 13:33:53,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-01-24 13:33:53,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-01-24 13:33:53,250 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 20 [2018-01-24 13:33:53,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:33:53,250 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-01-24 13:33:53,251 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:33:53,251 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-01-24 13:33:53,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 13:33:53,251 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:33:53,252 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:33:53,252 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 13:33:53,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1744091818, now seen corresponding path program 1 times [2018-01-24 13:33:53,252 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:33:53,253 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:33:53,253 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:33:53,254 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:33:53,254 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:33:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:33:53,268 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:33:53,347 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 13:33:53,347 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:33:53,347 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 13:33:53,359 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:33:53,359 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:33:53,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:33:53,397 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:33:53,588 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 13:33:53,589 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:33:53,694 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 13:33:53,716 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:33:53,716 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:33:53,721 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:33:53,721 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:33:53,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:33:53,758 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:33:53,763 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 13:33:53,763 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:33:53,794 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 13:33:53,795 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:33:53,796 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4, 4, 4] total 8 [2018-01-24 13:33:53,796 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:33:53,796 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 13:33:53,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 13:33:53,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:33:53,797 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 8 states. [2018-01-24 13:33:53,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:33:53,814 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2018-01-24 13:33:53,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:33:53,815 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-01-24 13:33:53,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:33:53,816 INFO L225 Difference]: With dead ends: 55 [2018-01-24 13:33:53,816 INFO L226 Difference]: Without dead ends: 31 [2018-01-24 13:33:53,817 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:33:53,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-01-24 13:33:53,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-01-24 13:33:53,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-01-24 13:33:53,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-01-24 13:33:53,822 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 21 [2018-01-24 13:33:53,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:33:53,823 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-01-24 13:33:53,823 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 13:33:53,823 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-01-24 13:33:53,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 13:33:53,824 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:33:53,824 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 13:33:53,824 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 13:33:53,824 INFO L82 PathProgramCache]: Analyzing trace with hash -102655212, now seen corresponding path program 1 times [2018-01-24 13:33:53,824 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:33:53,826 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:33:53,826 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:33:53,826 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:33:53,826 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:33:53,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:33:53,843 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:33:53,893 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 13:33:53,893 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:33:53,893 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:33:53,903 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:33:53,903 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:33:53,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:33:53,934 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:33:53,961 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 13:33:53,962 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:33:54,028 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 13:33:54,050 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:33:54,050 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 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 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:33:54,054 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:33:54,054 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:33:54,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:33:54,090 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:33:54,105 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 13:33:54,106 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:33:54,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 13:33:54,224 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:33:54,225 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5] total 5 [2018-01-24 13:33:54,225 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:33:54,225 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 13:33:54,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 13:33:54,226 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 13:33:54,226 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 6 states. [2018-01-24 13:33:54,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:33:54,266 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-01-24 13:33:54,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 13:33:54,270 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-24 13:33:54,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:33:54,271 INFO L225 Difference]: With dead ends: 31 [2018-01-24 13:33:54,271 INFO L226 Difference]: Without dead ends: 30 [2018-01-24 13:33:54,272 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 80 SyntacticMatches, 12 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:33:54,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-01-24 13:33:54,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-01-24 13:33:54,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-01-24 13:33:54,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-01-24 13:33:54,277 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 23 [2018-01-24 13:33:54,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:33:54,277 INFO L432 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-01-24 13:33:54,278 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 13:33:54,278 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-01-24 13:33:54,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 13:33:54,279 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:33:54,279 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 13:33:54,279 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 13:33:54,280 INFO L82 PathProgramCache]: Analyzing trace with hash -102655211, now seen corresponding path program 1 times [2018-01-24 13:33:54,280 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:33:54,281 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:33:54,281 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:33:54,282 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:33:54,282 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:33:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:33:54,295 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:33:54,454 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 13:33:54,454 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:33:54,454 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:33:54,460 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:33:54,460 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:33:54,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:33:54,484 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:33:54,504 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 13:33:54,506 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:33:54,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:33:54,508 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 13:33:54,558 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 13:33:54,558 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:33:54,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-01-24 13:33:54,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:33:54,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:33:54,571 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:9 [2018-01-24 13:33:54,701 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 13:33:54,724 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:33:54,724 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 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 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:33:54,728 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:33:54,728 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:33:54,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:33:54,766 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:33:54,775 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 13:33:54,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:33:54,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:33:54,790 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 13:33:54,817 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 13:33:54,817 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:33:54,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-01-24 13:33:54,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:33:54,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:33:54,831 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:9 [2018-01-24 13:33:54,910 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 13:33:54,912 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:33:54,912 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 9] total 11 [2018-01-24 13:33:54,912 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:33:54,913 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 13:33:54,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 13:33:54,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=103, Unknown=1, NotChecked=0, Total=132 [2018-01-24 13:33:54,913 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 10 states. [2018-01-24 13:33:54,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:33:54,983 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2018-01-24 13:33:54,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 13:33:54,984 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-01-24 13:33:54,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:33:54,985 INFO L225 Difference]: With dead ends: 32 [2018-01-24 13:33:54,985 INFO L226 Difference]: Without dead ends: 31 [2018-01-24 13:33:54,985 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 81 SyntacticMatches, 9 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=123, Unknown=1, NotChecked=0, Total=156 [2018-01-24 13:33:54,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-01-24 13:33:54,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-01-24 13:33:54,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-01-24 13:33:54,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-01-24 13:33:54,991 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 23 [2018-01-24 13:33:54,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:33:54,991 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-01-24 13:33:54,991 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 13:33:54,992 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-01-24 13:33:54,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 13:33:54,992 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:33:54,993 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:33:54,993 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 13:33:54,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1670341786, now seen corresponding path program 1 times [2018-01-24 13:33:54,993 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:33:54,994 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:33:54,994 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:33:54,995 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:33:54,995 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:33:55,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:33:55,006 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:33:55,075 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 13:33:55,075 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:33:55,075 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 13:33:55,076 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:33:55,076 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 13:33:55,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 13:33:55,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 13:33:55,076 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 6 states. [2018-01-24 13:33:55,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:33:55,091 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-01-24 13:33:55,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 13:33:55,091 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-24 13:33:55,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:33:55,092 INFO L225 Difference]: With dead ends: 31 [2018-01-24 13:33:55,093 INFO L226 Difference]: Without dead ends: 30 [2018-01-24 13:33:55,093 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:33:55,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-01-24 13:33:55,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-01-24 13:33:55,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-01-24 13:33:55,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-01-24 13:33:55,096 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 24 [2018-01-24 13:33:55,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:33:55,097 INFO L432 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-01-24 13:33:55,097 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 13:33:55,097 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-01-24 13:33:55,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 13:33:55,097 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:33:55,098 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:33:55,098 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 13:33:55,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1670341785, now seen corresponding path program 1 times [2018-01-24 13:33:55,098 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:33:55,099 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:33:55,099 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:33:55,099 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:33:55,099 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:33:55,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:33:55,110 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:33:55,225 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 13:33:55,225 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:33:55,225 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 13:33:55,225 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:33:55,226 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 13:33:55,226 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 13:33:55,226 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 13:33:55,226 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 6 states. [2018-01-24 13:33:55,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:33:55,309 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-01-24 13:33:55,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:33:55,310 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-24 13:33:55,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:33:55,311 INFO L225 Difference]: With dead ends: 30 [2018-01-24 13:33:55,311 INFO L226 Difference]: Without dead ends: 29 [2018-01-24 13:33:55,311 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:33:55,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-01-24 13:33:55,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-01-24 13:33:55,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-01-24 13:33:55,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-01-24 13:33:55,316 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 24 [2018-01-24 13:33:55,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:33:55,316 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-01-24 13:33:55,316 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 13:33:55,316 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-01-24 13:33:55,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 13:33:55,317 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:33:55,317 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:33:55,317 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 13:33:55,317 INFO L82 PathProgramCache]: Analyzing trace with hash -240987817, now seen corresponding path program 1 times [2018-01-24 13:33:55,318 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:33:55,319 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:33:55,319 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:33:55,319 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:33:55,319 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:33:55,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:33:55,339 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:33:55,572 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:33:55,572 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:33:55,572 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 13:33:55,580 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:33:55,580 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:33:55,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:33:55,598 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:33:55,602 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 13:33:55,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:33:55,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:33:55,604 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 13:33:55,666 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:33:55,667 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:33:55,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-24 13:33:55,668 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:33:55,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:33:55,674 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:19 [2018-01-24 13:33:55,719 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:33:55,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-01-24 13:33:55,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:33:55,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 13:33:55,728 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:15 [2018-01-24 13:33:55,748 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:33:55,748 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:33:55,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2018-01-24 13:33:55,752 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:33:55,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:33:55,755 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2018-01-24 13:33:55,861 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 36 [2018-01-24 13:34:08,103 WARN L146 SmtUtils]: Spent 12165ms on a formula simplification. DAG size of input: 72 DAG size of output 69 [2018-01-24 13:34:08,115 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2018-01-24 13:34:08,133 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2018-01-24 13:34:14,239 WARN L143 SmtUtils]: Spent 6042ms on a formula simplification that was a NOOP. DAG size: 69 [2018-01-24 13:34:14,247 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 20 [2018-01-24 13:34:14,309 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 20 [2018-01-24 13:34:14,318 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 20 [2018-01-24 13:34:14,438 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:34:14,471 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-01-24 13:34:14,472 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [10, 11] total 22 [2018-01-24 13:34:14,472 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:34:14,472 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 13:34:14,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 13:34:14,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2018-01-24 13:34:14,473 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 12 states. [2018-01-24 13:34:14,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:34:14,574 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-01-24 13:34:14,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 13:34:14,575 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2018-01-24 13:34:14,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:34:14,577 INFO L225 Difference]: With dead ends: 29 [2018-01-24 13:34:14,577 INFO L226 Difference]: Without dead ends: 28 [2018-01-24 13:34:14,577 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2018-01-24 13:34:14,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-01-24 13:34:14,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2018-01-24 13:34:14,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-01-24 13:34:14,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-01-24 13:34:14,580 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 25 [2018-01-24 13:34:14,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:34:14,581 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-01-24 13:34:14,581 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 13:34:14,581 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-01-24 13:34:14,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 13:34:14,582 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:34:14,582 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] [2018-01-24 13:34:14,582 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr3RequiresViolation]=== [2018-01-24 13:34:14,582 INFO L82 PathProgramCache]: Analyzing trace with hash -184703786, now seen corresponding path program 1 times [2018-01-24 13:34:14,582 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:34:14,583 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:34:14,583 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:34:14,583 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:34:14,583 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:34:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:34:14,594 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:34:14,783 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 13:34:14,783 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:34:14,783 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:34:14,789 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:34:14,789 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:34:14,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:34:14,806 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:34:14,988 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 13:34:14,988 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:34:15,151 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_4| term size 19 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 13:34:15,154 INFO L168 Benchmark]: Toolchain (without parser) took 23281.48 ms. Allocated memory was 303.0 MB in the beginning and 514.3 MB in the end (delta: 211.3 MB). Free memory was 262.1 MB in the beginning and 449.8 MB in the end (delta: -187.7 MB). Peak memory consumption was 23.6 MB. Max. memory is 5.3 GB. [2018-01-24 13:34:15,155 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 303.0 MB. Free memory is still 269.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 13:34:15,156 INFO L168 Benchmark]: CACSL2BoogieTranslator took 210.35 ms. Allocated memory is still 303.0 MB. Free memory was 262.1 MB in the beginning and 249.9 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 5.3 GB. [2018-01-24 13:34:15,156 INFO L168 Benchmark]: Boogie Preprocessor took 31.92 ms. Allocated memory is still 303.0 MB. Free memory was 249.9 MB in the beginning and 247.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 13:34:15,156 INFO L168 Benchmark]: RCFGBuilder took 196.88 ms. Allocated memory is still 303.0 MB. Free memory was 247.9 MB in the beginning and 234.4 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 5.3 GB. [2018-01-24 13:34:15,157 INFO L168 Benchmark]: TraceAbstraction took 22835.02 ms. Allocated memory was 303.0 MB in the beginning and 514.3 MB in the end (delta: 211.3 MB). Free memory was 234.4 MB in the beginning and 449.8 MB in the end (delta: -215.5 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 13:34:15,159 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.11 ms. Allocated memory is still 303.0 MB. Free memory is still 269.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 210.35 ms. Allocated memory is still 303.0 MB. Free memory was 262.1 MB in the beginning and 249.9 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.92 ms. Allocated memory is still 303.0 MB. Free memory was 249.9 MB in the beginning and 247.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 196.88 ms. Allocated memory is still 303.0 MB. Free memory was 247.9 MB in the beginning and 234.4 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 22835.02 ms. Allocated memory was 303.0 MB in the beginning and 514.3 MB in the end (delta: 211.3 MB). Free memory was 234.4 MB in the beginning and 449.8 MB in the end (delta: -215.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_4| term size 19 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_old(#valid)_BEFORE_CALL_4| term size 19: 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/memleaks_test4_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_13-34-15-166.csv Received shutdown request...