java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength2_true-valid-memsafety.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 03:21:04,366 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 03:21:04,368 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 03:21:04,384 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 03:21:04,384 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 03:21:04,385 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 03:21:04,387 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 03:21:04,388 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 03:21:04,390 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 03:21:04,391 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 03:21:04,392 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 03:21:04,392 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 03:21:04,393 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 03:21:04,395 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 03:21:04,396 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 03:21:04,398 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 03:21:04,401 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 03:21:04,403 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 03:21:04,404 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 03:21:04,405 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 03:21:04,408 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 03:21:04,408 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 03:21:04,408 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 03:21:04,409 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 03:21:04,410 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 03:21:04,412 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 03:21:04,412 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 03:21:04,413 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 03:21:04,413 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 03:21:04,413 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 03:21:04,414 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 03:21:04,414 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf [2018-01-21 03:21:04,424 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 03:21:04,424 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 03:21:04,424 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 03:21:04,424 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 03:21:04,425 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 03:21:04,425 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-21 03:21:04,425 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 03:21:04,425 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-21 03:21:04,425 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 03:21:04,425 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 03:21:04,426 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 03:21:04,426 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 03:21:04,426 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 03:21:04,426 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 03:21:04,426 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 03:21:04,426 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 03:21:04,426 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 03:21:04,427 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 03:21:04,427 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 03:21:04,427 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 03:21:04,427 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 03:21:04,427 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 03:21:04,427 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 03:21:04,428 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 03:21:04,428 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 03:21:04,428 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 03:21:04,428 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 03:21:04,428 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 03:21:04,428 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 03:21:04,428 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 03:21:04,429 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 03:21:04,429 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 03:21:04,429 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 03:21:04,429 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 03:21:04,429 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 03:21:04,429 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 03:21:04,429 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 03:21:04,429 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 03:21:04,430 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 03:21:04,430 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 03:21:04,462 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 03:21:04,474 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 03:21:04,478 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 03:21:04,479 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 03:21:04,480 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 03:21:04,480 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength2_true-valid-memsafety.c [2018-01-21 03:21:04,596 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 03:21:04,600 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 03:21:04,601 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 03:21:04,601 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 03:21:04,606 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 03:21:04,607 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 03:21:04" (1/1) ... [2018-01-21 03:21:04,610 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a7c8be4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:21:04, skipping insertion in model container [2018-01-21 03:21:04,610 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 03:21:04" (1/1) ... [2018-01-21 03:21:04,624 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 03:21:04,639 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 03:21:04,759 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 03:21:04,779 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 03:21:04,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:21:04 WrapperNode [2018-01-21 03:21:04,786 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 03:21:04,787 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 03:21:04,787 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 03:21:04,788 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 03:21:04,799 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:21:04" (1/1) ... [2018-01-21 03:21:04,800 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:21:04" (1/1) ... [2018-01-21 03:21:04,808 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:21:04" (1/1) ... [2018-01-21 03:21:04,808 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:21:04" (1/1) ... [2018-01-21 03:21:04,812 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:21:04" (1/1) ... [2018-01-21 03:21:04,816 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:21:04" (1/1) ... [2018-01-21 03:21:04,817 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:21:04" (1/1) ... [2018-01-21 03:21:04,820 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 03:21:04,820 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 03:21:04,820 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 03:21:04,821 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 03:21:04,822 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:21:04" (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-21 03:21:04,869 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 03:21:04,869 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 03:21:04,869 INFO L136 BoogieDeclarations]: Found implementation of procedure bar [2018-01-21 03:21:04,870 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-21 03:21:04,870 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 03:21:04,870 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 03:21:04,870 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 03:21:04,870 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 03:21:04,870 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 03:21:04,871 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 03:21:04,871 INFO L128 BoogieDeclarations]: Found specification of procedure bar [2018-01-21 03:21:04,871 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-21 03:21:04,871 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 03:21:04,871 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 03:21:04,871 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 03:21:05,121 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 03:21:05,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 03:21:05 BoogieIcfgContainer [2018-01-21 03:21:05,122 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 03:21:05,123 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 03:21:05,123 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 03:21:05,124 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 03:21:05,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 03:21:04" (1/3) ... [2018-01-21 03:21:05,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3da03122 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 03:21:05, skipping insertion in model container [2018-01-21 03:21:05,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:21:04" (2/3) ... [2018-01-21 03:21:05,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3da03122 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 03:21:05, skipping insertion in model container [2018-01-21 03:21:05,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 03:21:05" (3/3) ... [2018-01-21 03:21:05,128 INFO L105 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength2_true-valid-memsafety.c [2018-01-21 03:21:05,137 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 03:21:05,143 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-01-21 03:21:05,185 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:21:05,185 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:21:05,214 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:21:05,214 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:21:05,214 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:21:05,214 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:21:05,215 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:21:05,215 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == barErr0EnsuresViolation======== [2018-01-21 03:21:05,216 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:21:05,237 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 03:21:05,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-21 03:21:05,243 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:21:05,244 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] [2018-01-21 03:21:05,244 INFO L371 AbstractCegarLoop]: === Iteration 1 === [barErr0EnsuresViolation]=== [2018-01-21 03:21:05,248 INFO L82 PathProgramCache]: Analyzing trace with hash -492377012, now seen corresponding path program 1 times [2018-01-21 03:21:05,250 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:21:05,292 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:21:05,293 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:21:05,293 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:21:05,293 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:21:05,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:21:05,347 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:21:05,385 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-21 03:21:05,387 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:21:05,387 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 03:21:05,387 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:21:05,390 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 03:21:05,401 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 03:21:05,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 03:21:05,404 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 2 states. [2018-01-21 03:21:05,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:21:05,435 INFO L93 Difference]: Finished difference Result 114 states and 135 transitions. [2018-01-21 03:21:05,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 03:21:05,436 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-01-21 03:21:05,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:21:05,444 INFO L225 Difference]: With dead ends: 114 [2018-01-21 03:21:05,444 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 03:21:05,448 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 03:21:05,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 03:21:05,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 03:21:05,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 03:21:05,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 03:21:05,473 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2018-01-21 03:21:05,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:21:05,473 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 03:21:05,473 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 03:21:05,473 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 03:21:05,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 03:21:05,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-21 03:21:05,593 INFO L404 ceAbstractionStarter]: At program point L13'''(lines 13 15) the Hoare annotation is: true [2018-01-21 03:21:05,593 INFO L401 ceAbstractionStarter]: For program point barErr0EnsuresViolation(lines 11 17) no Hoare annotation was computed. [2018-01-21 03:21:05,593 INFO L401 ceAbstractionStarter]: For program point L13''(lines 13 15) no Hoare annotation was computed. [2018-01-21 03:21:05,593 INFO L401 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-01-21 03:21:05,594 INFO L401 ceAbstractionStarter]: For program point L13(lines 13 15) no Hoare annotation was computed. [2018-01-21 03:21:05,594 INFO L404 ceAbstractionStarter]: At program point barENTRY(lines 11 17) the Hoare annotation is: true [2018-01-21 03:21:05,594 INFO L401 ceAbstractionStarter]: For program point L13''''(lines 13 15) no Hoare annotation was computed. [2018-01-21 03:21:05,594 INFO L401 ceAbstractionStarter]: For program point barFINAL(lines 11 17) no Hoare annotation was computed. [2018-01-21 03:21:05,594 INFO L401 ceAbstractionStarter]: For program point L14'(line 14) no Hoare annotation was computed. [2018-01-21 03:21:05,594 INFO L401 ceAbstractionStarter]: For program point barEXIT(lines 11 17) no Hoare annotation was computed. [2018-01-21 03:21:05,595 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 43) no Hoare annotation was computed. [2018-01-21 03:21:05,595 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 43) no Hoare annotation was computed. [2018-01-21 03:21:05,595 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 43) the Hoare annotation is: true [2018-01-21 03:21:05,595 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 43) no Hoare annotation was computed. [2018-01-21 03:21:05,595 INFO L401 ceAbstractionStarter]: For program point fooEXIT(lines 20 29) no Hoare annotation was computed. [2018-01-21 03:21:05,595 INFO L401 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-01-21 03:21:05,596 INFO L401 ceAbstractionStarter]: For program point L23(line 23) no Hoare annotation was computed. [2018-01-21 03:21:05,596 INFO L401 ceAbstractionStarter]: For program point L22(lines 22 24) no Hoare annotation was computed. [2018-01-21 03:21:05,596 INFO L401 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-01-21 03:21:05,596 INFO L401 ceAbstractionStarter]: For program point L23'(line 23) no Hoare annotation was computed. [2018-01-21 03:21:05,596 INFO L401 ceAbstractionStarter]: For program point L21'''''(line 21) no Hoare annotation was computed. [2018-01-21 03:21:05,596 INFO L401 ceAbstractionStarter]: For program point L25'(lines 25 27) no Hoare annotation was computed. [2018-01-21 03:21:05,596 INFO L401 ceAbstractionStarter]: For program point L21'''(line 21) no Hoare annotation was computed. [2018-01-21 03:21:05,596 INFO L401 ceAbstractionStarter]: For program point L21'(line 21) no Hoare annotation was computed. [2018-01-21 03:21:05,596 INFO L401 ceAbstractionStarter]: For program point fooFINAL(lines 20 29) no Hoare annotation was computed. [2018-01-21 03:21:05,596 INFO L404 ceAbstractionStarter]: At program point fooENTRY(lines 20 29) the Hoare annotation is: true [2018-01-21 03:21:05,597 INFO L401 ceAbstractionStarter]: For program point L22''(lines 22 24) no Hoare annotation was computed. [2018-01-21 03:21:05,597 INFO L401 ceAbstractionStarter]: For program point L23''(line 23) no Hoare annotation was computed. [2018-01-21 03:21:05,597 INFO L401 ceAbstractionStarter]: For program point L21''(line 21) no Hoare annotation was computed. [2018-01-21 03:21:05,597 INFO L404 ceAbstractionStarter]: At program point L22''''(lines 22 24) the Hoare annotation is: true [2018-01-21 03:21:05,597 INFO L404 ceAbstractionStarter]: At program point L22'''(lines 22 24) the Hoare annotation is: true [2018-01-21 03:21:05,597 INFO L401 ceAbstractionStarter]: For program point fooErr0EnsuresViolation(lines 20 29) no Hoare annotation was computed. [2018-01-21 03:21:05,597 INFO L401 ceAbstractionStarter]: For program point L21''''(line 21) no Hoare annotation was computed. [2018-01-21 03:21:05,597 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 43) the Hoare annotation is: true [2018-01-21 03:21:05,597 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 43) no Hoare annotation was computed. [2018-01-21 03:21:05,597 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 43) the Hoare annotation is: true [2018-01-21 03:21:05,598 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 43) no Hoare annotation was computed. [2018-01-21 03:21:05,598 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 43) no Hoare annotation was computed. [2018-01-21 03:21:05,598 INFO L404 ceAbstractionStarter]: At program point L36''(lines 36 40) the Hoare annotation is: true [2018-01-21 03:21:05,598 INFO L401 ceAbstractionStarter]: For program point L33''(lines 33 35) no Hoare annotation was computed. [2018-01-21 03:21:05,598 INFO L401 ceAbstractionStarter]: For program point L34''(line 34) no Hoare annotation was computed. [2018-01-21 03:21:05,598 INFO L404 ceAbstractionStarter]: At program point L33'''(lines 33 35) the Hoare annotation is: true [2018-01-21 03:21:05,599 INFO L401 ceAbstractionStarter]: For program point L32''(line 32) no Hoare annotation was computed. [2018-01-21 03:21:05,599 INFO L401 ceAbstractionStarter]: For program point L37'(line 37) no Hoare annotation was computed. [2018-01-21 03:21:05,599 INFO L401 ceAbstractionStarter]: For program point L32''''(line 32) no Hoare annotation was computed. [2018-01-21 03:21:05,599 INFO L401 ceAbstractionStarter]: For program point L32'''''(line 32) no Hoare annotation was computed. [2018-01-21 03:21:05,599 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 31 42) no Hoare annotation was computed. [2018-01-21 03:21:05,599 INFO L401 ceAbstractionStarter]: For program point L36'''(lines 36 40) no Hoare annotation was computed. [2018-01-21 03:21:05,599 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 31 42) no Hoare annotation was computed. [2018-01-21 03:21:05,599 INFO L401 ceAbstractionStarter]: For program point L32(line 32) no Hoare annotation was computed. [2018-01-21 03:21:05,600 INFO L401 ceAbstractionStarter]: For program point L32'''(line 32) no Hoare annotation was computed. [2018-01-21 03:21:05,600 INFO L404 ceAbstractionStarter]: At program point L34(line 34) the Hoare annotation is: true [2018-01-21 03:21:05,600 INFO L401 ceAbstractionStarter]: For program point L33(lines 33 35) no Hoare annotation was computed. [2018-01-21 03:21:05,600 INFO L401 ceAbstractionStarter]: For program point L34'''(line 34) no Hoare annotation was computed. [2018-01-21 03:21:05,600 INFO L401 ceAbstractionStarter]: For program point L33''''(lines 33 35) no Hoare annotation was computed. [2018-01-21 03:21:05,600 INFO L401 ceAbstractionStarter]: For program point L36(lines 36 40) no Hoare annotation was computed. [2018-01-21 03:21:05,600 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 31 42) no Hoare annotation was computed. [2018-01-21 03:21:05,601 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 31 42) the Hoare annotation is: true [2018-01-21 03:21:05,601 INFO L401 ceAbstractionStarter]: For program point L38(line 38) no Hoare annotation was computed. [2018-01-21 03:21:05,601 INFO L401 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-01-21 03:21:05,601 INFO L401 ceAbstractionStarter]: For program point L34'(line 34) no Hoare annotation was computed. [2018-01-21 03:21:05,601 INFO L401 ceAbstractionStarter]: For program point L32'(line 32) no Hoare annotation was computed. [2018-01-21 03:21:05,605 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:21:05,605 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:21:05,605 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:21:05,605 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:21:05,606 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:21:05,606 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:21:05,606 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:21:05,606 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 03:21:05,606 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:21:05,609 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 03:21:05,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 03:21:05,609 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:21:05,609 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 03:21:05,610 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 03:21:05,610 INFO L82 PathProgramCache]: Analyzing trace with hash 136143, now seen corresponding path program 1 times [2018-01-21 03:21:05,610 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:21:05,611 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:21:05,611 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:21:05,612 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:21:05,612 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:21:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:21:05,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:21:05,640 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 03:21:05,644 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:21:05,649 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:21:05,649 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:21:05,649 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:21:05,649 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:21:05,649 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:21:05,650 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:21:05,650 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:21:05,650 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == fooErr0EnsuresViolation======== [2018-01-21 03:21:05,650 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:21:05,652 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 03:21:05,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-21 03:21:05,654 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:21:05,654 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:21:05,655 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr0EnsuresViolation]=== [2018-01-21 03:21:05,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1220349549, now seen corresponding path program 1 times [2018-01-21 03:21:05,655 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:21:05,656 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:21:05,656 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:21:05,656 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:21:05,657 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:21:05,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:21:05,673 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:21:05,696 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-21 03:21:05,699 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:21:05,700 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 03:21:05,700 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:21:05,700 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 03:21:05,700 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 03:21:05,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 03:21:05,701 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 2 states. [2018-01-21 03:21:05,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:21:05,710 INFO L93 Difference]: Finished difference Result 114 states and 135 transitions. [2018-01-21 03:21:05,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 03:21:05,710 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 26 [2018-01-21 03:21:05,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:21:05,713 INFO L225 Difference]: With dead ends: 114 [2018-01-21 03:21:05,713 INFO L226 Difference]: Without dead ends: 43 [2018-01-21 03:21:05,714 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 03:21:05,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-21 03:21:05,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-01-21 03:21:05,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-21 03:21:05,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-01-21 03:21:05,726 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 26 [2018-01-21 03:21:05,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:21:05,726 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-01-21 03:21:05,726 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 03:21:05,727 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-01-21 03:21:05,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-21 03:21:05,728 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:21:05,728 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:21:05,728 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr0EnsuresViolation]=== [2018-01-21 03:21:05,729 INFO L82 PathProgramCache]: Analyzing trace with hash 390316661, now seen corresponding path program 1 times [2018-01-21 03:21:05,729 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:21:05,730 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:21:05,730 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:21:05,730 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:21:05,731 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:21:05,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:21:05,760 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:21:05,872 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-21 03:21:05,872 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:21:05,872 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 03:21:05,872 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:21:05,874 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 03:21:05,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 03:21:05,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 03:21:05,875 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 4 states. [2018-01-21 03:21:05,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:21:05,981 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2018-01-21 03:21:05,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 03:21:05,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-01-21 03:21:05,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:21:05,982 INFO L225 Difference]: With dead ends: 43 [2018-01-21 03:21:05,982 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 03:21:05,984 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-21 03:21:05,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 03:21:05,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 03:21:05,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 03:21:05,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 03:21:05,985 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-01-21 03:21:05,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:21:05,985 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 03:21:05,985 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 03:21:05,985 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 03:21:05,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 03:21:05,988 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:21:05,988 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:21:05,988 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:21:05,988 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:21:05,988 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:21:05,988 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:21:05,988 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:21:05,989 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 03:21:05,989 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:21:05,990 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 03:21:05,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-21 03:21:05,992 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:21:05,992 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:21:05,992 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 03:21:05,992 INFO L82 PathProgramCache]: Analyzing trace with hash -851979775, now seen corresponding path program 1 times [2018-01-21 03:21:05,992 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:21:05,994 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:21:05,994 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:21:05,994 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:21:05,994 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:21:06,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:21:06,001 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:21:06,008 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-21 03:21:06,008 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:21:06,009 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 03:21:06,009 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:21:06,009 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 03:21:06,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 03:21:06,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 03:21:06,010 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 2 states. [2018-01-21 03:21:06,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:21:06,017 INFO L93 Difference]: Finished difference Result 114 states and 135 transitions. [2018-01-21 03:21:06,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 03:21:06,017 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-01-21 03:21:06,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:21:06,018 INFO L225 Difference]: With dead ends: 114 [2018-01-21 03:21:06,019 INFO L226 Difference]: Without dead ends: 57 [2018-01-21 03:21:06,019 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 03:21:06,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-21 03:21:06,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-01-21 03:21:06,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-21 03:21:06,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2018-01-21 03:21:06,027 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 17 [2018-01-21 03:21:06,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:21:06,027 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2018-01-21 03:21:06,027 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 03:21:06,028 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2018-01-21 03:21:06,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-21 03:21:06,028 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:21:06,029 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-21 03:21:06,029 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 03:21:06,029 INFO L82 PathProgramCache]: Analyzing trace with hash -178858898, now seen corresponding path program 1 times [2018-01-21 03:21:06,029 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:21:06,030 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:21:06,030 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:21:06,030 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:21:06,030 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:21:06,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:21:06,038 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:21:06,062 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-21 03:21:06,063 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:21:06,063 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-21 03:21:06,063 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:21:06,064 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 03:21:06,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 03:21:06,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 03:21:06,064 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand 3 states. [2018-01-21 03:21:06,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:21:06,104 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2018-01-21 03:21:06,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 03:21:06,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-01-21 03:21:06,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:21:06,107 INFO L225 Difference]: With dead ends: 76 [2018-01-21 03:21:06,108 INFO L226 Difference]: Without dead ends: 61 [2018-01-21 03:21:06,108 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 03:21:06,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-21 03:21:06,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2018-01-21 03:21:06,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-21 03:21:06,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-01-21 03:21:06,123 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 19 [2018-01-21 03:21:06,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:21:06,124 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-01-21 03:21:06,124 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 03:21:06,124 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-01-21 03:21:06,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-21 03:21:06,125 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:21:06,126 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:21:06,126 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 03:21:06,126 INFO L82 PathProgramCache]: Analyzing trace with hash -853032378, now seen corresponding path program 1 times [2018-01-21 03:21:06,126 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:21:06,127 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:21:06,127 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:21:06,127 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:21:06,127 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:21:06,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:21:06,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:21:06,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 03:21:06,210 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 03:21:06,210 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 03:21:06,211 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 47 with the following transitions: [2018-01-21 03:21:06,212 INFO L201 CegarAbsIntRunner]: [0], [4], [7], [17], [18], [20], [21], [23], [24], [25], [29], [32], [44], [50], [51], [52], [53], [58], [59], [60], [61], [65], [68], [70], [72], [73], [74], [76], [80], [84], [89], [90], [93], [95], [96], [97], [106], [108], [109], [110], [111], [112], [113], [114], [115] [2018-01-21 03:21:06,262 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 03:21:06,262 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 03:21:09,872 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 03:21:09,873 INFO L268 AbstractInterpreter]: Visited 45 different actions 81 times. Merged at 17 different actions 17 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 23 variables. [2018-01-21 03:21:09,886 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 03:21:09,886 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 03:21:09,886 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-21 03:21:09,892 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:21:09,893 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 03:21:09,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:21:09,950 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 03:21:09,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 03:21:09,971 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 03:21:10,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 03:21:10,068 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 03:21:10,068 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-21 03:21:10,073 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:21:10,073 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 03:21:10,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:21:10,114 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 03:21:10,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 03:21:10,120 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 03:21:10,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 03:21:10,160 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-21 03:21:10,160 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4] total 7 [2018-01-21 03:21:10,160 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-21 03:21:10,161 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 03:21:10,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 03:21:10,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-01-21 03:21:10,161 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 5 states. [2018-01-21 03:21:10,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:21:10,210 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2018-01-21 03:21:10,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 03:21:10,236 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-01-21 03:21:10,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:21:10,238 INFO L225 Difference]: With dead ends: 80 [2018-01-21 03:21:10,238 INFO L226 Difference]: Without dead ends: 68 [2018-01-21 03:21:10,238 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-01-21 03:21:10,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-21 03:21:10,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2018-01-21 03:21:10,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-21 03:21:10,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-01-21 03:21:10,245 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 46 [2018-01-21 03:21:10,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:21:10,246 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-01-21 03:21:10,246 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 03:21:10,246 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-01-21 03:21:10,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-01-21 03:21:10,249 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:21:10,249 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:21:10,249 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 03:21:10,249 INFO L82 PathProgramCache]: Analyzing trace with hash -723838693, now seen corresponding path program 2 times [2018-01-21 03:21:10,250 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:21:10,251 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:21:10,251 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:21:10,251 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:21:10,251 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:21:10,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:21:10,280 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:21:10,357 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-01-21 03:21:10,358 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 03:21:10,358 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 03:21:10,358 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-21 03:21:10,359 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 03:21:10,359 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 03:21:10,359 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-21 03:21:10,368 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-21 03:21:10,368 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-21 03:21:10,388 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 03:21:10,408 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-21 03:21:10,412 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-21 03:21:10,417 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 03:21:10,485 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-21 03:21:10,486 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 03:21:10,738 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-21 03:21:10,772 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-21 03:21:10,772 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [5] total 12 [2018-01-21 03:21:10,773 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:21:10,773 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-21 03:21:10,773 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-21 03:21:10,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-01-21 03:21:10,774 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 7 states. [2018-01-21 03:21:10,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:21:10,921 INFO L93 Difference]: Finished difference Result 124 states and 137 transitions. [2018-01-21 03:21:10,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-21 03:21:10,921 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2018-01-21 03:21:10,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:21:10,924 INFO L225 Difference]: With dead ends: 124 [2018-01-21 03:21:10,925 INFO L226 Difference]: Without dead ends: 78 [2018-01-21 03:21:10,925 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 133 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-01-21 03:21:10,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-21 03:21:10,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2018-01-21 03:21:10,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-21 03:21:10,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2018-01-21 03:21:10,933 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 71 [2018-01-21 03:21:10,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:21:10,933 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2018-01-21 03:21:10,933 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-21 03:21:10,934 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2018-01-21 03:21:10,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-01-21 03:21:10,935 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:21:10,935 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-21 03:21:10,935 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 03:21:10,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1699645763, now seen corresponding path program 1 times [2018-01-21 03:21:10,935 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:21:10,936 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:21:10,936 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-21 03:21:10,936 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:21:10,936 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:21:10,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:21:10,966 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:21:11,053 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-01-21 03:21:11,054 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 03:21:11,054 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 03:21:11,054 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 78 with the following transitions: [2018-01-21 03:21:11,055 INFO L201 CegarAbsIntRunner]: [0], [4], [7], [17], [18], [20], [21], [23], [24], [25], [29], [32], [34], [35], [36], [37], [39], [44], [50], [51], [52], [53], [58], [59], [60], [61], [65], [68], [70], [72], [73], [74], [76], [80], [84], [89], [90], [93], [95], [96], [97], [106], [108], [109], [110], [111], [112], [113], [114], [115] [2018-01-21 03:21:11,056 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 03:21:11,057 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 03:21:42,477 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 03:21:42,477 INFO L268 AbstractInterpreter]: Visited 50 different actions 161 times. Merged at 30 different actions 59 times. Never widened. Found 8 fixpoints after 4 different actions. Largest state had 25 variables. [2018-01-21 03:21:42,484 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 03:21:42,484 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 03:21:42,484 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 03:21:42,491 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:21:42,491 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 03:21:42,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:21:42,546 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 03:21:42,780 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-21 03:21:42,781 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-21 03:21:43,089 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-21 03:21:43,126 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-21 03:21:43,126 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [5] total 13 [2018-01-21 03:21:43,126 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:21:43,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-21 03:21:43,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-21 03:21:43,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-01-21 03:21:43,127 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand 8 states. [2018-01-21 03:21:43,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:21:43,259 INFO L93 Difference]: Finished difference Result 155 states and 174 transitions. [2018-01-21 03:21:43,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-21 03:21:43,260 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 77 [2018-01-21 03:21:43,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:21:43,262 INFO L225 Difference]: With dead ends: 155 [2018-01-21 03:21:43,263 INFO L226 Difference]: Without dead ends: 98 [2018-01-21 03:21:43,264 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 142 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-01-21 03:21:43,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-21 03:21:43,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 79. [2018-01-21 03:21:43,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-21 03:21:43,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2018-01-21 03:21:43,274 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 77 [2018-01-21 03:21:43,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:21:43,275 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2018-01-21 03:21:43,275 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-21 03:21:43,275 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2018-01-21 03:21:43,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-01-21 03:21:43,277 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:21:43,277 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:21:43,277 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 03:21:43,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1275911246, now seen corresponding path program 1 times [2018-01-21 03:21:43,278 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:21:43,279 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:21:43,279 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:21:43,279 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:21:43,279 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:21:43,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:21:43,306 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:21:43,426 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-01-21 03:21:43,426 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 03:21:43,426 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 03:21:43,426 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 83 with the following transitions: [2018-01-21 03:21:43,427 INFO L201 CegarAbsIntRunner]: [0], [4], [7], [9], [10], [11], [13], [17], [18], [20], [21], [23], [24], [25], [29], [32], [34], [35], [36], [37], [39], [44], [50], [51], [52], [53], [58], [59], [60], [61], [65], [68], [70], [72], [73], [74], [76], [80], [84], [89], [90], [93], [95], [96], [97], [106], [108], [109], [110], [111], [112], [113], [114], [115] [2018-01-21 03:21:43,429 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 03:21:43,429 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 03:22:02,735 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-21 03:22:02,735 INFO L268 AbstractInterpreter]: Visited 54 different actions 223 times. Merged at 38 different actions 103 times. Never widened. Found 17 fixpoints after 7 different actions. Largest state had 25 variables. [2018-01-21 03:22:02,736 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-21 03:22:02,736 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 03:22:02,736 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-21 03:22:02,743 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:22:02,743 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 03:22:02,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:22:02,772 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 03:22:02,785 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-01-21 03:22:02,785 INFO L314 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2018-01-21 03:22:02,845 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-21 03:22:02,845 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-21 03:22:02,847 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:22:02,847 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:22:02,847 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:22:02,847 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:22:02,847 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:22:02,847 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:22:02,847 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:22:02,847 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 03:22:02,847 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:22:02,848 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 03:22:02,848 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-21 03:22:02,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 03:22:02 BoogieIcfgContainer [2018-01-21 03:22:02,849 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 03:22:02,849 INFO L168 Benchmark]: Toolchain (without parser) took 58253.21 ms. Allocated memory was 305.7 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 264.8 MB in the beginning and 1.2 GB in the end (delta: -906.5 MB). Peak memory consumption was 870.3 MB. Max. memory is 5.3 GB. [2018-01-21 03:22:02,850 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 305.7 MB. Free memory is still 268.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 03:22:02,850 INFO L168 Benchmark]: CACSL2BoogieTranslator took 185.95 ms. Allocated memory is still 305.7 MB. Free memory was 264.8 MB in the beginning and 254.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-21 03:22:02,850 INFO L168 Benchmark]: Boogie Preprocessor took 32.52 ms. Allocated memory is still 305.7 MB. Free memory was 254.8 MB in the beginning and 252.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 03:22:02,851 INFO L168 Benchmark]: RCFGBuilder took 301.78 ms. Allocated memory is still 305.7 MB. Free memory was 252.8 MB in the beginning and 235.9 MB in the end (delta: 16.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 5.3 GB. [2018-01-21 03:22:02,851 INFO L168 Benchmark]: TraceAbstraction took 57726.22 ms. Allocated memory was 305.7 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 233.9 MB in the beginning and 1.2 GB in the end (delta: -937.5 MB). Peak memory consumption was 839.3 MB. Max. memory is 5.3 GB. [2018-01-21 03:22:02,853 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.15 ms. Allocated memory is still 305.7 MB. Free memory is still 268.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 185.95 ms. Allocated memory is still 305.7 MB. Free memory was 264.8 MB in the beginning and 254.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.52 ms. Allocated memory is still 305.7 MB. Free memory was 254.8 MB in the beginning and 252.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 301.78 ms. Allocated memory is still 305.7 MB. Free memory was 252.8 MB in the beginning and 235.9 MB in the end (delta: 16.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 57726.22 ms. Allocated memory was 305.7 MB in the beginning and 2.1 GB in the end (delta: 1.8 GB). Free memory was 233.9 MB in the beginning and 1.2 GB in the end (delta: -937.5 MB). Peak memory consumption was 839.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 44 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 412 LocStat_NO_SUPPORTING_DISEQUALITIES : 98 LocStat_NO_DISJUNCTIONS : -88 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 53 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 66 TransStat_NO_SUPPORTING_DISEQUALITIES : 8 TransStat_NO_DISJUNCTIONS : 53 TransStat_MAX_NO_DISJUNCTIONS : 1 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.559031 RENAME_VARIABLES(MILLISECONDS) : 0.366092 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.497611 PROJECTAWAY(MILLISECONDS) : 0.251293 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.060128 DISJOIN(MILLISECONDS) : 0.132538 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.418940 ADD_EQUALITY(MILLISECONDS) : 0.030313 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.009970 #CONJOIN_DISJUNCTIVE : 98 #RENAME_VARIABLES : 195 #UNFREEZE : 0 #CONJOIN : 159 #PROJECTAWAY : 167 #ADD_WEAK_EQUALITY : 9 #DISJOIN : 18 #RENAME_VARIABLES_DISJUNCTIVE : 195 #ADD_EQUALITY : 67 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 48 LocStat_MAX_WEQGRAPH_SIZE : 3 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 456 LocStat_NO_SUPPORTING_DISEQUALITIES : 120 LocStat_NO_DISJUNCTIONS : -96 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 58 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 69 TransStat_NO_SUPPORTING_DISEQUALITIES : 8 TransStat_NO_DISJUNCTIONS : 58 TransStat_MAX_NO_DISJUNCTIONS : 1 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.325048 RENAME_VARIABLES(MILLISECONDS) : 0.223848 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.274168 PROJECTAWAY(MILLISECONDS) : 0.186126 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.067313 DISJOIN(MILLISECONDS) : 1.039403 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.251353 ADD_EQUALITY(MILLISECONDS) : 0.013789 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.012379 #CONJOIN_DISJUNCTIVE : 232 #RENAME_VARIABLES : 535 #UNFREEZE : 0 #CONJOIN : 379 #PROJECTAWAY : 367 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 66 #RENAME_VARIABLES_DISJUNCTIVE : 535 #ADD_EQUALITY : 71 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 51 LocStat_MAX_WEQGRAPH_SIZE : 3 LocStat_MAX_SIZEOF_WEQEDGELABEL : 2 LocStat_NO_SUPPORTING_EQUALITIES : 480 LocStat_NO_SUPPORTING_DISEQUALITIES : 115 LocStat_NO_DISJUNCTIONS : -102 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 62 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 72 TransStat_NO_SUPPORTING_DISEQUALITIES : 8 TransStat_NO_DISJUNCTIONS : 62 TransStat_MAX_NO_DISJUNCTIONS : 1 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.159619 RENAME_VARIABLES(MILLISECONDS) : 0.114259 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.143589 PROJECTAWAY(MILLISECONDS) : 0.076343 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.030509 DISJOIN(MILLISECONDS) : 0.087642 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.129119 ADD_EQUALITY(MILLISECONDS) : 0.023408 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.016245 #CONJOIN_DISJUNCTIVE : 278 #RENAME_VARIABLES : 625 #UNFREEZE : 0 #CONJOIN : 427 #PROJECTAWAY : 425 #ADD_WEAK_EQUALITY : 11 #DISJOIN : 62 #RENAME_VARIABLES_DISJUNCTIVE : 625 #ADD_EQUALITY : 74 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 4 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 11]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: barErr0EnsuresViolation CFG has 5 procedures, 62 locations, 5 error locations. SAFE Result, 0.4s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 66 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 17 PreInvPairs, 21 NumberOfFragments, 12 HoareAnnotationTreeSize, 17 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 20 NumberOfCodeBlocks, 20 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 19 ConstructedInterpolants, 0 QuantifiedInterpolants, 361 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 5 procedures, 62 locations, 5 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 20]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: fooErr0EnsuresViolation CFG has 5 procedures, 62 locations, 5 error locations. SAFE Result, 0.3s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 103 SDtfs, 18 SDslu, 26 SDs, 0 SdLazy, 36 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 52 ConstructedInterpolants, 0 QuantifiedInterpolants, 3460 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1). Cancelled while BasicCegarLoop was analyzing trace of length 83 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 1. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 5 procedures, 62 locations, 5 error locations. TIMEOUT Result, 56.8s OverallTime, 6 OverallIterations, 3 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 263 SDtfs, 115 SDslu, 513 SDs, 0 SdLazy, 268 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 500 GetRequests, 460 SyntacticMatches, 10 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 54.4s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 33 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 470 NumberOfCodeBlocks, 470 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 697 ConstructedInterpolants, 0 QuantifiedInterpolants, 73375 SizeOfPredicates, 9 NumberOfNonLiveVariables, 686 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 13 InterpolantComputations, 6 PerfectInterpolantSequences, 164/196 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 31). Cancelled while IsEmpty was searching accepting run (input had 62 states). - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 5 procedures, 62 locations, 5 error locations. TIMEOUT Result, 0.0s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength2_true-valid-memsafety.c_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_03-22-02-866.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength2_true-valid-memsafety.c_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-21_03-22-02-866.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength2_true-valid-memsafety.c_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-21_03-22-02-866.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength2_true-valid-memsafety.c_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-21_03-22-02-866.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength2_true-valid-memsafety.c_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-21_03-22-02-866.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength2_true-valid-memsafety.c_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-21_03-22-02-866.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength2_true-valid-memsafety.c_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-21_03-22-02-866.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength2_true-valid-memsafety.c_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_03-22-02-866.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength2_true-valid-memsafety.c_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_03-22-02-866.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength2_true-valid-memsafety.c_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_03-22-02-866.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength2_true-valid-memsafety.c_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_03-22-02-866.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength2_true-valid-memsafety.c_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-21_03-22-02-866.csv Completed graceful shutdown