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/list-ext-properties/list-ext_flag_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 05:55:39,449 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:55:39,450 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:55:39,466 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:55:39,466 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:55:39,467 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:55:39,468 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:55:39,470 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:55:39,472 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:55:39,473 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:55:39,474 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:55:39,474 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:55:39,475 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:55:39,476 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:55:39,477 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:55:39,480 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:55:39,482 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:55:39,484 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:55:39,486 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:55:39,487 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:55:39,489 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:55:39,490 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:55:39,490 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:55:39,491 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:55:39,492 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:55:39,493 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:55:39,493 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:55:39,494 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:55:39,494 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:55:39,494 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:55:39,495 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:55:39,495 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 05:55:39,505 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:55:39,506 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:55:39,507 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:55:39,507 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:55:39,507 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:55:39,507 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:55:39,507 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:55:39,508 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:55:39,508 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:55:39,508 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:55:39,509 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:55:39,509 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:55:39,509 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:55:39,509 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:55:39,509 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:55:39,510 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:55:39,510 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:55:39,510 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:55:39,510 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:55:39,510 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:55:39,511 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:55:39,511 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:55:39,511 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:55:39,511 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:55:39,511 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:55:39,512 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:55:39,512 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:55:39,512 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:55:39,512 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:55:39,512 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:55:39,513 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:55:39,513 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:55:39,513 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:55:39,513 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:55:39,514 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:55:39,514 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:55:39,550 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:55:39,563 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:55:39,566 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:55:39,568 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:55:39,568 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:55:39,568 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/list-ext_flag_1_true-valid-memsafety.i [2018-01-25 05:55:39,773 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:55:39,780 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:55:39,781 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:55:39,781 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:55:39,788 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:55:39,789 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:55:39" (1/1) ... [2018-01-25 05:55:39,792 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a76578b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:55:39, skipping insertion in model container [2018-01-25 05:55:39,793 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:55:39" (1/1) ... [2018-01-25 05:55:39,812 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:55:39,853 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:55:39,970 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:55:39,988 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:55:39,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:55:39 WrapperNode [2018-01-25 05:55:39,996 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:55:39,997 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:55:39,997 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:55:39,997 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:55:40,011 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:55:39" (1/1) ... [2018-01-25 05:55:40,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:55:39" (1/1) ... [2018-01-25 05:55:40,024 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:55:39" (1/1) ... [2018-01-25 05:55:40,024 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:55:39" (1/1) ... [2018-01-25 05:55:40,030 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:55:39" (1/1) ... [2018-01-25 05:55:40,033 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:55:39" (1/1) ... [2018-01-25 05:55:40,035 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:55:39" (1/1) ... [2018-01-25 05:55:40,037 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:55:40,037 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:55:40,037 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:55:40,037 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:55:40,039 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:55:39" (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 05:55:40,089 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:55:40,089 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:55:40,089 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-01-25 05:55:40,090 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:55:40,090 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 05:55:40,090 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 05:55:40,090 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 05:55:40,090 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 05:55:40,090 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:55:40,091 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:55:40,091 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:55:40,091 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-25 05:55:40,091 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 05:55:40,091 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 05:55:40,091 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 05:55:40,092 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-01-25 05:55:40,092 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:55:40,092 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:55:40,092 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:55:40,529 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:55:40,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:55:40 BoogieIcfgContainer [2018-01-25 05:55:40,531 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:55:40,532 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:55:40,532 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:55:40,534 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:55:40,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:55:39" (1/3) ... [2018-01-25 05:55:40,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68372ef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:55:40, skipping insertion in model container [2018-01-25 05:55:40,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:55:39" (2/3) ... [2018-01-25 05:55:40,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68372ef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:55:40, skipping insertion in model container [2018-01-25 05:55:40,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:55:40" (3/3) ... [2018-01-25 05:55:40,539 INFO L105 eAbstractionObserver]: Analyzing ICFG list-ext_flag_1_true-valid-memsafety.i [2018-01-25 05:55:40,546 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:55:40,554 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 37 error locations. [2018-01-25 05:55:40,598 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:55:40,598 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:55:40,598 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:55:40,598 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:55:40,599 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:55:40,599 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:55:40,599 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:55:40,599 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:55:40,600 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:55:40,619 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states. [2018-01-25 05:55:40,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-25 05:55:40,626 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:55:40,628 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:55:40,628 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr36EnsuresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 05:55:40,632 INFO L82 PathProgramCache]: Analyzing trace with hash 463338555, now seen corresponding path program 1 times [2018-01-25 05:55:40,634 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:55:40,680 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:55:40,680 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:55:40,681 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:55:40,681 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:55:40,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:55:40,734 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:55:40,769 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 05:55:40,771 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:55:40,772 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 05:55:40,772 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:55:40,775 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-25 05:55:40,786 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-25 05:55:40,787 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-25 05:55:40,790 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 2 states. [2018-01-25 05:55:40,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:55:40,903 INFO L93 Difference]: Finished difference Result 152 states and 171 transitions. [2018-01-25 05:55:40,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-25 05:55:40,905 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-01-25 05:55:40,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:55:40,913 INFO L225 Difference]: With dead ends: 152 [2018-01-25 05:55:40,914 INFO L226 Difference]: Without dead ends: 89 [2018-01-25 05:55:40,917 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-25 05:55:40,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-25 05:55:40,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-01-25 05:55:40,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-25 05:55:40,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2018-01-25 05:55:40,951 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 12 [2018-01-25 05:55:40,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:55:40,951 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2018-01-25 05:55:40,951 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-25 05:55:40,951 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2018-01-25 05:55:40,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 05:55:40,952 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:55:40,952 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:55:40,952 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr36EnsuresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 05:55:40,952 INFO L82 PathProgramCache]: Analyzing trace with hash -753673629, now seen corresponding path program 1 times [2018-01-25 05:55:40,952 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:55:40,954 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:55:40,954 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:55:40,954 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:55:40,954 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:55:40,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:55:40,976 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:55:41,056 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 05:55:41,057 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:55:41,057 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:55:41,057 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:55:41,059 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:55:41,059 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:55:41,060 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:55:41,060 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand 5 states. [2018-01-25 05:55:41,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:55:41,331 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2018-01-25 05:55:41,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:55:41,331 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-25 05:55:41,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:55:41,333 INFO L225 Difference]: With dead ends: 115 [2018-01-25 05:55:41,333 INFO L226 Difference]: Without dead ends: 97 [2018-01-25 05:55:41,334 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:55:41,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-25 05:55:41,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 85. [2018-01-25 05:55:41,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-25 05:55:41,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2018-01-25 05:55:41,345 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 15 [2018-01-25 05:55:41,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:55:41,345 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2018-01-25 05:55:41,345 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:55:41,346 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2018-01-25 05:55:41,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 05:55:41,346 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:55:41,346 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:55:41,347 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr36EnsuresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 05:55:41,347 INFO L82 PathProgramCache]: Analyzing trace with hash -753673628, now seen corresponding path program 1 times [2018-01-25 05:55:41,347 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:55:41,348 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:55:41,348 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:55:41,349 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:55:41,349 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:55:41,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:55:41,368 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:55:41,465 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 05:55:41,465 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:55:41,466 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:55:41,466 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:55:41,466 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:55:41,467 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:55:41,467 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:55:41,467 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand 5 states. [2018-01-25 05:55:41,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:55:41,687 INFO L93 Difference]: Finished difference Result 136 states and 146 transitions. [2018-01-25 05:55:41,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:55:41,688 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-25 05:55:41,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:55:41,689 INFO L225 Difference]: With dead ends: 136 [2018-01-25 05:55:41,690 INFO L226 Difference]: Without dead ends: 118 [2018-01-25 05:55:41,690 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:55:41,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-25 05:55:41,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 110. [2018-01-25 05:55:41,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-01-25 05:55:41,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2018-01-25 05:55:41,703 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 15 [2018-01-25 05:55:41,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:55:41,703 INFO L432 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2018-01-25 05:55:41,703 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:55:41,704 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2018-01-25 05:55:41,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 05:55:41,705 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:55:41,705 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:55:41,705 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr36EnsuresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 05:55:41,705 INFO L82 PathProgramCache]: Analyzing trace with hash 435110854, now seen corresponding path program 1 times [2018-01-25 05:55:41,706 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:55:41,707 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:55:41,707 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:55:41,707 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:55:41,707 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:55:41,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:55:41,733 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:55:41,876 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 05:55:41,877 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:55:41,877 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:55:41,877 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:55:41,877 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:55:41,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:55:41,878 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:55:41,878 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 6 states. [2018-01-25 05:55:42,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:55:42,118 INFO L93 Difference]: Finished difference Result 167 states and 183 transitions. [2018-01-25 05:55:42,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 05:55:42,118 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-01-25 05:55:42,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:55:42,120 INFO L225 Difference]: With dead ends: 167 [2018-01-25 05:55:42,120 INFO L226 Difference]: Without dead ends: 163 [2018-01-25 05:55:42,121 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-25 05:55:42,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-01-25 05:55:42,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 138. [2018-01-25 05:55:42,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-01-25 05:55:42,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 160 transitions. [2018-01-25 05:55:42,145 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 160 transitions. Word has length 28 [2018-01-25 05:55:42,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:55:42,145 INFO L432 AbstractCegarLoop]: Abstraction has 138 states and 160 transitions. [2018-01-25 05:55:42,145 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:55:42,146 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 160 transitions. [2018-01-25 05:55:42,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 05:55:42,147 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:55:42,147 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:55:42,147 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr36EnsuresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 05:55:42,148 INFO L82 PathProgramCache]: Analyzing trace with hash 560475115, now seen corresponding path program 1 times [2018-01-25 05:55:42,148 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:55:42,149 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:55:42,149 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:55:42,149 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:55:42,149 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:55:42,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:55:42,168 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:55:42,276 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 05:55:42,276 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:55:42,276 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 05:55:42,277 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:55:42,277 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 05:55:42,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 05:55:42,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:55:42,278 INFO L87 Difference]: Start difference. First operand 138 states and 160 transitions. Second operand 7 states. [2018-01-25 05:55:42,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:55:42,506 INFO L93 Difference]: Finished difference Result 195 states and 209 transitions. [2018-01-25 05:55:42,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 05:55:42,507 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-01-25 05:55:42,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:55:42,508 INFO L225 Difference]: With dead ends: 195 [2018-01-25 05:55:42,508 INFO L226 Difference]: Without dead ends: 146 [2018-01-25 05:55:42,508 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:55:42,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-01-25 05:55:42,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 119. [2018-01-25 05:55:42,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-25 05:55:42,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 130 transitions. [2018-01-25 05:55:42,519 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 130 transitions. Word has length 28 [2018-01-25 05:55:42,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:55:42,519 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 130 transitions. [2018-01-25 05:55:42,519 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 05:55:42,519 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 130 transitions. [2018-01-25 05:55:42,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 05:55:42,520 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:55:42,521 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] [2018-01-25 05:55:42,521 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr36EnsuresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 05:55:42,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1958112025, now seen corresponding path program 1 times [2018-01-25 05:55:42,521 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:55:42,522 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:55:42,522 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:55:42,522 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:55:42,522 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:55:42,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:55:42,540 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:55:42,602 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:55:42,602 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:55:42,602 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 05:55:42,602 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:55:42,603 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 05:55:42,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 05:55:42,603 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:55:42,603 INFO L87 Difference]: Start difference. First operand 119 states and 130 transitions. Second operand 7 states. [2018-01-25 05:55:42,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:55:42,869 INFO L93 Difference]: Finished difference Result 122 states and 133 transitions. [2018-01-25 05:55:42,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 05:55:42,869 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-01-25 05:55:42,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:55:42,870 INFO L225 Difference]: With dead ends: 122 [2018-01-25 05:55:42,870 INFO L226 Difference]: Without dead ends: 120 [2018-01-25 05:55:42,871 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-01-25 05:55:42,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-25 05:55:42,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2018-01-25 05:55:42,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-25 05:55:42,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 128 transitions. [2018-01-25 05:55:42,882 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 128 transitions. Word has length 30 [2018-01-25 05:55:42,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:55:42,882 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 128 transitions. [2018-01-25 05:55:42,883 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 05:55:42,883 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 128 transitions. [2018-01-25 05:55:42,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 05:55:42,884 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:55:42,884 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] [2018-01-25 05:55:42,884 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr36EnsuresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 05:55:42,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1958112026, now seen corresponding path program 1 times [2018-01-25 05:55:42,885 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:55:42,885 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:55:42,886 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:55:42,886 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:55:42,886 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:55:42,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:55:42,902 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:55:43,027 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:55:43,028 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:55:43,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 05:55:43,028 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:55:43,028 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 05:55:43,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 05:55:43,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:55:43,029 INFO L87 Difference]: Start difference. First operand 117 states and 128 transitions. Second operand 7 states. [2018-01-25 05:55:43,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:55:43,322 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2018-01-25 05:55:43,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 05:55:43,322 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-01-25 05:55:43,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:55:43,323 INFO L225 Difference]: With dead ends: 140 [2018-01-25 05:55:43,324 INFO L226 Difference]: Without dead ends: 132 [2018-01-25 05:55:43,324 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-01-25 05:55:43,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-01-25 05:55:43,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 98. [2018-01-25 05:55:43,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-25 05:55:43,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2018-01-25 05:55:43,334 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 30 [2018-01-25 05:55:43,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:55:43,335 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2018-01-25 05:55:43,335 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 05:55:43,335 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2018-01-25 05:55:43,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 05:55:43,336 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:55:43,336 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:55:43,337 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr36EnsuresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 05:55:43,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1625837310, now seen corresponding path program 1 times [2018-01-25 05:55:43,337 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:55:43,338 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:55:43,338 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:55:43,338 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:55:43,339 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:55:43,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:55:43,354 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:55:43,533 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 05:55:43,533 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:55:43,533 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 05:55:43,533 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:55:43,533 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 05:55:43,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 05:55:43,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:55:43,534 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand 8 states. [2018-01-25 05:55:43,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:55:43,705 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2018-01-25 05:55:43,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 05:55:43,705 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-01-25 05:55:43,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:55:43,706 INFO L225 Difference]: With dead ends: 135 [2018-01-25 05:55:43,706 INFO L226 Difference]: Without dead ends: 105 [2018-01-25 05:55:43,707 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-01-25 05:55:43,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-25 05:55:43,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 87. [2018-01-25 05:55:43,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-25 05:55:43,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2018-01-25 05:55:43,712 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 31 [2018-01-25 05:55:43,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:55:43,712 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2018-01-25 05:55:43,712 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 05:55:43,712 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2018-01-25 05:55:43,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-25 05:55:43,714 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:55:43,714 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:55:43,714 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr36EnsuresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-01-25 05:55:43,714 INFO L82 PathProgramCache]: Analyzing trace with hash 77859536, now seen corresponding path program 1 times [2018-01-25 05:55:43,714 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:55:43,715 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:55:43,716 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:55:43,716 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:55:43,716 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:55:43,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:55:43,738 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:55:44,003 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:55:44,003 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:55:44,003 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:55:44,004 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 44 with the following transitions: [2018-01-25 05:55:44,007 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [8], [10], [14], [16], [19], [25], [27], [28], [31], [32], [37], [38], [47], [48], [54], [56], [59], [62], [66], [69], [72], [76], [78], [83], [118], [125], [129], [131], [136], [150], [153], [156], [161], [162], [170], [171], [172] [2018-01-25 05:55:44,079 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:55:44,080 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-25 05:56:39,439 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-25 05:56:39,439 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-25 05:56:39,440 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:56:39,440 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:56:39,440 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 05:56:39,447 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:56:39,447 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:56:39,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:56:39,498 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:56:39,503 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 05:56:39,503 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 05:56:39,508 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 05:56:39,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 05:56:39 BoogieIcfgContainer [2018-01-25 05:56:39,508 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 05:56:39,509 INFO L168 Benchmark]: Toolchain (without parser) took 59736.12 ms. Allocated memory was 308.3 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 267.4 MB in the beginning and 1.6 GB in the end (delta: -1.3 GB). Peak memory consumption was 682.8 MB. Max. memory is 5.3 GB. [2018-01-25 05:56:39,511 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 308.3 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 05:56:39,511 INFO L168 Benchmark]: CACSL2BoogieTranslator took 215.92 ms. Allocated memory is still 308.3 MB. Free memory was 267.4 MB in the beginning and 255.4 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:56:39,511 INFO L168 Benchmark]: Boogie Preprocessor took 39.84 ms. Allocated memory is still 308.3 MB. Free memory was 255.4 MB in the beginning and 253.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:56:39,512 INFO L168 Benchmark]: RCFGBuilder took 493.54 ms. Allocated memory is still 308.3 MB. Free memory was 253.4 MB in the beginning and 226.9 MB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 5.3 GB. [2018-01-25 05:56:39,512 INFO L168 Benchmark]: TraceAbstraction took 58976.70 ms. Allocated memory was 308.3 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 226.9 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 642.3 MB. Max. memory is 5.3 GB. [2018-01-25 05:56:39,514 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 308.3 MB. Free memory is still 273.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 215.92 ms. Allocated memory is still 308.3 MB. Free memory was 267.4 MB in the beginning and 255.4 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.84 ms. Allocated memory is still 308.3 MB. Free memory was 255.4 MB in the beginning and 253.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 493.54 ms. Allocated memory is still 308.3 MB. Free memory was 253.4 MB in the beginning and 226.9 MB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 58976.70 ms. Allocated memory was 308.3 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 226.9 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 642.3 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 pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 627]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 627). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 664). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 669). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 655). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 669). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 99 locations, 37 error locations. TIMEOUT Result, 58.9s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 491 SDtfs, 1292 SDslu, 964 SDs, 0 SdLazy, 1108 SolverSat, 126 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 55.4s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 127 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 189 NumberOfCodeBlocks, 189 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 181 ConstructedInterpolants, 0 QuantifiedInterpolants, 24956 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 12/12 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/list-ext_flag_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_05-56-39-523.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list-ext_flag_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_05-56-39-523.csv Completed graceful shutdown