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-properties/simple_built_from_end_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 03:42:44,959 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 03:42:44,960 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 03:42:44,972 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 03:42:44,973 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 03:42:44,974 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 03:42:44,975 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 03:42:44,976 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 03:42:44,978 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 03:42:44,979 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 03:42:44,979 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 03:42:44,980 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 03:42:44,980 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 03:42:44,981 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 03:42:44,982 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 03:42:44,984 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 03:42:44,986 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 03:42:44,988 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 03:42:44,990 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 03:42:44,991 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 03:42:44,993 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 03:42:44,994 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 03:42:44,994 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 03:42:44,995 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 03:42:44,996 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 03:42:44,997 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 03:42:44,997 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 03:42:44,998 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 03:42:44,998 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 03:42:44,998 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 03:42:44,999 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 03:42:44,999 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:42:45,009 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 03:42:45,009 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 03:42:45,010 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 03:42:45,010 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 03:42:45,010 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 03:42:45,011 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 03:42:45,011 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 03:42:45,011 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 03:42:45,011 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 03:42:45,012 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 03:42:45,012 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 03:42:45,012 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 03:42:45,012 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 03:42:45,013 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 03:42:45,013 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 03:42:45,013 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 03:42:45,013 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 03:42:45,013 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 03:42:45,014 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 03:42:45,014 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 03:42:45,014 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 03:42:45,014 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 03:42:45,014 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 03:42:45,015 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 03:42:45,015 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 03:42:45,015 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 03:42:45,015 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 03:42:45,015 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 03:42:45,016 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 03:42:45,016 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 03:42:45,016 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 03:42:45,016 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 03:42:45,016 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 03:42:45,016 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 03:42:45,017 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 03:42:45,017 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 03:42:45,018 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 03:42:45,052 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 03:42:45,064 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 03:42:45,068 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 03:42:45,070 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 03:42:45,070 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 03:42:45,071 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/simple_built_from_end_true-unreach-call_false-valid-memtrack.i [2018-01-25 03:42:45,343 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 03:42:45,348 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 03:42:45,348 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 03:42:45,348 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 03:42:45,353 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 03:42:45,354 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:42:45" (1/1) ... [2018-01-25 03:42:45,357 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29a59f06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:42:45, skipping insertion in model container [2018-01-25 03:42:45,357 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:42:45" (1/1) ... [2018-01-25 03:42:45,375 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:42:45,415 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:42:45,528 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:42:45,543 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:42:45,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:42:45 WrapperNode [2018-01-25 03:42:45,553 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 03:42:45,553 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 03:42:45,554 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 03:42:45,554 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 03:42:45,571 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:42:45" (1/1) ... [2018-01-25 03:42:45,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:42:45" (1/1) ... [2018-01-25 03:42:45,582 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:42:45" (1/1) ... [2018-01-25 03:42:45,582 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:42:45" (1/1) ... [2018-01-25 03:42:45,587 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:42:45" (1/1) ... [2018-01-25 03:42:45,591 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:42:45" (1/1) ... [2018-01-25 03:42:45,593 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:42:45" (1/1) ... [2018-01-25 03:42:45,595 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 03:42:45,596 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 03:42:45,596 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 03:42:45,596 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 03:42:45,597 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:42:45" (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:42:45,649 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 03:42:45,649 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 03:42:45,649 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-01-25 03:42:45,649 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 03:42:45,649 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 03:42:45,650 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 03:42:45,650 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 03:42:45,650 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 03:42:45,650 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 03:42:45,650 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 03:42:45,650 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 03:42:45,651 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-25 03:42:45,651 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 03:42:45,651 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 03:42:45,651 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-01-25 03:42:45,651 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 03:42:45,651 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 03:42:45,652 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 03:42:45,849 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 03:42:45,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:42:45 BoogieIcfgContainer [2018-01-25 03:42:45,850 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 03:42:45,851 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 03:42:45,851 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 03:42:45,853 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 03:42:45,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 03:42:45" (1/3) ... [2018-01-25 03:42:45,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21121308 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:42:45, skipping insertion in model container [2018-01-25 03:42:45,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:42:45" (2/3) ... [2018-01-25 03:42:45,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21121308 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:42:45, skipping insertion in model container [2018-01-25 03:42:45,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:42:45" (3/3) ... [2018-01-25 03:42:45,856 INFO L105 eAbstractionObserver]: Analyzing ICFG simple_built_from_end_true-unreach-call_false-valid-memtrack.i [2018-01-25 03:42:45,862 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 03:42:45,868 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-25 03:42:45,919 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 03:42:45,919 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 03:42:45,920 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 03:42:45,920 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 03:42:45,920 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 03:42:45,920 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 03:42:45,920 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 03:42:45,920 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 03:42:45,921 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 03:42:45,942 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-01-25 03:42:45,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-25 03:42:45,950 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:42:45,951 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:42:45,951 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-25 03:42:45,956 INFO L82 PathProgramCache]: Analyzing trace with hash -119107064, now seen corresponding path program 1 times [2018-01-25 03:42:45,959 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:42:46,016 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:42:46,016 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:42:46,017 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:42:46,017 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:42:46,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:42:46,067 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:42:46,103 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:42:46,105 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:42:46,106 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 03:42:46,106 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:42:46,109 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-25 03:42:46,123 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-25 03:42:46,124 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-25 03:42:46,126 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2018-01-25 03:42:46,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:42:46,150 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2018-01-25 03:42:46,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-25 03:42:46,152 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-01-25 03:42:46,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:42:46,163 INFO L225 Difference]: With dead ends: 54 [2018-01-25 03:42:46,163 INFO L226 Difference]: Without dead ends: 31 [2018-01-25 03:42:46,167 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 03:42:46,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-01-25 03:42:46,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-01-25 03:42:46,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-01-25 03:42:46,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-01-25 03:42:46,292 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 9 [2018-01-25 03:42:46,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:42:46,293 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-01-25 03:42:46,293 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-25 03:42:46,293 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-01-25 03:42:46,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-25 03:42:46,293 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:42:46,293 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:42:46,294 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-25 03:42:46,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1438918584, now seen corresponding path program 1 times [2018-01-25 03:42:46,294 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:42:46,295 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:42:46,295 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:42:46,295 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:42:46,295 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:42:46,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:42:46,309 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:42:46,348 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:42:46,349 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:42:46,349 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 03:42:46,349 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:42:46,351 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 03:42:46,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 03:42:46,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:42:46,352 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 3 states. [2018-01-25 03:42:46,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:42:46,403 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-01-25 03:42:46,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 03:42:46,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-01-25 03:42:46,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:42:46,734 INFO L225 Difference]: With dead ends: 47 [2018-01-25 03:42:46,734 INFO L226 Difference]: Without dead ends: 45 [2018-01-25 03:42:46,735 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:42:46,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-25 03:42:46,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2018-01-25 03:42:46,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-25 03:42:46,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-01-25 03:42:46,742 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 12 [2018-01-25 03:42:46,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:42:46,743 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-01-25 03:42:46,743 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 03:42:46,743 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-01-25 03:42:46,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-25 03:42:46,744 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:42:46,744 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:42:46,744 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-25 03:42:46,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1438918540, now seen corresponding path program 1 times [2018-01-25 03:42:46,744 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:42:46,746 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:42:46,746 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:42:46,746 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:42:46,746 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:42:46,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:42:46,758 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:42:46,790 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:42:46,790 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:42:46,790 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:42:46,790 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:42:46,790 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 03:42:46,791 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 03:42:46,791 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:42:46,791 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 3 states. [2018-01-25 03:42:46,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:42:46,818 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-01-25 03:42:46,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 03:42:46,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-01-25 03:42:46,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:42:46,819 INFO L225 Difference]: With dead ends: 56 [2018-01-25 03:42:46,820 INFO L226 Difference]: Without dead ends: 44 [2018-01-25 03:42:46,820 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:42:46,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-25 03:42:46,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 34. [2018-01-25 03:42:46,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-25 03:42:46,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-01-25 03:42:46,826 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 12 [2018-01-25 03:42:46,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:42:46,827 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-01-25 03:42:46,827 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 03:42:46,827 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-01-25 03:42:46,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 03:42:46,828 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:42:46,828 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:42:46,828 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-25 03:42:46,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1655605995, now seen corresponding path program 1 times [2018-01-25 03:42:46,828 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:42:46,829 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:42:46,829 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:42:46,830 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:42:46,830 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:42:46,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:42:46,843 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:42:46,877 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:42:46,878 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:42:46,878 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:42:46,878 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:42:46,878 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:42:46,879 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:42:46,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:42:46,879 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 4 states. [2018-01-25 03:42:46,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:42:46,925 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-01-25 03:42:46,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 03:42:46,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-25 03:42:46,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:42:46,927 INFO L225 Difference]: With dead ends: 36 [2018-01-25 03:42:46,927 INFO L226 Difference]: Without dead ends: 34 [2018-01-25 03:42:46,927 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:42:46,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-01-25 03:42:46,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-01-25 03:42:46,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-01-25 03:42:46,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-01-25 03:42:46,931 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 13 [2018-01-25 03:42:46,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:42:46,932 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2018-01-25 03:42:46,932 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:42:46,932 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-01-25 03:42:46,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 03:42:46,932 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:42:46,932 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:42:46,932 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-25 03:42:46,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1655605994, now seen corresponding path program 1 times [2018-01-25 03:42:46,933 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:42:46,933 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:42:46,933 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:42:46,934 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:42:46,934 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:42:46,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:42:46,949 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:42:47,021 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:42:47,021 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:42:47,022 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:42:47,022 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:42:47,022 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:42:47,022 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:42:47,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:42:47,023 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 4 states. [2018-01-25 03:42:47,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:42:47,081 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-01-25 03:42:47,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 03:42:47,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-25 03:42:47,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:42:47,083 INFO L225 Difference]: With dead ends: 34 [2018-01-25 03:42:47,083 INFO L226 Difference]: Without dead ends: 32 [2018-01-25 03:42:47,083 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:42:47,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-01-25 03:42:47,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-01-25 03:42:47,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-01-25 03:42:47,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-01-25 03:42:47,088 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 13 [2018-01-25 03:42:47,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:42:47,089 INFO L432 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-01-25 03:42:47,089 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:42:47,089 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-01-25 03:42:47,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 03:42:47,090 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:42:47,090 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:42:47,090 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-25 03:42:47,090 INFO L82 PathProgramCache]: Analyzing trace with hash -252306105, now seen corresponding path program 1 times [2018-01-25 03:42:47,090 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:42:47,091 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:42:47,091 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:42:47,091 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:42:47,091 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:42:47,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:42:47,104 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:42:47,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:42:47,145 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:42:47,145 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:42:47,145 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:42:47,146 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:42:47,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:42:47,146 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:42:47,146 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 5 states. [2018-01-25 03:42:47,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:42:47,239 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-01-25 03:42:47,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:42:47,242 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-01-25 03:42:47,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:42:47,243 INFO L225 Difference]: With dead ends: 48 [2018-01-25 03:42:47,243 INFO L226 Difference]: Without dead ends: 46 [2018-01-25 03:42:47,243 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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:42:47,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-25 03:42:47,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 32. [2018-01-25 03:42:47,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-01-25 03:42:47,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-01-25 03:42:47,248 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 21 [2018-01-25 03:42:47,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:42:47,249 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2018-01-25 03:42:47,249 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:42:47,249 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-01-25 03:42:47,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 03:42:47,250 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:42:47,250 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:42:47,250 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-25 03:42:47,250 INFO L82 PathProgramCache]: Analyzing trace with hash -252306061, now seen corresponding path program 1 times [2018-01-25 03:42:47,250 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:42:47,251 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:42:47,251 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:42:47,251 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:42:47,252 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:42:47,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:42:47,265 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:42:47,298 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:42:47,298 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:42:47,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:42:47,298 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:42:47,299 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:42:47,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:42:47,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:42:47,299 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 4 states. [2018-01-25 03:42:47,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:42:47,386 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-01-25 03:42:47,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:42:47,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-01-25 03:42:47,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:42:47,387 INFO L225 Difference]: With dead ends: 41 [2018-01-25 03:42:47,387 INFO L226 Difference]: Without dead ends: 39 [2018-01-25 03:42:47,387 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:42:47,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-01-25 03:42:47,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2018-01-25 03:42:47,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-01-25 03:42:47,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-01-25 03:42:47,392 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 21 [2018-01-25 03:42:47,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:42:47,392 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-01-25 03:42:47,392 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:42:47,392 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-01-25 03:42:47,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 03:42:47,393 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:42:47,393 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:42:47,393 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-25 03:42:47,394 INFO L82 PathProgramCache]: Analyzing trace with hash -252306060, now seen corresponding path program 1 times [2018-01-25 03:42:47,394 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:42:47,395 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:42:47,395 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:42:47,395 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:42:47,395 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:42:47,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:42:47,409 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:42:47,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:42:47,494 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:42:47,494 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:42:47,494 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:42:47,495 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:42:47,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:42:47,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:42:47,495 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 5 states. [2018-01-25 03:42:47,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:42:47,567 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-01-25 03:42:47,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:42:47,568 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-01-25 03:42:47,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:42:47,569 INFO L225 Difference]: With dead ends: 43 [2018-01-25 03:42:47,569 INFO L226 Difference]: Without dead ends: 41 [2018-01-25 03:42:47,569 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 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:42:47,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-25 03:42:47,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2018-01-25 03:42:47,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-25 03:42:47,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-01-25 03:42:47,574 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 21 [2018-01-25 03:42:47,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:42:47,575 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-01-25 03:42:47,575 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:42:47,575 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-01-25 03:42:47,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 03:42:47,577 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:42:47,577 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] [2018-01-25 03:42:47,577 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-25 03:42:47,578 INFO L82 PathProgramCache]: Analyzing trace with hash -633867851, now seen corresponding path program 1 times [2018-01-25 03:42:47,578 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:42:47,579 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:42:47,579 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:42:47,579 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:42:47,579 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:42:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-25 03:42:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-25 03:42:47,632 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-25 03:42:47,648 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-25 03:42:47,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 03:42:47 BoogieIcfgContainer [2018-01-25 03:42:47,664 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 03:42:47,665 INFO L168 Benchmark]: Toolchain (without parser) took 2321.03 ms. Allocated memory was 306.7 MB in the beginning and 471.9 MB in the end (delta: 165.2 MB). Free memory was 264.6 MB in the beginning and 342.3 MB in the end (delta: -77.7 MB). Peak memory consumption was 87.4 MB. Max. memory is 5.3 GB. [2018-01-25 03:42:47,666 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 306.7 MB. Free memory is still 270.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 03:42:47,667 INFO L168 Benchmark]: CACSL2BoogieTranslator took 204.76 ms. Allocated memory is still 306.7 MB. Free memory was 263.6 MB in the beginning and 253.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-25 03:42:47,667 INFO L168 Benchmark]: Boogie Preprocessor took 41.73 ms. Allocated memory is still 306.7 MB. Free memory was 253.6 MB in the beginning and 251.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 03:42:47,667 INFO L168 Benchmark]: RCFGBuilder took 254.57 ms. Allocated memory is still 306.7 MB. Free memory was 251.5 MB in the beginning and 235.4 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 5.3 GB. [2018-01-25 03:42:47,668 INFO L168 Benchmark]: TraceAbstraction took 1813.50 ms. Allocated memory was 306.7 MB in the beginning and 471.9 MB in the end (delta: 165.2 MB). Free memory was 235.4 MB in the beginning and 342.3 MB in the end (delta: -106.9 MB). Peak memory consumption was 58.3 MB. Max. memory is 5.3 GB. [2018-01-25 03:42:47,669 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.19 ms. Allocated memory is still 306.7 MB. Free memory is still 270.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 204.76 ms. Allocated memory is still 306.7 MB. Free memory was 263.6 MB in the beginning and 253.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.73 ms. Allocated memory is still 306.7 MB. Free memory was 253.6 MB in the beginning and 251.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 254.57 ms. Allocated memory is still 306.7 MB. Free memory was 251.5 MB in the beginning and 235.4 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1813.50 ms. Allocated memory was 306.7 MB in the beginning and 471.9 MB in the end (delta: 165.2 MB). Free memory was 235.4 MB in the beginning and 342.3 MB in the end (delta: -106.9 MB). Peak memory consumption was 58.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 626]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 626. Possible FailurePath: [L627] List t; [L628] List p = 0; VAL [p={0:0}] [L629] COND TRUE __VERIFIER_nondet_int() [L630] EXPR, FCALL malloc(sizeof(struct node)) VAL [malloc(sizeof(struct node))={11:0}, p={0:0}] [L630] t = (List) malloc(sizeof(struct node)) VAL [malloc(sizeof(struct node))={11:0}, p={0:0}, t={11:0}] [L631] COND FALSE !(t == 0) VAL [malloc(sizeof(struct node))={11:0}, p={0:0}, t={11:0}] [L632] FCALL t->h = 1 VAL [malloc(sizeof(struct node))={11:0}, p={0:0}, t={11:0}] [L633] FCALL t->n = p VAL [malloc(sizeof(struct node))={11:0}, p={0:0}, t={11:0}] [L634] p = t VAL [malloc(sizeof(struct node))={11:0}, p={11:0}, t={11:0}] [L629] COND FALSE !(__VERIFIER_nondet_int()) [L636] COND TRUE p!=0 VAL [malloc(sizeof(struct node))={11:0}, p={11:0}, t={11:0}] [L637] EXPR, FCALL p->h VAL [malloc(sizeof(struct node))={11:0}, p={11:0}, p->h=1, t={11:0}] [L637] COND FALSE !(p->h != 1) [L640] EXPR, FCALL p->n VAL [malloc(sizeof(struct node))={11:0}, p={11:0}, p->n={0:0}, t={11:0}] [L640] p = p->n [L636] COND FALSE !(p!=0) VAL [malloc(sizeof(struct node))={11:0}, p={0:0}, t={11:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 9 error locations. UNSAFE Result, 1.7s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 202 SDtfs, 262 SDslu, 144 SDs, 0 SdLazy, 154 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=2, 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, 8 MinimizatonAttempts, 47 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 149 NumberOfCodeBlocks, 149 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 114 ConstructedInterpolants, 0 QuantifiedInterpolants, 5710 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 9/9 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple_built_from_end_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_03-42-47-677.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple_built_from_end_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_03-42-47-677.csv Received shutdown request...