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_preciseopt.epf -i ../../../trunk/examples/svcomp/list-ext-properties/test-0158_1_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 03:19:42,597 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 03:19:42,600 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 03:19:42,616 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 03:19:42,616 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 03:19:42,617 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 03:19:42,618 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 03:19:42,619 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 03:19:42,622 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 03:19:42,623 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 03:19:42,626 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 03:19:42,626 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 03:19:42,627 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 03:19:42,629 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 03:19:42,630 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 03:19:42,633 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 03:19:42,635 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 03:19:42,638 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 03:19:42,639 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 03:19:42,640 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 03:19:42,643 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 03:19:42,644 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 03:19:42,644 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 03:19:42,645 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 03:19:42,646 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 03:19:42,648 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 03:19:42,649 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 03:19:42,650 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 03:19:42,650 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 03:19:42,650 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 03:19:42,651 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 03:19:42,651 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_preciseopt.epf [2018-01-25 03:19:42,663 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 03:19:42,664 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 03:19:42,665 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 03:19:42,665 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 03:19:42,666 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 03:19:42,666 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 03:19:42,666 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 03:19:42,666 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 03:19:42,666 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 03:19:42,667 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 03:19:42,667 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 03:19:42,668 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 03:19:42,668 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 03:19:42,668 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 03:19:42,668 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 03:19:42,668 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 03:19:42,669 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 03:19:42,669 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 03:19:42,669 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 03:19:42,669 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 03:19:42,670 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 03:19:42,670 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 03:19:42,670 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 03:19:42,670 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 03:19:42,670 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 03:19:42,670 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 03:19:42,671 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 03:19:42,671 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 03:19:42,671 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 03:19:42,671 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 03:19:42,671 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 03:19:42,672 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 03:19:42,672 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 03:19:42,672 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 03:19:42,672 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 03:19:42,673 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 03:19:42,674 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 03:19:42,712 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 03:19:42,728 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 03:19:42,733 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 03:19:42,735 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 03:19:42,735 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 03:19:42,736 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0158_1_true-valid-memsafety_true-termination.i [2018-01-25 03:19:42,997 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 03:19:43,005 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 03:19:43,006 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 03:19:43,006 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 03:19:43,014 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 03:19:43,016 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:19:42" (1/1) ... [2018-01-25 03:19:43,020 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@84e0f7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:19:43, skipping insertion in model container [2018-01-25 03:19:43,020 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:19:42" (1/1) ... [2018-01-25 03:19:43,040 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:19:43,082 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:19:43,237 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:19:43,253 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:19:43,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:19:43 WrapperNode [2018-01-25 03:19:43,263 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 03:19:43,264 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 03:19:43,265 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 03:19:43,265 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 03:19:43,283 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:19:43" (1/1) ... [2018-01-25 03:19:43,284 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:19:43" (1/1) ... [2018-01-25 03:19:43,297 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:19:43" (1/1) ... [2018-01-25 03:19:43,297 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:19:43" (1/1) ... [2018-01-25 03:19:43,301 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:19:43" (1/1) ... [2018-01-25 03:19:43,303 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:19:43" (1/1) ... [2018-01-25 03:19:43,305 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:19:43" (1/1) ... [2018-01-25 03:19:43,307 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 03:19:43,307 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 03:19:43,308 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 03:19:43,308 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 03:19:43,309 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:19:43" (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 03:19:43,368 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 03:19:43,368 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 03:19:43,368 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 03:19:43,368 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 03:19:43,369 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 03:19:43,369 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 03:19:43,369 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 03:19:43,369 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 03:19:43,369 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 03:19:43,369 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 03:19:43,370 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 03:19:43,370 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 03:19:43,370 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 03:19:43,370 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 03:19:43,370 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 03:19:43,370 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 03:19:43,599 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 03:19:43,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:19:43 BoogieIcfgContainer [2018-01-25 03:19:43,600 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 03:19:43,601 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 03:19:43,601 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 03:19:43,603 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 03:19:43,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 03:19:42" (1/3) ... [2018-01-25 03:19:43,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27bee51c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:19:43, skipping insertion in model container [2018-01-25 03:19:43,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:19:43" (2/3) ... [2018-01-25 03:19:43,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27bee51c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:19:43, skipping insertion in model container [2018-01-25 03:19:43,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:19:43" (3/3) ... [2018-01-25 03:19:43,609 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0158_1_true-valid-memsafety_true-termination.i [2018-01-25 03:19:43,618 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 03:19:43,627 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-25 03:19:43,675 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 03:19:43,676 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 03:19:43,676 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 03:19:43,676 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 03:19:43,676 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 03:19:43,676 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 03:19:43,677 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 03:19:43,677 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 03:19:43,678 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 03:19:43,699 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2018-01-25 03:19:43,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-25 03:19:43,706 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:19:43,707 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:19:43,708 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-25 03:19:43,713 INFO L82 PathProgramCache]: Analyzing trace with hash 32614707, now seen corresponding path program 1 times [2018-01-25 03:19:43,716 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:19:43,775 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:43,775 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:19:43,775 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:43,776 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:19:43,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:19:43,826 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:19:43,951 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 03:19:43,953 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:19:43,954 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 03:19:43,954 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:19:43,956 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 03:19:43,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 03:19:43,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:19:43,970 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 3 states. [2018-01-25 03:19:44,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:19:44,071 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-01-25 03:19:44,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 03:19:44,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-01-25 03:19:44,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:19:44,148 INFO L225 Difference]: With dead ends: 39 [2018-01-25 03:19:44,148 INFO L226 Difference]: Without dead ends: 30 [2018-01-25 03:19:44,151 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:19:44,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-01-25 03:19:44,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-01-25 03:19:44,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-01-25 03:19:44,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-01-25 03:19:44,182 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 8 [2018-01-25 03:19:44,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:19:44,182 INFO L432 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-01-25 03:19:44,182 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 03:19:44,183 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-01-25 03:19:44,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-25 03:19:44,183 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:19:44,183 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:19:44,183 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-25 03:19:44,183 INFO L82 PathProgramCache]: Analyzing trace with hash 32614708, now seen corresponding path program 1 times [2018-01-25 03:19:44,183 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:19:44,184 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:44,185 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:19:44,185 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:44,185 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:19:44,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:19:44,204 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:19:44,281 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 03:19:44,282 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:19:44,282 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:19:44,282 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:19:44,284 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:19:44,284 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:19:44,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:19:44,285 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 4 states. [2018-01-25 03:19:44,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:19:44,381 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-01-25 03:19:44,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 03:19:44,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-25 03:19:44,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:19:44,382 INFO L225 Difference]: With dead ends: 30 [2018-01-25 03:19:44,382 INFO L226 Difference]: Without dead ends: 24 [2018-01-25 03:19:44,383 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:19:44,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-01-25 03:19:44,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-01-25 03:19:44,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-01-25 03:19:44,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-01-25 03:19:44,388 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 8 [2018-01-25 03:19:44,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:19:44,388 INFO L432 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-01-25 03:19:44,388 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:19:44,388 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-01-25 03:19:44,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 03:19:44,388 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:19:44,388 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:19:44,389 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-25 03:19:44,389 INFO L82 PathProgramCache]: Analyzing trace with hash 607540962, now seen corresponding path program 1 times [2018-01-25 03:19:44,389 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:19:44,390 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:44,390 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:19:44,390 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:44,390 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:19:44,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:19:44,411 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:19:44,530 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 03:19:44,530 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:19:44,530 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:19:44,531 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:19:44,531 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:19:44,531 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:19:44,532 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:19:44,532 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 5 states. [2018-01-25 03:19:44,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:19:44,587 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-01-25 03:19:44,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:19:44,587 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-25 03:19:44,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:19:44,588 INFO L225 Difference]: With dead ends: 24 [2018-01-25 03:19:44,589 INFO L226 Difference]: Without dead ends: 23 [2018-01-25 03:19:44,589 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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 03:19:44,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-01-25 03:19:44,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-01-25 03:19:44,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-01-25 03:19:44,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-01-25 03:19:44,594 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 15 [2018-01-25 03:19:44,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:19:44,595 INFO L432 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-01-25 03:19:44,595 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:19:44,595 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-01-25 03:19:44,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 03:19:44,596 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:19:44,596 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:19:44,596 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-25 03:19:44,597 INFO L82 PathProgramCache]: Analyzing trace with hash 607540963, now seen corresponding path program 1 times [2018-01-25 03:19:44,597 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:19:44,598 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:44,598 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:19:44,599 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:44,599 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:19:44,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:19:44,615 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:19:44,672 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 03:19:44,672 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:19:44,673 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:19:44,673 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:19:44,674 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:19:44,674 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:19:44,674 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:19:44,674 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 5 states. [2018-01-25 03:19:44,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:19:44,765 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-01-25 03:19:44,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:19:44,765 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-25 03:19:44,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:19:44,766 INFO L225 Difference]: With dead ends: 23 [2018-01-25 03:19:44,766 INFO L226 Difference]: Without dead ends: 22 [2018-01-25 03:19:44,767 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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 03:19:44,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-01-25 03:19:44,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-01-25 03:19:44,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-01-25 03:19:44,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-01-25 03:19:44,770 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 15 [2018-01-25 03:19:44,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:19:44,771 INFO L432 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-01-25 03:19:44,771 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:19:44,771 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-01-25 03:19:44,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-25 03:19:44,772 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:19:44,772 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:19:44,772 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr14EnsuresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation]=== [2018-01-25 03:19:44,772 INFO L82 PathProgramCache]: Analyzing trace with hash -510727324, now seen corresponding path program 1 times [2018-01-25 03:19:44,772 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:19:44,773 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:44,773 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:19:44,774 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:19:44,774 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:19:44,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:19:44,793 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:19:44,988 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 03:19:44,989 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:19:44,989 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 03:19:44,989 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:19:44,989 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 03:19:44,990 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 03:19:44,990 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-25 03:19:44,990 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 8 states. [2018-01-25 03:19:45,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:19:45,200 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-01-25 03:19:45,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 03:19:45,201 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-01-25 03:19:45,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:19:45,201 INFO L225 Difference]: With dead ends: 22 [2018-01-25 03:19:45,201 INFO L226 Difference]: Without dead ends: 0 [2018-01-25 03:19:45,202 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-01-25 03:19:45,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-25 03:19:45,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-25 03:19:45,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-25 03:19:45,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-25 03:19:45,203 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2018-01-25 03:19:45,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:19:45,204 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-25 03:19:45,204 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 03:19:45,204 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-25 03:19:45,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-25 03:19:45,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-25 03:19:45,224 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 641) no Hoare annotation was computed. [2018-01-25 03:19:45,225 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 641) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 03:19:45,225 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 641) no Hoare annotation was computed. [2018-01-25 03:19:45,225 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 641) the Hoare annotation is: true [2018-01-25 03:19:45,225 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 641) no Hoare annotation was computed. [2018-01-25 03:19:45,225 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 641) the Hoare annotation is: true [2018-01-25 03:19:45,225 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 641) no Hoare annotation was computed. [2018-01-25 03:19:45,225 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 641) no Hoare annotation was computed. [2018-01-25 03:19:45,225 INFO L401 ceAbstractionStarter]: For program point mainErr6RequiresViolation(lines 1 641) no Hoare annotation was computed. [2018-01-25 03:19:45,225 INFO L401 ceAbstractionStarter]: For program point L630'(line 630) no Hoare annotation was computed. [2018-01-25 03:19:45,225 INFO L401 ceAbstractionStarter]: For program point L622(lines 622 629) no Hoare annotation was computed. [2018-01-25 03:19:45,226 INFO L401 ceAbstractionStarter]: For program point L622''(lines 622 629) no Hoare annotation was computed. [2018-01-25 03:19:45,226 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 641) no Hoare annotation was computed. [2018-01-25 03:19:45,226 INFO L401 ceAbstractionStarter]: For program point mainErr2RequiresViolation(lines 1 641) no Hoare annotation was computed. [2018-01-25 03:19:45,226 INFO L401 ceAbstractionStarter]: For program point mainErr9RequiresViolation(lines 1 641) no Hoare annotation was computed. [2018-01-25 03:19:45,226 INFO L401 ceAbstractionStarter]: For program point mainErr5RequiresViolation(lines 1 641) no Hoare annotation was computed. [2018-01-25 03:19:45,226 INFO L401 ceAbstractionStarter]: For program point mainErr13RequiresViolation(lines 1 641) no Hoare annotation was computed. [2018-01-25 03:19:45,226 INFO L401 ceAbstractionStarter]: For program point mainErr14EnsuresViolation(lines 620 641) no Hoare annotation was computed. [2018-01-25 03:19:45,226 INFO L401 ceAbstractionStarter]: For program point L639'(line 639) no Hoare annotation was computed. [2018-01-25 03:19:45,226 INFO L401 ceAbstractionStarter]: For program point L630(line 630) no Hoare annotation was computed. [2018-01-25 03:19:45,226 INFO L401 ceAbstractionStarter]: For program point mainErr3RequiresViolation(lines 1 641) no Hoare annotation was computed. [2018-01-25 03:19:45,226 INFO L401 ceAbstractionStarter]: For program point mainErr11RequiresViolation(lines 1 641) no Hoare annotation was computed. [2018-01-25 03:19:45,226 INFO L401 ceAbstractionStarter]: For program point mainErr8RequiresViolation(lines 1 641) no Hoare annotation was computed. [2018-01-25 03:19:45,226 INFO L401 ceAbstractionStarter]: For program point L634(line 634) no Hoare annotation was computed. [2018-01-25 03:19:45,227 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 620 641) no Hoare annotation was computed. [2018-01-25 03:19:45,227 INFO L401 ceAbstractionStarter]: For program point mainErr4RequiresViolation(lines 1 641) no Hoare annotation was computed. [2018-01-25 03:19:45,227 INFO L401 ceAbstractionStarter]: For program point L632(line 632) no Hoare annotation was computed. [2018-01-25 03:19:45,227 INFO L401 ceAbstractionStarter]: For program point L631(lines 631 635) no Hoare annotation was computed. [2018-01-25 03:19:45,227 INFO L401 ceAbstractionStarter]: For program point mainErr12RequiresViolation(lines 1 641) no Hoare annotation was computed. [2018-01-25 03:19:45,227 INFO L401 ceAbstractionStarter]: For program point L637(line 637) no Hoare annotation was computed. [2018-01-25 03:19:45,227 INFO L401 ceAbstractionStarter]: For program point L636(line 636) no Hoare annotation was computed. [2018-01-25 03:19:45,227 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 620 641) no Hoare annotation was computed. [2018-01-25 03:19:45,227 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 620 641) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 03:19:45,227 INFO L401 ceAbstractionStarter]: For program point mainErr7RequiresViolation(lines 1 641) no Hoare annotation was computed. [2018-01-25 03:19:45,227 INFO L401 ceAbstractionStarter]: For program point mainErr10RequiresViolation(lines 1 641) no Hoare annotation was computed. [2018-01-25 03:19:45,228 INFO L401 ceAbstractionStarter]: For program point L636'(lines 636 638) no Hoare annotation was computed. [2018-01-25 03:19:45,228 INFO L401 ceAbstractionStarter]: For program point L639(line 639) no Hoare annotation was computed. [2018-01-25 03:19:45,228 INFO L401 ceAbstractionStarter]: For program point L634'(line 634) no Hoare annotation was computed. [2018-01-25 03:19:45,228 INFO L401 ceAbstractionStarter]: For program point L622'(lines 622 629) no Hoare annotation was computed. [2018-01-25 03:19:45,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 03:19:45 BoogieIcfgContainer [2018-01-25 03:19:45,232 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 03:19:45,233 INFO L168 Benchmark]: Toolchain (without parser) took 2235.37 ms. Allocated memory was 302.0 MB in the beginning and 455.6 MB in the end (delta: 153.6 MB). Free memory was 261.9 MB in the beginning and 320.0 MB in the end (delta: -58.1 MB). Peak memory consumption was 95.5 MB. Max. memory is 5.3 GB. [2018-01-25 03:19:45,234 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 302.0 MB. Free memory is still 267.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 03:19:45,234 INFO L168 Benchmark]: CACSL2BoogieTranslator took 257.72 ms. Allocated memory is still 302.0 MB. Free memory was 260.9 MB in the beginning and 250.6 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 5.3 GB. [2018-01-25 03:19:45,234 INFO L168 Benchmark]: Boogie Preprocessor took 42.63 ms. Allocated memory is still 302.0 MB. Free memory was 250.6 MB in the beginning and 249.6 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 5.3 GB. [2018-01-25 03:19:45,235 INFO L168 Benchmark]: RCFGBuilder took 292.75 ms. Allocated memory is still 302.0 MB. Free memory was 249.6 MB in the beginning and 232.0 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 5.3 GB. [2018-01-25 03:19:45,235 INFO L168 Benchmark]: TraceAbstraction took 1630.62 ms. Allocated memory was 302.0 MB in the beginning and 455.6 MB in the end (delta: 153.6 MB). Free memory was 232.0 MB in the beginning and 320.0 MB in the end (delta: -88.0 MB). Peak memory consumption was 65.6 MB. Max. memory is 5.3 GB. [2018-01-25 03:19:45,237 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.30 ms. Allocated memory is still 302.0 MB. Free memory is still 267.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 257.72 ms. Allocated memory is still 302.0 MB. Free memory was 260.9 MB in the beginning and 250.6 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.63 ms. Allocated memory is still 302.0 MB. Free memory was 250.6 MB in the beginning and 249.6 MB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 292.75 ms. Allocated memory is still 302.0 MB. Free memory was 249.6 MB in the beginning and 232.0 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1630.62 ms. Allocated memory was 302.0 MB in the beginning and 455.6 MB in the end (delta: 153.6 MB). Free memory was 232.0 MB in the beginning and 320.0 MB in the end (delta: -88.0 MB). Peak memory consumption was 65.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 620]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 39 locations, 15 error locations. SAFE Result, 1.5s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 77 SDtfs, 81 SDslu, 93 SDs, 0 SdLazy, 143 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 4 NumberOfFragments, 8 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 65 NumberOfCodeBlocks, 65 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 60 ConstructedInterpolants, 0 QuantifiedInterpolants, 6591 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0158_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_03-19-45-248.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0158_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_03-19-45-248.csv Received shutdown request...