java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-reverse_simple_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 06:24:50,595 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 06:24:50,597 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 06:24:50,611 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 06:24:50,611 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 06:24:50,612 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 06:24:50,613 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 06:24:50,615 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 06:24:50,617 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 06:24:50,617 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 06:24:50,618 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 06:24:50,618 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 06:24:50,619 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 06:24:50,620 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 06:24:50,621 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 06:24:50,623 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 06:24:50,625 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 06:24:50,627 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 06:24:50,629 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 06:24:50,630 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 06:24:50,632 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 06:24:50,632 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 06:24:50,632 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 06:24:50,633 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 06:24:50,634 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 06:24:50,635 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 06:24:50,636 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 06:24:50,636 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 06:24:50,637 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 06:24:50,637 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 06:24:50,637 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 06:24:50,638 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf [2018-01-25 06:24:50,647 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 06:24:50,648 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 06:24:50,648 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 06:24:50,649 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 06:24:50,649 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 06:24:50,649 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 06:24:50,649 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 06:24:50,649 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 06:24:50,650 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 06:24:50,650 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 06:24:50,650 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 06:24:50,651 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 06:24:50,651 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 06:24:50,651 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 06:24:50,651 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 06:24:50,651 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 06:24:50,652 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 06:24:50,652 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 06:24:50,652 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 06:24:50,652 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 06:24:50,652 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 06:24:50,652 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 06:24:50,653 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 06:24:50,653 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 06:24:50,653 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 06:24:50,653 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 06:24:50,653 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 06:24:50,654 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 06:24:50,654 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 06:24:50,654 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 06:24:50,654 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 06:24:50,654 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 06:24:50,654 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 06:24:50,655 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 06:24:50,655 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 06:24:50,656 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 06:24:50,690 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 06:24:50,700 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 06:24:50,703 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 06:24:50,705 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 06:24:50,705 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 06:24:50,705 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-01-25 06:24:50,863 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 06:24:50,868 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 06:24:50,869 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 06:24:50,869 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 06:24:50,874 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 06:24:50,875 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:24:50" (1/1) ... [2018-01-25 06:24:50,878 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13ee3542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:24:50, skipping insertion in model container [2018-01-25 06:24:50,878 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 06:24:50" (1/1) ... [2018-01-25 06:24:50,892 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:24:50,931 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 06:24:51,054 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:24:51,079 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 06:24:51,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:24:51 WrapperNode [2018-01-25 06:24:51,090 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 06:24:51,090 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 06:24:51,091 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 06:24:51,091 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 06:24:51,105 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:24:51" (1/1) ... [2018-01-25 06:24:51,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:24:51" (1/1) ... [2018-01-25 06:24:51,116 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:24:51" (1/1) ... [2018-01-25 06:24:51,116 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:24:51" (1/1) ... [2018-01-25 06:24:51,124 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:24:51" (1/1) ... [2018-01-25 06:24:51,129 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:24:51" (1/1) ... [2018-01-25 06:24:51,131 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:24:51" (1/1) ... [2018-01-25 06:24:51,134 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 06:24:51,135 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 06:24:51,135 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 06:24:51,135 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 06:24:51,136 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:24:51" (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-25 06:24:51,184 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 06:24:51,184 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 06:24:51,184 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 06:24:51,185 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 06:24:51,185 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 06:24:51,185 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 06:24:51,185 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 06:24:51,185 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 06:24:51,185 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 06:24:51,186 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 06:24:51,186 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 06:24:51,186 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 06:24:51,186 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 06:24:51,186 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-25 06:24:51,186 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 06:24:51,187 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 06:24:51,187 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 06:24:51,722 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 06:24:51,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:24:51 BoogieIcfgContainer [2018-01-25 06:24:51,723 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 06:24:51,724 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 06:24:51,724 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 06:24:51,726 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 06:24:51,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 06:24:50" (1/3) ... [2018-01-25 06:24:51,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e4b3dca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 06:24:51, skipping insertion in model container [2018-01-25 06:24:51,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 06:24:51" (2/3) ... [2018-01-25 06:24:51,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e4b3dca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 06:24:51, skipping insertion in model container [2018-01-25 06:24:51,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 06:24:51" (3/3) ... [2018-01-25 06:24:51,730 INFO L105 eAbstractionObserver]: Analyzing ICFG sll-reverse_simple_true-unreach-call_true-valid-memsafety.i [2018-01-25 06:24:51,737 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 06:24:51,744 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 53 error locations. [2018-01-25 06:24:51,784 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 06:24:51,784 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 06:24:51,784 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 06:24:51,784 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 06:24:51,784 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 06:24:51,784 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 06:24:51,785 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 06:24:51,785 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 06:24:51,785 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 06:24:51,804 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states. [2018-01-25 06:24:51,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-25 06:24:51,810 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:24:51,811 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:24:51,811 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:24:51,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1174279352, now seen corresponding path program 1 times [2018-01-25 06:24:51,817 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:24:51,857 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:24:51,857 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:24:51,857 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:24:51,857 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:24:51,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:24:51,900 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:24:51,962 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-25 06:24:51,964 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:24:51,964 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 06:24:51,964 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:24:51,967 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 06:24:51,977 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 06:24:51,978 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 06:24:51,980 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 4 states. [2018-01-25 06:24:52,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:24:52,314 INFO L93 Difference]: Finished difference Result 250 states and 294 transitions. [2018-01-25 06:24:52,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 06:24:52,315 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-25 06:24:52,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:24:52,325 INFO L225 Difference]: With dead ends: 250 [2018-01-25 06:24:52,325 INFO L226 Difference]: Without dead ends: 141 [2018-01-25 06:24:52,329 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:24:52,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-01-25 06:24:52,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 129. [2018-01-25 06:24:52,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-01-25 06:24:52,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 137 transitions. [2018-01-25 06:24:52,370 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 137 transitions. Word has length 8 [2018-01-25 06:24:52,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:24:52,371 INFO L432 AbstractCegarLoop]: Abstraction has 129 states and 137 transitions. [2018-01-25 06:24:52,371 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 06:24:52,371 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 137 transitions. [2018-01-25 06:24:52,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-25 06:24:52,372 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:24:52,372 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:24:52,372 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:24:52,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1174279351, now seen corresponding path program 1 times [2018-01-25 06:24:52,372 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:24:52,373 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:24:52,374 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:24:52,374 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:24:52,374 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:24:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:24:52,390 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:24:52,451 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-25 06:24:52,451 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:24:52,451 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 06:24:52,452 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:24:52,453 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 06:24:52,453 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 06:24:52,453 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 06:24:52,453 INFO L87 Difference]: Start difference. First operand 129 states and 137 transitions. Second operand 4 states. [2018-01-25 06:24:52,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:24:52,649 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2018-01-25 06:24:52,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 06:24:52,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-25 06:24:52,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:24:52,651 INFO L225 Difference]: With dead ends: 129 [2018-01-25 06:24:52,651 INFO L226 Difference]: Without dead ends: 127 [2018-01-25 06:24:52,652 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:24:52,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-25 06:24:52,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-01-25 06:24:52,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-01-25 06:24:52,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 135 transitions. [2018-01-25 06:24:52,664 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 135 transitions. Word has length 8 [2018-01-25 06:24:52,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:24:52,665 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 135 transitions. [2018-01-25 06:24:52,665 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 06:24:52,665 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 135 transitions. [2018-01-25 06:24:52,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 06:24:52,665 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:24:52,666 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:24:52,666 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:24:52,666 INFO L82 PathProgramCache]: Analyzing trace with hash -849816279, now seen corresponding path program 1 times [2018-01-25 06:24:52,666 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:24:52,667 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:24:52,668 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:24:52,668 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:24:52,668 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:24:52,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:24:52,691 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:24:52,787 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-25 06:24:52,788 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:24:52,788 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 06:24:52,788 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:24:52,788 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 06:24:52,788 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 06:24:52,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 06:24:52,789 INFO L87 Difference]: Start difference. First operand 127 states and 135 transitions. Second operand 4 states. [2018-01-25 06:24:52,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:24:52,931 INFO L93 Difference]: Finished difference Result 140 states and 149 transitions. [2018-01-25 06:24:52,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 06:24:52,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-25 06:24:52,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:24:52,932 INFO L225 Difference]: With dead ends: 140 [2018-01-25 06:24:52,932 INFO L226 Difference]: Without dead ends: 123 [2018-01-25 06:24:52,933 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 06:24:52,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-25 06:24:52,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2018-01-25 06:24:52,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-25 06:24:52,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2018-01-25 06:24:52,940 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 15 [2018-01-25 06:24:52,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:24:52,940 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2018-01-25 06:24:52,940 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 06:24:52,940 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2018-01-25 06:24:52,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 06:24:52,941 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:24:52,941 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:24:52,941 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:24:52,941 INFO L82 PathProgramCache]: Analyzing trace with hash -849816278, now seen corresponding path program 1 times [2018-01-25 06:24:52,941 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:24:52,942 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:24:52,942 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:24:52,942 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:24:52,942 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:24:52,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:24:52,959 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:24:53,039 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-25 06:24:53,039 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:24:53,039 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 06:24:53,040 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:24:53,040 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 06:24:53,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 06:24:53,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 06:24:53,041 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand 7 states. [2018-01-25 06:24:53,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:24:53,350 INFO L93 Difference]: Finished difference Result 166 states and 180 transitions. [2018-01-25 06:24:53,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:24:53,374 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-01-25 06:24:53,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:24:53,376 INFO L225 Difference]: With dead ends: 166 [2018-01-25 06:24:53,376 INFO L226 Difference]: Without dead ends: 155 [2018-01-25 06:24:53,376 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-01-25 06:24:53,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-01-25 06:24:53,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 144. [2018-01-25 06:24:53,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-01-25 06:24:53,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 158 transitions. [2018-01-25 06:24:53,390 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 158 transitions. Word has length 15 [2018-01-25 06:24:53,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:24:53,391 INFO L432 AbstractCegarLoop]: Abstraction has 144 states and 158 transitions. [2018-01-25 06:24:53,391 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 06:24:53,391 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 158 transitions. [2018-01-25 06:24:53,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 06:24:53,392 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:24:53,392 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:24:53,392 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:24:53,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1955436370, now seen corresponding path program 1 times [2018-01-25 06:24:53,393 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:24:53,393 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:24:53,393 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:24:53,394 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:24:53,394 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:24:53,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:24:53,408 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:24:53,456 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-25 06:24:53,456 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:24:53,456 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:24:53,456 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:24:53,457 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:24:53,457 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:24:53,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:24:53,457 INFO L87 Difference]: Start difference. First operand 144 states and 158 transitions. Second operand 6 states. [2018-01-25 06:24:53,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:24:53,760 INFO L93 Difference]: Finished difference Result 260 states and 284 transitions. [2018-01-25 06:24:53,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 06:24:53,761 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-01-25 06:24:53,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:24:53,763 INFO L225 Difference]: With dead ends: 260 [2018-01-25 06:24:53,763 INFO L226 Difference]: Without dead ends: 259 [2018-01-25 06:24:53,764 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-25 06:24:53,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-01-25 06:24:53,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 143. [2018-01-25 06:24:53,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-25 06:24:53,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 157 transitions. [2018-01-25 06:24:53,777 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 157 transitions. Word has length 18 [2018-01-25 06:24:53,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:24:53,777 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 157 transitions. [2018-01-25 06:24:53,777 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:24:53,777 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 157 transitions. [2018-01-25 06:24:53,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-25 06:24:53,778 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:24:53,778 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:24:53,778 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:24:53,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1955436371, now seen corresponding path program 1 times [2018-01-25 06:24:53,779 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:24:53,780 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:24:53,780 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:24:53,780 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:24:53,780 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:24:53,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:24:53,793 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:24:53,870 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-25 06:24:53,870 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:24:53,870 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:24:53,871 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:24:53,871 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:24:53,871 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:24:53,871 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:24:53,871 INFO L87 Difference]: Start difference. First operand 143 states and 157 transitions. Second operand 6 states. [2018-01-25 06:24:54,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:24:54,225 INFO L93 Difference]: Finished difference Result 258 states and 284 transitions. [2018-01-25 06:24:54,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 06:24:54,225 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-01-25 06:24:54,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:24:54,226 INFO L225 Difference]: With dead ends: 258 [2018-01-25 06:24:54,226 INFO L226 Difference]: Without dead ends: 254 [2018-01-25 06:24:54,227 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-01-25 06:24:54,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-01-25 06:24:54,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 133. [2018-01-25 06:24:54,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-25 06:24:54,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 146 transitions. [2018-01-25 06:24:54,239 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 146 transitions. Word has length 18 [2018-01-25 06:24:54,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:24:54,239 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 146 transitions. [2018-01-25 06:24:54,240 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:24:54,240 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 146 transitions. [2018-01-25 06:24:54,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 06:24:54,241 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:24:54,241 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] [2018-01-25 06:24:54,241 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:24:54,242 INFO L82 PathProgramCache]: Analyzing trace with hash 338517523, now seen corresponding path program 1 times [2018-01-25 06:24:54,242 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:24:54,243 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:24:54,243 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:24:54,243 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:24:54,243 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:24:54,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:24:54,262 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:24:54,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:24:54,424 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:24:54,424 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 06:24:54,424 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:24:54,424 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:24:54,425 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:24:54,425 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:24:54,425 INFO L87 Difference]: Start difference. First operand 133 states and 146 transitions. Second operand 6 states. [2018-01-25 06:24:54,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:24:54,581 INFO L93 Difference]: Finished difference Result 268 states and 298 transitions. [2018-01-25 06:24:54,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 06:24:54,582 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-25 06:24:54,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:24:54,582 INFO L225 Difference]: With dead ends: 268 [2018-01-25 06:24:54,582 INFO L226 Difference]: Without dead ends: 159 [2018-01-25 06:24:54,583 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-25 06:24:54,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-01-25 06:24:54,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 143. [2018-01-25 06:24:54,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-01-25 06:24:54,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 157 transitions. [2018-01-25 06:24:54,592 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 157 transitions. Word has length 26 [2018-01-25 06:24:54,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:24:54,592 INFO L432 AbstractCegarLoop]: Abstraction has 143 states and 157 transitions. [2018-01-25 06:24:54,592 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:24:54,592 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 157 transitions. [2018-01-25 06:24:54,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 06:24:54,593 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:24:54,593 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] [2018-01-25 06:24:54,594 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:24:54,594 INFO L82 PathProgramCache]: Analyzing trace with hash 244111700, now seen corresponding path program 1 times [2018-01-25 06:24:54,594 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:24:54,595 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:24:54,595 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:24:54,595 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:24:54,595 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:24:54,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:24:54,608 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:24:54,714 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-25 06:24:54,714 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:24:54,714 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 06:24:54,714 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:24:54,715 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:24:54,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:24:54,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:24:54,715 INFO L87 Difference]: Start difference. First operand 143 states and 157 transitions. Second operand 6 states. [2018-01-25 06:24:55,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:24:55,182 INFO L93 Difference]: Finished difference Result 228 states and 250 transitions. [2018-01-25 06:24:55,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 06:24:55,182 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-01-25 06:24:55,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:24:55,183 INFO L225 Difference]: With dead ends: 228 [2018-01-25 06:24:55,184 INFO L226 Difference]: Without dead ends: 165 [2018-01-25 06:24:55,185 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-01-25 06:24:55,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-01-25 06:24:55,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 155. [2018-01-25 06:24:55,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-01-25 06:24:55,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 171 transitions. [2018-01-25 06:24:55,195 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 171 transitions. Word has length 27 [2018-01-25 06:24:55,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:24:55,195 INFO L432 AbstractCegarLoop]: Abstraction has 155 states and 171 transitions. [2018-01-25 06:24:55,196 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:24:55,196 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 171 transitions. [2018-01-25 06:24:55,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 06:24:55,197 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:24:55,197 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, 1, 1] [2018-01-25 06:24:55,197 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:24:55,197 INFO L82 PathProgramCache]: Analyzing trace with hash 478726098, now seen corresponding path program 1 times [2018-01-25 06:24:55,197 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:24:55,198 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:24:55,198 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:24:55,198 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:24:55,198 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:24:55,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:24:55,211 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:24:55,268 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-25 06:24:55,268 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:24:55,268 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:24:55,268 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:24:55,269 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:24:55,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:24:55,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:24:55,269 INFO L87 Difference]: Start difference. First operand 155 states and 171 transitions. Second operand 6 states. [2018-01-25 06:24:55,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:24:55,576 INFO L93 Difference]: Finished difference Result 215 states and 235 transitions. [2018-01-25 06:24:55,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 06:24:55,576 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-01-25 06:24:55,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:24:55,578 INFO L225 Difference]: With dead ends: 215 [2018-01-25 06:24:55,578 INFO L226 Difference]: Without dead ends: 214 [2018-01-25 06:24:55,578 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-25 06:24:55,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-01-25 06:24:55,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 154. [2018-01-25 06:24:55,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-01-25 06:24:55,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 170 transitions. [2018-01-25 06:24:55,589 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 170 transitions. Word has length 30 [2018-01-25 06:24:55,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:24:55,590 INFO L432 AbstractCegarLoop]: Abstraction has 154 states and 170 transitions. [2018-01-25 06:24:55,590 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:24:55,590 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 170 transitions. [2018-01-25 06:24:55,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 06:24:55,591 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:24:55,591 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, 1, 1] [2018-01-25 06:24:55,592 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:24:55,592 INFO L82 PathProgramCache]: Analyzing trace with hash 478726099, now seen corresponding path program 1 times [2018-01-25 06:24:55,592 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:24:55,593 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:24:55,593 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:24:55,593 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:24:55,593 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:24:55,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:24:55,607 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:24:55,679 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-25 06:24:55,680 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 06:24:55,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 06:24:55,680 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 06:24:55,680 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 06:24:55,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 06:24:55,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 06:24:55,681 INFO L87 Difference]: Start difference. First operand 154 states and 170 transitions. Second operand 6 states. [2018-01-25 06:24:55,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 06:24:55,944 INFO L93 Difference]: Finished difference Result 210 states and 232 transitions. [2018-01-25 06:24:55,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 06:24:55,944 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-01-25 06:24:55,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 06:24:55,946 INFO L225 Difference]: With dead ends: 210 [2018-01-25 06:24:55,946 INFO L226 Difference]: Without dead ends: 208 [2018-01-25 06:24:55,946 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-01-25 06:24:55,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-01-25 06:24:55,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 152. [2018-01-25 06:24:55,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-01-25 06:24:55,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 168 transitions. [2018-01-25 06:24:55,957 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 168 transitions. Word has length 30 [2018-01-25 06:24:55,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 06:24:55,958 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 168 transitions. [2018-01-25 06:24:55,958 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 06:24:55,958 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 168 transitions. [2018-01-25 06:24:55,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-25 06:24:55,959 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 06:24:55,960 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 06:24:55,960 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr52EnsuresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 06:24:55,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1148482263, now seen corresponding path program 1 times [2018-01-25 06:24:55,960 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 06:24:55,961 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:24:55,961 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:24:55,961 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 06:24:55,961 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 06:24:55,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:24:55,979 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 06:24:56,387 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 06:24:56,388 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:24:56,388 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 06:24:56,390 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-01-25 06:24:56,392 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [5], [8], [12], [14], [17], [19], [20], [21], [24], [27], [28], [31], [37], [41], [43], [44], [46], [49], [57], [61], [66], [70], [76], [79], [244], [245], [249], [250], [251] [2018-01-25 06:24:56,452 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 06:24:56,452 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-25 06:25:52,657 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-25 06:25:52,657 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-25 06:25:52,658 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 06:25:52,658 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 06:25:52,658 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-25 06:25:52,671 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 06:25:52,671 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 06:25:52,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 06:25:52,711 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 06:25:52,716 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 06:25:52,717 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 06:25:52,722 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 06:25:52,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 06:25:52 BoogieIcfgContainer [2018-01-25 06:25:52,723 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 06:25:52,723 INFO L168 Benchmark]: Toolchain (without parser) took 61860.38 ms. Allocated memory was 296.2 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 256.1 MB in the beginning and 1.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 712.6 MB. Max. memory is 5.3 GB. [2018-01-25 06:25:52,724 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 296.2 MB. Free memory is still 262.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 06:25:52,725 INFO L168 Benchmark]: CACSL2BoogieTranslator took 221.41 ms. Allocated memory is still 296.2 MB. Free memory was 255.1 MB in the beginning and 243.1 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-25 06:25:52,725 INFO L168 Benchmark]: Boogie Preprocessor took 43.78 ms. Allocated memory is still 296.2 MB. Free memory was 243.1 MB in the beginning and 241.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 06:25:52,725 INFO L168 Benchmark]: RCFGBuilder took 588.17 ms. Allocated memory is still 296.2 MB. Free memory was 241.1 MB in the beginning and 205.9 MB in the end (delta: 35.3 MB). Peak memory consumption was 35.3 MB. Max. memory is 5.3 GB. [2018-01-25 06:25:52,725 INFO L168 Benchmark]: TraceAbstraction took 60999.09 ms. Allocated memory was 296.2 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 205.9 MB in the beginning and 1.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 662.4 MB. Max. memory is 5.3 GB. [2018-01-25 06:25:52,727 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.12 ms. Allocated memory is still 296.2 MB. Free memory is still 262.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 221.41 ms. Allocated memory is still 296.2 MB. Free memory was 255.1 MB in the beginning and 243.1 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 43.78 ms. Allocated memory is still 296.2 MB. Free memory was 243.1 MB in the beginning and 241.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 588.17 ms. Allocated memory is still 296.2 MB. Free memory was 241.1 MB in the beginning and 205.9 MB in the end (delta: 35.3 MB). Peak memory consumption was 35.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 60999.09 ms. Allocated memory was 296.2 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 205.9 MB in the beginning and 1.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 662.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1050). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 985). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1009). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1009). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 986). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 991). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1002). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1038). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1009). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 991). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1039). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 991). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1038). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 991). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1050). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1031). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 991). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 995). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1031). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1009). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1016). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 981]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 981). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1049). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1002). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 986). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1039). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1016). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 985). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 991). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 991). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 991). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 998). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was analyzing trace of length 36 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 13 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 134 locations, 53 error locations. TIMEOUT Result, 60.9s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 2.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 961 SDtfs, 1529 SDslu, 1780 SDs, 0 SdLazy, 2263 SolverSat, 139 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 56.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 406 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 195 NumberOfCodeBlocks, 195 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 185 ConstructedInterpolants, 0 QuantifiedInterpolants, 14894 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-reverse_simple_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_06-25-52-739.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-reverse_simple_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_06-25-52-739.csv Completed graceful shutdown