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_Taipan+AI_EQ_imprecise.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_3_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 17:21:06,789 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 17:21:06,791 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 17:21:06,804 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 17:21:06,804 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 17:21:06,805 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 17:21:06,806 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 17:21:06,808 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 17:21:06,810 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 17:21:06,810 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 17:21:06,811 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 17:21:06,811 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 17:21:06,812 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 17:21:06,813 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 17:21:06,813 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 17:21:06,816 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 17:21:06,818 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 17:21:06,820 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 17:21:06,821 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 17:21:06,822 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 17:21:06,825 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 17:21:06,825 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 17:21:06,825 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 17:21:06,826 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 17:21:06,827 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 17:21:06,828 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 17:21:06,828 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 17:21:06,829 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 17:21:06,829 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 17:21:06,829 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 17:21:06,830 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 17:21:06,830 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf [2018-01-24 17:21:06,840 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 17:21:06,840 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 17:21:06,841 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 17:21:06,841 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 17:21:06,841 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 17:21:06,841 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-24 17:21:06,842 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 17:21:06,842 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 17:21:06,842 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 17:21:06,843 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 17:21:06,843 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 17:21:06,843 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 17:21:06,843 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 17:21:06,843 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 17:21:06,843 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 17:21:06,844 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 17:21:06,844 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 17:21:06,844 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 17:21:06,844 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 17:21:06,844 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 17:21:06,845 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 17:21:06,845 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 17:21:06,845 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 17:21:06,845 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 17:21:06,845 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 17:21:06,845 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 17:21:06,846 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 17:21:06,846 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 17:21:06,846 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 17:21:06,846 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 17:21:06,846 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 17:21:06,847 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 17:21:06,847 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 17:21:06,847 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 17:21:06,848 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 17:21:06,848 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 17:21:06,881 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 17:21:06,893 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 17:21:06,897 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 17:21:06,899 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 17:21:06,899 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 17:21:06,900 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test18_3_false-valid-memtrack_true-termination.i [2018-01-24 17:21:07,077 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 17:21:07,083 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 17:21:07,084 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 17:21:07,084 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 17:21:07,089 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 17:21:07,090 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:21:07" (1/1) ... [2018-01-24 17:21:07,093 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aeadb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:21:07, skipping insertion in model container [2018-01-24 17:21:07,093 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 05:21:07" (1/1) ... [2018-01-24 17:21:07,110 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 17:21:07,161 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 17:21:07,268 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 17:21:07,282 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 17:21:07,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:21:07 WrapperNode [2018-01-24 17:21:07,288 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 17:21:07,288 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 17:21:07,288 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 17:21:07,288 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 17:21:07,302 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:21:07" (1/1) ... [2018-01-24 17:21:07,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:21:07" (1/1) ... [2018-01-24 17:21:07,312 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:21:07" (1/1) ... [2018-01-24 17:21:07,313 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:21:07" (1/1) ... [2018-01-24 17:21:07,317 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:21:07" (1/1) ... [2018-01-24 17:21:07,320 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:21:07" (1/1) ... [2018-01-24 17:21:07,320 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:21:07" (1/1) ... [2018-01-24 17:21:07,322 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 17:21:07,322 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 17:21:07,322 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 17:21:07,322 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 17:21:07,323 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:21:07" (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 17:21:07,369 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 17:21:07,369 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 17:21:07,369 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-24 17:21:07,369 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 17:21:07,370 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 17:21:07,370 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 17:21:07,370 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 17:21:07,370 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 17:21:07,370 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 17:21:07,370 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 17:21:07,370 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 17:21:07,370 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 17:21:07,370 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-24 17:21:07,370 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 17:21:07,371 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 17:21:07,371 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 17:21:07,371 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 17:21:07,511 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 17:21:07,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:21:07 BoogieIcfgContainer [2018-01-24 17:21:07,512 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 17:21:07,513 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 17:21:07,513 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 17:21:07,514 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 17:21:07,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 05:21:07" (1/3) ... [2018-01-24 17:21:07,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aefe911 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:21:07, skipping insertion in model container [2018-01-24 17:21:07,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 05:21:07" (2/3) ... [2018-01-24 17:21:07,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aefe911 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 05:21:07, skipping insertion in model container [2018-01-24 17:21:07,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 05:21:07" (3/3) ... [2018-01-24 17:21:07,517 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test18_3_false-valid-memtrack_true-termination.i [2018-01-24 17:21:07,523 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 17:21:07,528 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-24 17:21:07,568 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 17:21:07,569 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 17:21:07,569 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 17:21:07,569 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 17:21:07,569 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 17:21:07,569 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 17:21:07,570 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 17:21:07,570 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 17:21:07,571 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 17:21:07,587 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-01-24 17:21:07,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 17:21:07,592 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:21:07,593 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:21:07,593 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 17:21:07,599 INFO L82 PathProgramCache]: Analyzing trace with hash -144006031, now seen corresponding path program 1 times [2018-01-24 17:21:07,601 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:21:07,650 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:21:07,650 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:21:07,650 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:21:07,650 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:21:07,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:21:07,703 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:21:07,778 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 17:21:07,780 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:21:07,780 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 17:21:07,780 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:21:07,782 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 17:21:07,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 17:21:07,793 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 17:21:07,795 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 3 states. [2018-01-24 17:21:07,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:21:07,956 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2018-01-24 17:21:07,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 17:21:07,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-24 17:21:07,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:21:07,965 INFO L225 Difference]: With dead ends: 53 [2018-01-24 17:21:07,966 INFO L226 Difference]: Without dead ends: 40 [2018-01-24 17:21:07,968 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 17:21:07,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-24 17:21:07,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-01-24 17:21:07,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-24 17:21:08,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2018-01-24 17:21:08,001 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 17 [2018-01-24 17:21:08,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:21:08,001 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2018-01-24 17:21:08,001 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 17:21:08,001 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2018-01-24 17:21:08,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 17:21:08,003 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:21:08,003 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:21:08,003 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 17:21:08,004 INFO L82 PathProgramCache]: Analyzing trace with hash -716261389, now seen corresponding path program 1 times [2018-01-24 17:21:08,004 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:21:08,006 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:21:08,006 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:21:08,006 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:21:08,006 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:21:08,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:21:08,028 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:21:08,090 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 17:21:08,090 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:21:08,091 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 17:21:08,091 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:21:08,092 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 17:21:08,093 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 17:21:08,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 17:21:08,093 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 6 states. [2018-01-24 17:21:08,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:21:08,166 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2018-01-24 17:21:08,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 17:21:08,166 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-24 17:21:08,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:21:08,168 INFO L225 Difference]: With dead ends: 52 [2018-01-24 17:21:08,168 INFO L226 Difference]: Without dead ends: 48 [2018-01-24 17:21:08,169 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 17:21:08,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-24 17:21:08,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2018-01-24 17:21:08,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-24 17:21:08,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-01-24 17:21:08,178 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 19 [2018-01-24 17:21:08,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:21:08,179 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-01-24 17:21:08,179 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 17:21:08,179 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-01-24 17:21:08,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-24 17:21:08,180 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:21:08,180 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:21:08,180 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 17:21:08,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1119113233, now seen corresponding path program 1 times [2018-01-24 17:21:08,181 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:21:08,182 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:21:08,182 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:21:08,183 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:21:08,183 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:21:08,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:21:08,201 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:21:08,271 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 17:21:08,271 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 17:21:08,271 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 17:21:08,272 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:21:08,272 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 17:21:08,272 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 17:21:08,272 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-24 17:21:08,273 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 4 states. [2018-01-24 17:21:08,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:21:08,306 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2018-01-24 17:21:08,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 17:21:08,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-01-24 17:21:08,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:21:08,307 INFO L225 Difference]: With dead ends: 56 [2018-01-24 17:21:08,307 INFO L226 Difference]: Without dead ends: 52 [2018-01-24 17:21:08,308 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-24 17:21:08,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-24 17:21:08,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 40. [2018-01-24 17:21:08,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-24 17:21:08,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2018-01-24 17:21:08,317 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 21 [2018-01-24 17:21:08,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:21:08,318 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2018-01-24 17:21:08,318 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 17:21:08,318 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2018-01-24 17:21:08,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 17:21:08,319 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:21:08,319 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:21:08,319 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 17:21:08,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1380395530, now seen corresponding path program 1 times [2018-01-24 17:21:08,320 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:21:08,321 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:21:08,321 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:21:08,321 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:21:08,321 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:21:08,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:21:08,334 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:21:08,383 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 17:21:08,383 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:21:08,383 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:21:08,384 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-01-24 17:21:08,386 INFO L201 CegarAbsIntRunner]: [0], [6], [7], [8], [9], [16], [18], [22], [26], [31], [33], [35], [43], [44], [45], [47], [49], [50], [51], [52] [2018-01-24 17:21:08,425 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:21:08,425 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:21:08,519 INFO L262 AbstractInterpreter]: Error location(s) were unreachable [2018-01-24 17:21:08,521 INFO L268 AbstractInterpreter]: Visited 14 different actions 14 times. Never merged. Never widened. Never found a fixpoint. Largest state had 16 variables. [2018-01-24 17:21:08,533 INFO L395 sIntCurrentIteration]: Generating AbsInt predicates [2018-01-24 17:21:08,587 INFO L232 lantSequenceWeakener]: Weakened 13 states. On average, predicates are now at 65.79% of their original sizes. [2018-01-24 17:21:08,588 INFO L408 sIntCurrentIteration]: Unifying AI predicates [2018-01-24 17:21:08,622 INFO L419 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-01-24 17:21:08,623 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 17:21:08,623 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2018-01-24 17:21:08,624 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 17:21:08,624 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 17:21:08,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 17:21:08,624 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:21:08,625 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand 7 states. [2018-01-24 17:21:08,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:21:08,992 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-01-24 17:21:08,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 17:21:08,993 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-01-24 17:21:08,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:21:08,994 INFO L225 Difference]: With dead ends: 60 [2018-01-24 17:21:08,994 INFO L226 Difference]: Without dead ends: 32 [2018-01-24 17:21:08,995 INFO L525 BasicCegarLoop]: 2 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 17:21:08,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-01-24 17:21:08,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-01-24 17:21:09,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-01-24 17:21:09,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-01-24 17:21:09,001 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 23 [2018-01-24 17:21:09,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:21:09,001 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-01-24 17:21:09,001 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 17:21:09,001 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-01-24 17:21:09,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 17:21:09,002 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:21:09,002 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] [2018-01-24 17:21:09,002 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 17:21:09,003 INFO L82 PathProgramCache]: Analyzing trace with hash 679154700, now seen corresponding path program 1 times [2018-01-24 17:21:09,003 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:21:09,004 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:21:09,004 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:21:09,004 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:21:09,004 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:21:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:21:09,019 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:21:09,077 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 17:21:09,077 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:21:09,078 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:21:09,078 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-01-24 17:21:09,078 INFO L201 CegarAbsIntRunner]: [0], [3], [4], [5], [6], [7], [8], [9], [16], [18], [22], [26], [31], [33], [35], [43], [44], [45], [47], [49], [50], [51], [52] [2018-01-24 17:21:09,079 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:21:09,079 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:21:09,179 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:21:09,180 INFO L268 AbstractInterpreter]: Visited 23 different actions 37 times. Merged at 6 different actions 8 times. Never widened. Never found a fixpoint. Largest state had 18 variables. [2018-01-24 17:21:09,194 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:21:09,195 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:21:09,195 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 17:21:09,206 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:21:09,206 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:21:09,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:21:09,242 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:21:09,273 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 17:21:09,275 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:21:09,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:21:09,280 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 17:21:09,305 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 17:21:09,306 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:21:09,398 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 17:21:09,418 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:21:09,418 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 17:21:09,422 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:21:09,422 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:21:09,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:21:09,461 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:21:09,470 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 17:21:09,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:21:09,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:21:09,471 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 17:21:09,486 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 17:21:09,486 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:21:09,554 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 17:21:09,556 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:21:09,556 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6] total 7 [2018-01-24 17:21:09,556 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:21:09,557 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 17:21:09,557 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 17:21:09,557 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-24 17:21:09,557 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 7 states. [2018-01-24 17:21:09,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:21:09,656 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-01-24 17:21:09,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 17:21:09,656 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-01-24 17:21:09,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:21:09,659 INFO L225 Difference]: With dead ends: 36 [2018-01-24 17:21:09,660 INFO L226 Difference]: Without dead ends: 35 [2018-01-24 17:21:09,660 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 90 SyntacticMatches, 9 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-24 17:21:09,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-01-24 17:21:09,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-01-24 17:21:09,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-24 17:21:09,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-01-24 17:21:09,666 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 25 [2018-01-24 17:21:09,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:21:09,666 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-01-24 17:21:09,666 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 17:21:09,667 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-01-24 17:21:09,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 17:21:09,668 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:21:09,668 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] [2018-01-24 17:21:09,668 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 17:21:09,668 INFO L82 PathProgramCache]: Analyzing trace with hash 679154701, now seen corresponding path program 1 times [2018-01-24 17:21:09,668 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:21:09,670 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:21:09,670 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:21:09,670 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:21:09,670 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:21:09,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:21:09,687 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:21:10,003 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:21:10,004 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:21:10,004 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:21:10,004 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-01-24 17:21:10,004 INFO L201 CegarAbsIntRunner]: [0], [3], [4], [5], [6], [7], [8], [9], [16], [18], [22], [26], [31], [33], [36], [43], [44], [45], [47], [49], [50], [51], [52] [2018-01-24 17:21:10,005 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:21:10,005 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:21:10,100 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:21:10,101 INFO L268 AbstractInterpreter]: Visited 23 different actions 37 times. Merged at 7 different actions 9 times. Never widened. Never found a fixpoint. Largest state had 18 variables. [2018-01-24 17:21:10,121 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:21:10,121 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:21:10,121 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 17:21:10,133 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:21:10,133 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:21:10,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:21:10,158 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:21:10,189 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 17 treesize of output 16 [2018-01-24 17:21:10,190 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:21:10,216 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 20 treesize of output 19 [2018-01-24 17:21:10,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:21:10,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:21:10,234 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-24 17:21:10,443 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:21:10,443 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:21:13,219 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:21:13,239 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:21:13,239 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 17:21:13,243 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:21:13,243 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:21:13,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:21:13,278 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:21:13,289 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 20 treesize of output 19 [2018-01-24 17:21:13,289 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:21:13,318 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 17 treesize of output 16 [2018-01-24 17:21:13,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:21:13,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:21:13,337 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-24 17:21:13,428 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:21:13,429 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:21:16,609 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:21:16,611 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:21:16,611 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8] total 20 [2018-01-24 17:21:16,611 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:21:16,611 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 17:21:16,612 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 17:21:16,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=364, Unknown=3, NotChecked=0, Total=420 [2018-01-24 17:21:16,612 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 14 states. [2018-01-24 17:21:16,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:21:16,867 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-01-24 17:21:16,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 17:21:16,867 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2018-01-24 17:21:16,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:21:16,869 INFO L225 Difference]: With dead ends: 39 [2018-01-24 17:21:16,869 INFO L226 Difference]: Without dead ends: 38 [2018-01-24 17:21:16,869 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 77 SyntacticMatches, 12 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=100, Invalid=599, Unknown=3, NotChecked=0, Total=702 [2018-01-24 17:21:16,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-24 17:21:16,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-01-24 17:21:16,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-24 17:21:16,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2018-01-24 17:21:16,877 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 25 [2018-01-24 17:21:16,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:21:16,877 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2018-01-24 17:21:16,878 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 17:21:16,878 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-01-24 17:21:16,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 17:21:16,879 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:21:16,879 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, 1, 1] [2018-01-24 17:21:16,879 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 17:21:16,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1335043850, now seen corresponding path program 1 times [2018-01-24 17:21:16,879 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:21:16,881 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:21:16,881 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:21:16,881 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:21:16,882 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:21:16,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:21:16,898 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:21:17,023 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:21:17,023 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:21:17,023 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:21:17,023 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-01-24 17:21:17,024 INFO L201 CegarAbsIntRunner]: [0], [3], [4], [5], [7], [8], [9], [16], [18], [22], [26], [31], [33], [35], [43], [44], [45], [47], [49], [50], [51], [52] [2018-01-24 17:21:17,025 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:21:17,025 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:21:17,062 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:21:17,062 INFO L268 AbstractInterpreter]: Visited 22 different actions 27 times. Never merged. Never widened. Never found a fixpoint. Largest state had 18 variables. [2018-01-24 17:21:17,063 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:21:17,063 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:21:17,063 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 17:21:17,086 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:21:17,086 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:21:17,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:21:17,105 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:21:17,112 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 17:21:17,113 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:21:17,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:21:17,121 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 17:21:17,148 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:21:17,149 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:21:17,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-24 17:21:17,150 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:21:17,178 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 17:21:17,178 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-01-24 17:21:17,195 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 17:21:17,195 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:21:18,026 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 17:21:18,057 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:21:18,059 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 17:21:18,064 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:21:18,064 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:21:18,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:21:18,105 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:21:18,108 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 17:21:18,108 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:21:18,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:21:18,109 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 17:21:18,129 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:21:18,140 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:21:18,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-24 17:21:18,141 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:21:18,148 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 17:21:18,148 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-01-24 17:21:18,150 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 17:21:18,151 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:21:18,451 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (7)] Exception during sending of exit command (exit): Broken pipe [2018-01-24 17:21:18,453 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:21:18,453 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8] total 16 [2018-01-24 17:21:18,453 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:21:18,453 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 17:21:18,453 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 17:21:18,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=223, Unknown=1, NotChecked=0, Total=272 [2018-01-24 17:21:18,454 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 11 states. [2018-01-24 17:21:18,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:21:18,629 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-01-24 17:21:18,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 17:21:18,629 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2018-01-24 17:21:18,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:21:18,630 INFO L225 Difference]: With dead ends: 48 [2018-01-24 17:21:18,630 INFO L226 Difference]: Without dead ends: 47 [2018-01-24 17:21:18,631 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 92 SyntacticMatches, 8 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=85, Invalid=334, Unknown=1, NotChecked=0, Total=420 [2018-01-24 17:21:18,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-24 17:21:18,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2018-01-24 17:21:18,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-24 17:21:18,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-01-24 17:21:18,636 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 27 [2018-01-24 17:21:18,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:21:18,636 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-01-24 17:21:18,637 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 17:21:18,637 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-01-24 17:21:18,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-24 17:21:18,637 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:21:18,637 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, 1, 1] [2018-01-24 17:21:18,637 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 17:21:18,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1335043851, now seen corresponding path program 1 times [2018-01-24 17:21:18,638 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:21:18,638 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:21:18,638 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:21:18,639 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:21:18,639 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:21:18,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:21:18,649 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:21:18,880 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:21:18,881 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:21:18,881 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:21:18,881 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-01-24 17:21:18,881 INFO L201 CegarAbsIntRunner]: [0], [3], [4], [5], [7], [8], [9], [16], [18], [22], [26], [31], [33], [36], [43], [44], [45], [47], [49], [50], [51], [52] [2018-01-24 17:21:18,882 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:21:18,882 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:21:18,916 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:21:18,916 INFO L268 AbstractInterpreter]: Visited 22 different actions 27 times. Never merged. Never widened. Never found a fixpoint. Largest state had 18 variables. [2018-01-24 17:21:18,918 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:21:18,918 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:21:18,918 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 17:21:18,925 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:21:18,925 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:21:18,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:21:18,944 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:21:18,963 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 23 treesize of output 22 [2018-01-24 17:21:18,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:21:18,982 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 26 treesize of output 25 [2018-01-24 17:21:18,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:21:18,984 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 22 treesize of output 21 [2018-01-24 17:21:18,984 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 17:21:18,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-01-24 17:21:18,999 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:21:19,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:21:19,011 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-24 17:21:19,185 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:21:19,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 55 [2018-01-24 17:21:19,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:21:19,243 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:21:19,244 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:21:19,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 60 [2018-01-24 17:21:19,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:21:19,293 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:21:19,294 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:21:19,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-01-24 17:21:19,295 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 17:21:19,336 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:21:19,337 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:21:19,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2018-01-24 17:21:19,337 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:21:19,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-01-24 17:21:19,369 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-24 17:21:19,456 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:21:19,456 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:21:19,572 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 27 [2018-01-24 17:21:24,109 WARN L146 SmtUtils]: Spent 4423ms on a formula simplification. DAG size of input: 84 DAG size of output 31 [2018-01-24 17:21:24,118 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-24 17:21:28,379 WARN L143 SmtUtils]: Spent 4161ms on a formula simplification that was a NOOP. DAG size: 73 [2018-01-24 17:21:28,386 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-24 17:21:28,398 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-24 17:21:28,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 34 treesize of output 37 [2018-01-24 17:21:28,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-01-24 17:21:28,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:21:28,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:21:28,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-24 17:21:28,602 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 17:21:28,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-24 17:21:28,615 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:21:28,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:21:28,626 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:86, output treesize:15 [2018-01-24 17:21:29,926 WARN L143 SmtUtils]: Spent 254ms on a formula simplification that was a NOOP. DAG size: 51 [2018-01-24 17:21:30,183 WARN L146 SmtUtils]: Spent 252ms on a formula simplification. DAG size of input: 57 DAG size of output 49 [2018-01-24 17:21:30,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-01-24 17:21:30,186 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:21:30,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-01-24 17:21:30,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:21:30,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 46 treesize of output 49 [2018-01-24 17:21:30,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2018-01-24 17:21:30,282 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:21:30,293 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:21:30,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 17:21:30,322 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:118, output treesize:53 [2018-01-24 17:21:30,435 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:21:30,456 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:21:30,456 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 17:21:30,459 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:21:30,459 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:21:30,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:21:30,496 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:21:30,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 23 treesize of output 22 [2018-01-24 17:21:30,505 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:21:30,519 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 22 treesize of output 21 [2018-01-24 17:21:30,519 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:21:30,520 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 26 treesize of output 25 [2018-01-24 17:21:30,520 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 17:21:30,534 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 25 treesize of output 24 [2018-01-24 17:21:30,535 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:21:30,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:21:30,547 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-24 17:21:30,665 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:21:30,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 55 [2018-01-24 17:21:30,668 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:21:30,738 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:21:30,739 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:21:30,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2018-01-24 17:21:30,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:21:30,797 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:21:30,798 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:21:30,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 60 [2018-01-24 17:21:30,799 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 17:21:30,863 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:21:30,864 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:21:30,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-01-24 17:21:30,864 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:21:30,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-01-24 17:21:30,964 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-24 17:21:31,014 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:21:31,014 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:21:31,085 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-01-24 17:21:35,386 WARN L146 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 80 DAG size of output 31 [2018-01-24 17:21:35,394 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-24 17:21:43,575 WARN L143 SmtUtils]: Spent 4027ms on a formula simplification that was a NOOP. DAG size: 73 [2018-01-24 17:21:43,580 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-24 17:21:43,598 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2018-01-24 17:21:43,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-01-24 17:21:43,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:21:43,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 28 treesize of output 31 [2018-01-24 17:21:43,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-01-24 17:21:43,751 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 17:21:43,755 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:21:43,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-24 17:21:43,767 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:21:43,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:21:43,779 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:86, output treesize:15 [2018-01-24 17:21:44,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-01-24 17:21:44,224 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:21:44,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-01-24 17:21:44,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:21:44,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 46 treesize of output 49 [2018-01-24 17:21:44,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2018-01-24 17:21:44,300 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:21:44,310 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 17:21:44,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-01-24 17:21:44,336 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:118, output treesize:53 [2018-01-24 17:21:44,430 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:21:44,431 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:21:44,431 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10, 10, 10] total 30 [2018-01-24 17:21:44,431 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:21:44,432 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-24 17:21:44,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-24 17:21:44,432 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=839, Unknown=5, NotChecked=0, Total=930 [2018-01-24 17:21:44,432 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 20 states. [2018-01-24 17:21:44,799 WARN L146 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 67 DAG size of output 64 [2018-01-24 17:22:03,746 WARN L143 SmtUtils]: Spent 137ms on a formula simplification that was a NOOP. DAG size: 51 [2018-01-24 17:22:06,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:22:06,023 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-01-24 17:22:06,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 17:22:06,023 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 27 [2018-01-24 17:22:06,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:22:06,024 INFO L225 Difference]: With dead ends: 50 [2018-01-24 17:22:06,024 INFO L226 Difference]: Without dead ends: 49 [2018-01-24 17:22:06,025 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 77 SyntacticMatches, 13 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 30.8s TimeCoverageRelationStatistics Valid=187, Invalid=1365, Unknown=8, NotChecked=0, Total=1560 [2018-01-24 17:22:06,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-24 17:22:06,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2018-01-24 17:22:06,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-24 17:22:06,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-01-24 17:22:06,032 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 27 [2018-01-24 17:22:06,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:22:06,033 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-01-24 17:22:06,033 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-24 17:22:06,033 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-01-24 17:22:06,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 17:22:06,034 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:22:06,034 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:22:06,034 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 17:22:06,034 INFO L82 PathProgramCache]: Analyzing trace with hash 622132427, now seen corresponding path program 1 times [2018-01-24 17:22:06,034 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:22:06,035 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:22:06,036 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:22:06,036 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:22:06,036 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:22:06,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:22:06,045 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:22:06,079 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 17:22:06,080 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:22:06,080 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:22:06,080 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-01-24 17:22:06,080 INFO L201 CegarAbsIntRunner]: [0], [3], [4], [5], [6], [7], [8], [9], [15], [16], [18], [22], [26], [29], [31], [33], [34], [38], [42], [43], [44], [45], [47], [48], [49], [50], [51], [52] [2018-01-24 17:22:06,082 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:22:06,082 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:22:06,232 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:22:06,232 INFO L268 AbstractInterpreter]: Visited 28 different actions 80 times. Merged at 12 different actions 30 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 23 variables. [2018-01-24 17:22:06,235 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:22:06,235 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:22:06,235 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 17:22:06,254 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:22:06,254 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:22:06,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:22:06,273 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:22:06,415 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 17:22:06,415 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:22:06,446 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 17:22:06,465 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:22:06,465 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 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 11 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 17:22:06,468 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:22:06,468 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:22:06,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:22:06,492 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:22:06,495 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 17:22:06,495 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:22:06,516 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 17:22:06,518 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:22:06,518 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5] total 10 [2018-01-24 17:22:06,518 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:22:06,518 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 17:22:06,518 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 17:22:06,518 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-01-24 17:22:06,519 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 7 states. [2018-01-24 17:22:06,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:22:06,543 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2018-01-24 17:22:06,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 17:22:06,544 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2018-01-24 17:22:06,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:22:06,544 INFO L225 Difference]: With dead ends: 46 [2018-01-24 17:22:06,544 INFO L226 Difference]: Without dead ends: 42 [2018-01-24 17:22:06,545 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-01-24 17:22:06,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-24 17:22:06,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2018-01-24 17:22:06,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-24 17:22:06,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-01-24 17:22:06,552 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 31 [2018-01-24 17:22:06,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:22:06,553 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-01-24 17:22:06,553 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 17:22:06,553 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-01-24 17:22:06,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-24 17:22:06,554 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:22:06,554 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:22:06,554 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 17:22:06,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1092971799, now seen corresponding path program 1 times [2018-01-24 17:22:06,555 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:22:06,556 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:22:06,556 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:22:06,556 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:22:06,556 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:22:06,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:22:06,568 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:22:06,771 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 17:22:06,771 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:22:06,771 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:22:06,771 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-01-24 17:22:06,771 INFO L201 CegarAbsIntRunner]: [0], [3], [4], [5], [6], [7], [8], [9], [16], [18], [22], [26], [31], [33], [34], [36], [38], [43], [44], [45], [47], [49], [50], [51], [52] [2018-01-24 17:22:06,772 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 17:22:06,773 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-24 17:22:06,952 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-24 17:22:06,952 INFO L268 AbstractInterpreter]: Visited 25 different actions 74 times. Merged at 11 different actions 28 times. Never widened. Found 5 fixpoints after 4 different actions. Largest state had 23 variables. [2018-01-24 17:22:06,956 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-24 17:22:06,956 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:22:06,956 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 17:22:06,969 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:22:06,969 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:22:06,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:22:06,992 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:22:07,023 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 20 treesize of output 19 [2018-01-24 17:22:07,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:22:07,038 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 17 treesize of output 16 [2018-01-24 17:22:07,038 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:22:07,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:22:07,051 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-24 17:22:07,180 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 17:22:07,180 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:22:08,629 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:22:08,648 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:22:08,648 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 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 13 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 17:22:08,651 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:22:08,651 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 17:22:08,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:22:08,684 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:22:08,687 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 17 treesize of output 16 [2018-01-24 17:22:08,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:22:08,698 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 20 treesize of output 19 [2018-01-24 17:22:08,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:22:08,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:22:08,709 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-24 17:22:08,728 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 17:22:08,728 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:22:12,115 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:22:12,116 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 17:22:12,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 11, 9, 11] total 33 [2018-01-24 17:22:12,117 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 17:22:12,117 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-24 17:22:12,117 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-24 17:22:12,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1009, Unknown=13, NotChecked=0, Total=1122 [2018-01-24 17:22:12,118 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 19 states. [2018-01-24 17:22:12,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 17:22:12,525 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2018-01-24 17:22:12,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 17:22:12,525 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 35 [2018-01-24 17:22:12,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 17:22:12,526 INFO L225 Difference]: With dead ends: 59 [2018-01-24 17:22:12,526 INFO L226 Difference]: Without dead ends: 58 [2018-01-24 17:22:12,527 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 113 SyntacticMatches, 8 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=197, Invalid=1596, Unknown=13, NotChecked=0, Total=1806 [2018-01-24 17:22:12,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-24 17:22:12,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 48. [2018-01-24 17:22:12,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-24 17:22:12,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2018-01-24 17:22:12,536 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 35 [2018-01-24 17:22:12,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 17:22:12,536 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2018-01-24 17:22:12,536 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-24 17:22:12,536 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2018-01-24 17:22:12,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-24 17:22:12,537 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 17:22:12,537 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 17:22:12,537 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-24 17:22:12,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1217560473, now seen corresponding path program 2 times [2018-01-24 17:22:12,537 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 17:22:12,538 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:22:12,538 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 17:22:12,538 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 17:22:12,538 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 17:22:12,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 17:22:12,550 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 17:22:12,903 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:22:12,903 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:22:12,903 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 17:22:12,904 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-24 17:22:12,904 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 17:22:12,904 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 17:22:12,904 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 17:22:12,912 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 17:22:12,912 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 17:22:12,921 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 17:22:12,928 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 17:22:12,932 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 17:22:12,935 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 17:22:12,955 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 23 treesize of output 22 [2018-01-24 17:22:12,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:22:12,957 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 26 treesize of output 25 [2018-01-24 17:22:12,957 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:22:12,972 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 25 treesize of output 24 [2018-01-24 17:22:12,972 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 17:22:13,008 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 22 treesize of output 21 [2018-01-24 17:22:13,008 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:22:13,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 17:22:13,026 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-24 17:22:13,339 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:22:13,340 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:22:13,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 67 [2018-01-24 17:22:13,341 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 17:22:13,394 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:22:13,403 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:22:13,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-01-24 17:22:13,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 17:22:13,472 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:22:13,473 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 17:22:13,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-01-24 17:22:13,474 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 17:22:13,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-01-24 17:22:13,524 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 17:22:13,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-01-24 17:22:13,556 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:107, output treesize:75 [2018-01-24 17:22:14,075 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 17:22:14,075 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 17:22:14,379 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 36 Received shutdown request... [2018-01-24 17:22:16,489 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 17:22:16,490 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 17:22:16,531 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 17:22:16,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 05:22:16 BoogieIcfgContainer [2018-01-24 17:22:16,531 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 17:22:16,532 INFO L168 Benchmark]: Toolchain (without parser) took 69454.32 ms. Allocated memory was 305.7 MB in the beginning and 561.0 MB in the end (delta: 255.3 MB). Free memory was 264.7 MB in the beginning and 358.8 MB in the end (delta: -94.1 MB). Peak memory consumption was 161.2 MB. Max. memory is 5.3 GB. [2018-01-24 17:22:16,533 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 305.7 MB. Free memory is still 270.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 17:22:16,533 INFO L168 Benchmark]: CACSL2BoogieTranslator took 203.96 ms. Allocated memory is still 305.7 MB. Free memory was 264.7 MB in the beginning and 250.8 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-24 17:22:16,533 INFO L168 Benchmark]: Boogie Preprocessor took 33.70 ms. Allocated memory is still 305.7 MB. Free memory was 250.8 MB in the beginning and 248.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 17:22:16,533 INFO L168 Benchmark]: RCFGBuilder took 189.95 ms. Allocated memory is still 305.7 MB. Free memory was 248.8 MB in the beginning and 234.1 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. [2018-01-24 17:22:16,534 INFO L168 Benchmark]: TraceAbstraction took 69018.93 ms. Allocated memory was 305.7 MB in the beginning and 561.0 MB in the end (delta: 255.3 MB). Free memory was 234.1 MB in the beginning and 358.8 MB in the end (delta: -124.7 MB). Peak memory consumption was 130.6 MB. Max. memory is 5.3 GB. [2018-01-24 17:22:16,536 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.17 ms. Allocated memory is still 305.7 MB. Free memory is still 270.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 203.96 ms. Allocated memory is still 305.7 MB. Free memory was 264.7 MB in the beginning and 250.8 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.70 ms. Allocated memory is still 305.7 MB. Free memory was 250.8 MB in the beginning and 248.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 189.95 ms. Allocated memory is still 305.7 MB. Free memory was 248.8 MB in the beginning and 234.1 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 69018.93 ms. Allocated memory was 305.7 MB in the beginning and 561.0 MB in the end (delta: 255.3 MB). Free memory was 234.1 MB in the beginning and 358.8 MB in the end (delta: -124.7 MB). Peak memory consumption was 130.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 13 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 61 LocStat_NO_SUPPORTING_DISEQUALITIES : 0 LocStat_NO_DISJUNCTIONS : -26 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 22 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 26 TransStat_NO_SUPPORTING_DISEQUALITIES : 2 TransStat_NO_DISJUNCTIONS : 23 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.991276 RENAME_VARIABLES(MILLISECONDS) : 0.135245 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.408767 PROJECTAWAY(MILLISECONDS) : 0.025362 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.009962 DISJOIN(MILLISECONDS) : 0.000000 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.193452 ADD_EQUALITY(MILLISECONDS) : 0.042320 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.013083 #CONJOIN_DISJUNCTIVE : 21 #RENAME_VARIABLES : 43 #UNFREEZE : 0 #CONJOIN : 44 #PROJECTAWAY : 44 #ADD_WEAK_EQUALITY : 1 #DISJOIN : 0 #RENAME_VARIABLES_DISJUNCTIVE : 42 #ADD_EQUALITY : 26 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 2 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 21 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 103 LocStat_NO_SUPPORTING_DISEQUALITIES : 15 LocStat_NO_DISJUNCTIONS : -42 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 31 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 43 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 32 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.274386 RENAME_VARIABLES(MILLISECONDS) : 0.111504 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.237091 PROJECTAWAY(MILLISECONDS) : 0.073423 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001172 DISJOIN(MILLISECONDS) : 0.543482 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.138135 ADD_EQUALITY(MILLISECONDS) : 0.018726 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.032089 #CONJOIN_DISJUNCTIVE : 62 #RENAME_VARIABLES : 124 #UNFREEZE : 0 #CONJOIN : 112 #PROJECTAWAY : 102 #ADD_WEAK_EQUALITY : 3 #DISJOIN : 14 #RENAME_VARIABLES_DISJUNCTIVE : 121 #ADD_EQUALITY : 43 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 21 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 102 LocStat_NO_SUPPORTING_DISEQUALITIES : 13 LocStat_NO_DISJUNCTIONS : -42 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 31 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 45 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 33 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.489714 RENAME_VARIABLES(MILLISECONDS) : 0.116616 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.189201 PROJECTAWAY(MILLISECONDS) : 0.060201 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001192 DISJOIN(MILLISECONDS) : 0.442714 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.142868 ADD_EQUALITY(MILLISECONDS) : 0.028017 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.012384 #CONJOIN_DISJUNCTIVE : 62 #RENAME_VARIABLES : 127 #UNFREEZE : 0 #CONJOIN : 115 #PROJECTAWAY : 108 #ADD_WEAK_EQUALITY : 3 #DISJOIN : 17 #RENAME_VARIABLES_DISJUNCTIVE : 121 #ADD_EQUALITY : 45 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 21 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 117 LocStat_NO_SUPPORTING_DISEQUALITIES : 21 LocStat_NO_DISJUNCTIONS : -42 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 30 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 40 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 31 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.153908 RENAME_VARIABLES(MILLISECONDS) : 0.055494 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.133085 PROJECTAWAY(MILLISECONDS) : 0.033086 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001187 DISJOIN(MILLISECONDS) : 0.199624 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.070317 ADD_EQUALITY(MILLISECONDS) : 0.012536 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.028741 #CONJOIN_DISJUNCTIVE : 43 #RENAME_VARIABLES : 74 #UNFREEZE : 0 #CONJOIN : 74 #PROJECTAWAY : 71 #ADD_WEAK_EQUALITY : 3 #DISJOIN : 6 #RENAME_VARIABLES_DISJUNCTIVE : 73 #ADD_EQUALITY : 40 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 21 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 117 LocStat_NO_SUPPORTING_DISEQUALITIES : 20 LocStat_NO_DISJUNCTIONS : -42 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 30 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 42 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 32 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.268201 RENAME_VARIABLES(MILLISECONDS) : 0.067139 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.101149 PROJECTAWAY(MILLISECONDS) : 0.030155 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001142 DISJOIN(MILLISECONDS) : 0.287550 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.085166 ADD_EQUALITY(MILLISECONDS) : 0.022518 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.011783 #CONJOIN_DISJUNCTIVE : 43 #RENAME_VARIABLES : 75 #UNFREEZE : 0 #CONJOIN : 75 #PROJECTAWAY : 73 #ADD_WEAK_EQUALITY : 3 #DISJOIN : 7 #RENAME_VARIABLES_DISJUNCTIVE : 73 #ADD_EQUALITY : 42 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 25 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 121 LocStat_NO_SUPPORTING_DISEQUALITIES : 16 LocStat_NO_DISJUNCTIONS : -50 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 36 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 56 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 37 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.169257 RENAME_VARIABLES(MILLISECONDS) : 0.148608 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.149297 PROJECTAWAY(MILLISECONDS) : 0.116446 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.000916 DISJOIN(MILLISECONDS) : 0.424728 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.170580 ADD_EQUALITY(MILLISECONDS) : 0.022353 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.010356 #CONJOIN_DISJUNCTIVE : 126 #RENAME_VARIABLES : 295 #UNFREEZE : 0 #CONJOIN : 247 #PROJECTAWAY : 227 #ADD_WEAK_EQUALITY : 7 #DISJOIN : 33 #RENAME_VARIABLES_DISJUNCTIVE : 292 #ADD_EQUALITY : 58 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 5 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 22 LocStat_MAX_WEQGRAPH_SIZE : 0 LocStat_MAX_SIZEOF_WEQEDGELABEL : 0 LocStat_NO_SUPPORTING_EQUALITIES : 110 LocStat_NO_SUPPORTING_DISEQUALITIES : 15 LocStat_NO_DISJUNCTIONS : -44 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 33 TransStat_MAX_WEQGRAPH_SIZE : 0 TransStat_MAX_SIZEOF_WEQEDGELABEL : 0 TransStat_NO_SUPPORTING_EQUALITIES : 57 TransStat_NO_SUPPORTING_DISEQUALITIES : 5 TransStat_NO_DISJUNCTIONS : 35 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.349245 RENAME_VARIABLES(MILLISECONDS) : 0.215477 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.323348 PROJECTAWAY(MILLISECONDS) : 0.160564 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.001290 DISJOIN(MILLISECONDS) : 0.341071 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.239582 ADD_EQUALITY(MILLISECONDS) : 0.021292 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.009437 #CONJOIN_DISJUNCTIVE : 119 #RENAME_VARIABLES : 275 #UNFREEZE : 0 #CONJOIN : 230 #PROJECTAWAY : 208 #ADD_WEAK_EQUALITY : 7 #DISJOIN : 40 #RENAME_VARIABLES_DISJUNCTIVE : 266 #ADD_EQUALITY : 59 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1452]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1452). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 30 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 30 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1446). Cancelled while BasicCegarLoop was analyzing trace of length 38 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 1quantifier alternations) to 30 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 31 locations, 3 error locations. TIMEOUT Result, 68.9s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 23.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 258 SDtfs, 340 SDslu, 866 SDs, 0 SdLazy, 1159 SolverSat, 125 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 15.0s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 795 GetRequests, 594 SyntacticMatches, 50 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1172 ImplicationChecksByTransitivity, 44.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.7s AbstIntTime, 7 AbstIntIterations, 1 AbstIntStrong, 0.890909090909091 AbsIntWeakeningRatio, 1.0 AbsIntAvgWeakeningVarsNumRemoved, 1.6363636363636365 AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 69 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 39.8s InterpolantComputationTime, 590 NumberOfCodeBlocks, 590 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 896 ConstructedInterpolants, 156 QuantifiedInterpolants, 297892 SizeOfPredicates, 50 NumberOfNonLiveVariables, 1342 ConjunctsInSsa, 233 ConjunctsInUnsatCore, 34 InterpolantComputations, 3 PerfectInterpolantSequences, 82/219 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_3_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_17-22-16-553.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_3_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-24_17-22-16-553.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_3_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-24_17-22-16-553.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_3_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-24_17-22-16-553.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_3_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-24_17-22-16-553.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_3_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-24_17-22-16-553.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_3_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-24_17-22-16-553.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_3_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-24_17-22-16-553.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_3_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-24_17-22-16-553.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_3_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-4-2018-01-24_17-22-16-553.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_3_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-4-2018-01-24_17-22-16-553.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_3_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-5-2018-01-24_17-22-16-553.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_3_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-5-2018-01-24_17-22-16-553.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_3_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-6-2018-01-24_17-22-16-553.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_3_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-6-2018-01-24_17-22-16-553.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test18_3_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_17-22-16-553.csv Completed graceful shutdown