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_mostprecise.epf -i ../../../trunk/examples/svcomp/memsafety/test-0019_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 20:07:59,234 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 20:07:59,235 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 20:07:59,250 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 20:07:59,250 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 20:07:59,251 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 20:07:59,252 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 20:07:59,254 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 20:07:59,256 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 20:07:59,257 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 20:07:59,257 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 20:07:59,257 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 20:07:59,258 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 20:07:59,259 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 20:07:59,260 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 20:07:59,263 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 20:07:59,265 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 20:07:59,267 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 20:07:59,268 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 20:07:59,269 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 20:07:59,271 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 20:07:59,272 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 20:07:59,272 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 20:07:59,273 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 20:07:59,274 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 20:07:59,275 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 20:07:59,275 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 20:07:59,276 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 20:07:59,276 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 20:07:59,276 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 20:07:59,277 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 20:07:59,277 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_mostprecise.epf [2018-01-24 20:07:59,287 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 20:07:59,287 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 20:07:59,288 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 20:07:59,288 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 20:07:59,288 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 20:07:59,289 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 20:07:59,289 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 20:07:59,289 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-24 20:07:59,289 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 20:07:59,290 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 20:07:59,290 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 20:07:59,290 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 20:07:59,291 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 20:07:59,291 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 20:07:59,291 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 20:07:59,291 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 20:07:59,291 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 20:07:59,292 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 20:07:59,292 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 20:07:59,292 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 20:07:59,292 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 20:07:59,292 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 20:07:59,293 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 20:07:59,293 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 20:07:59,293 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 20:07:59,293 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 20:07:59,293 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 20:07:59,294 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 20:07:59,294 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 20:07:59,294 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 20:07:59,294 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 20:07:59,294 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 20:07:59,295 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 20:07:59,295 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 20:07:59,295 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 20:07:59,296 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 20:07:59,296 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 20:07:59,331 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 20:07:59,343 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 20:07:59,348 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 20:07:59,349 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 20:07:59,350 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 20:07:59,350 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0019_false-valid-memtrack_true-termination.i [2018-01-24 20:07:59,527 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 20:07:59,534 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 20:07:59,536 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 20:07:59,536 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 20:07:59,543 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 20:07:59,544 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 08:07:59" (1/1) ... [2018-01-24 20:07:59,546 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69156849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:07:59, skipping insertion in model container [2018-01-24 20:07:59,547 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 08:07:59" (1/1) ... [2018-01-24 20:07:59,559 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 20:07:59,594 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 20:07:59,703 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 20:07:59,718 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 20:07:59,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:07:59 WrapperNode [2018-01-24 20:07:59,723 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 20:07:59,724 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 20:07:59,724 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 20:07:59,724 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 20:07:59,735 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:07:59" (1/1) ... [2018-01-24 20:07:59,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:07:59" (1/1) ... [2018-01-24 20:07:59,747 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:07:59" (1/1) ... [2018-01-24 20:07:59,747 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:07:59" (1/1) ... [2018-01-24 20:07:59,752 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:07:59" (1/1) ... [2018-01-24 20:07:59,753 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:07:59" (1/1) ... [2018-01-24 20:07:59,754 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:07:59" (1/1) ... [2018-01-24 20:07:59,756 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 20:07:59,756 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 20:07:59,756 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 20:07:59,756 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 20:07:59,757 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:07:59" (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-24 20:07:59,801 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 20:07:59,801 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 20:07:59,801 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_data [2018-01-24 20:07:59,802 INFO L136 BoogieDeclarations]: Found implementation of procedure free_data [2018-01-24 20:07:59,802 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 20:07:59,802 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 20:07:59,802 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 20:07:59,802 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 20:07:59,802 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 20:07:59,803 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 20:07:59,803 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 20:07:59,803 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 20:07:59,803 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_data [2018-01-24 20:07:59,803 INFO L128 BoogieDeclarations]: Found specification of procedure free_data [2018-01-24 20:07:59,803 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 20:07:59,804 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 20:07:59,804 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 20:08:00,010 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 20:08:00,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 08:08:00 BoogieIcfgContainer [2018-01-24 20:08:00,011 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 20:08:00,011 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 20:08:00,012 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 20:08:00,014 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 20:08:00,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 08:07:59" (1/3) ... [2018-01-24 20:08:00,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a72317a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 08:08:00, skipping insertion in model container [2018-01-24 20:08:00,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:07:59" (2/3) ... [2018-01-24 20:08:00,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a72317a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 08:08:00, skipping insertion in model container [2018-01-24 20:08:00,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 08:08:00" (3/3) ... [2018-01-24 20:08:00,059 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0019_false-valid-memtrack_true-termination.i [2018-01-24 20:08:00,066 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 20:08:00,071 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-01-24 20:08:00,114 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 20:08:00,114 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 20:08:00,114 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 20:08:00,114 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 20:08:00,114 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 20:08:00,115 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 20:08:00,115 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 20:08:00,115 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 20:08:00,116 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 20:08:00,136 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-01-24 20:08:00,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 20:08:00,140 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:08:00,141 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:08:00,141 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr0EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-24 20:08:00,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1048002709, now seen corresponding path program 1 times [2018-01-24 20:08:00,147 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:08:00,188 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:08:00,188 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:08:00,188 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:08:00,188 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:08:00,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:08:00,241 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:08:00,359 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-24 20:08:00,361 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:08:00,361 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 20:08:00,361 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:08:00,363 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 20:08:00,374 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 20:08:00,375 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 20:08:00,377 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 5 states. [2018-01-24 20:08:00,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:08:00,641 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-01-24 20:08:00,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 20:08:00,643 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-01-24 20:08:00,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:08:00,651 INFO L225 Difference]: With dead ends: 51 [2018-01-24 20:08:00,651 INFO L226 Difference]: Without dead ends: 46 [2018-01-24 20:08:00,654 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 20:08:00,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-24 20:08:00,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-24 20:08:00,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 20:08:00,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-01-24 20:08:00,693 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 10 [2018-01-24 20:08:00,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:08:00,694 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-01-24 20:08:00,694 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 20:08:00,694 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-01-24 20:08:00,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-24 20:08:00,694 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:08:00,695 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:08:00,695 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr0EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-24 20:08:00,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1048002708, now seen corresponding path program 1 times [2018-01-24 20:08:00,695 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:08:00,696 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:08:00,697 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:08:00,697 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:08:00,697 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:08:00,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:08:00,720 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:08:00,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:08:00,872 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:08:00,872 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 20:08:00,872 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:08:00,874 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 20:08:00,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 20:08:00,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-24 20:08:00,875 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 6 states. [2018-01-24 20:08:01,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:08:01,095 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-01-24 20:08:01,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 20:08:01,096 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-01-24 20:08:01,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:08:01,097 INFO L225 Difference]: With dead ends: 46 [2018-01-24 20:08:01,097 INFO L226 Difference]: Without dead ends: 44 [2018-01-24 20:08:01,098 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-24 20:08:01,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-24 20:08:01,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-01-24 20:08:01,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-01-24 20:08:01,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-01-24 20:08:01,106 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 10 [2018-01-24 20:08:01,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:08:01,106 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-01-24 20:08:01,106 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 20:08:01,106 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-01-24 20:08:01,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 20:08:01,107 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:08:01,107 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:08:01,107 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr0EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-24 20:08:01,107 INFO L82 PathProgramCache]: Analyzing trace with hash 500312934, now seen corresponding path program 1 times [2018-01-24 20:08:01,108 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:08:01,109 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:08:01,109 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:08:01,109 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:08:01,109 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:08:01,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:08:01,129 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:08:01,182 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-24 20:08:01,182 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:08:01,183 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 20:08:01,183 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:08:01,183 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 20:08:01,183 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 20:08:01,184 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 20:08:01,184 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 7 states. [2018-01-24 20:08:01,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:08:01,321 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-01-24 20:08:01,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 20:08:01,321 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-01-24 20:08:01,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:08:01,323 INFO L225 Difference]: With dead ends: 53 [2018-01-24 20:08:01,323 INFO L226 Difference]: Without dead ends: 49 [2018-01-24 20:08:01,323 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-24 20:08:01,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-24 20:08:01,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2018-01-24 20:08:01,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-24 20:08:01,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-01-24 20:08:01,334 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 17 [2018-01-24 20:08:01,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:08:01,334 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-01-24 20:08:01,334 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 20:08:01,335 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-01-24 20:08:01,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 20:08:01,335 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:08:01,335 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:08:01,336 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr0EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-24 20:08:01,336 INFO L82 PathProgramCache]: Analyzing trace with hash 500312935, now seen corresponding path program 1 times [2018-01-24 20:08:01,338 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:08:01,339 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:08:01,339 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:08:01,339 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:08:01,339 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:08:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:08:01,368 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:08:01,496 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-24 20:08:01,496 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:08:01,497 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 20:08:01,497 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:08:01,497 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 20:08:01,497 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 20:08:01,498 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-24 20:08:01,498 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 8 states. [2018-01-24 20:08:01,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:08:01,584 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-01-24 20:08:01,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 20:08:01,584 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-01-24 20:08:01,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:08:01,585 INFO L225 Difference]: With dead ends: 42 [2018-01-24 20:08:01,585 INFO L226 Difference]: Without dead ends: 38 [2018-01-24 20:08:01,585 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-01-24 20:08:01,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-24 20:08:01,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-01-24 20:08:01,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-24 20:08:01,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-01-24 20:08:01,590 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 17 [2018-01-24 20:08:01,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:08:01,590 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-01-24 20:08:01,590 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 20:08:01,590 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-01-24 20:08:01,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 20:08:01,591 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:08:01,591 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:08:01,591 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr0EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-24 20:08:01,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1011623589, now seen corresponding path program 1 times [2018-01-24 20:08:01,591 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:08:01,592 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:08:01,592 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:08:01,592 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:08:01,592 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:08:01,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:08:01,604 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:08:01,758 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-24 20:08:01,758 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:08:01,758 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 20:08:01,758 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:08:01,759 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 20:08:01,759 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 20:08:01,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-24 20:08:01,759 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 11 states. [2018-01-24 20:08:01,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:08:01,875 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-01-24 20:08:01,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 20:08:01,875 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-01-24 20:08:01,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:08:01,876 INFO L225 Difference]: With dead ends: 38 [2018-01-24 20:08:01,876 INFO L226 Difference]: Without dead ends: 37 [2018-01-24 20:08:01,876 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-01-24 20:08:01,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-01-24 20:08:01,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-01-24 20:08:01,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-24 20:08:01,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-01-24 20:08:01,882 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 22 [2018-01-24 20:08:01,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:08:01,883 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-01-24 20:08:01,883 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 20:08:01,883 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-01-24 20:08:01,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 20:08:01,884 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:08:01,884 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:08:01,884 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr0EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-24 20:08:01,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1011623588, now seen corresponding path program 1 times [2018-01-24 20:08:01,885 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:08:01,886 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:08:01,886 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:08:01,886 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:08:01,886 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:08:01,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:08:01,900 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:08:02,050 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-24 20:08:02,050 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:08:02,050 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 20:08:02,050 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:08:02,051 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 20:08:02,051 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 20:08:02,051 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-24 20:08:02,052 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 11 states. [2018-01-24 20:08:02,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:08:02,176 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-01-24 20:08:02,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 20:08:02,177 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-01-24 20:08:02,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:08:02,179 INFO L225 Difference]: With dead ends: 40 [2018-01-24 20:08:02,179 INFO L226 Difference]: Without dead ends: 39 [2018-01-24 20:08:02,180 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-01-24 20:08:02,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-01-24 20:08:02,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-01-24 20:08:02,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-24 20:08:02,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-01-24 20:08:02,183 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 22 [2018-01-24 20:08:02,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:08:02,183 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-01-24 20:08:02,183 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 20:08:02,183 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-01-24 20:08:02,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 20:08:02,184 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:08:02,184 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:08:02,184 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr0EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-24 20:08:02,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1295560179, now seen corresponding path program 1 times [2018-01-24 20:08:02,184 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:08:02,185 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:08:02,185 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:08:02,185 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:08:02,185 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:08:02,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:08:02,198 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:08:02,248 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-24 20:08:02,248 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:08:02,249 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 20:08:02,249 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:08:02,249 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 20:08:02,249 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 20:08:02,250 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 20:08:02,250 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 4 states. [2018-01-24 20:08:02,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:08:02,277 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-01-24 20:08:02,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 20:08:02,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-01-24 20:08:02,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:08:02,280 INFO L225 Difference]: With dead ends: 39 [2018-01-24 20:08:02,280 INFO L226 Difference]: Without dead ends: 38 [2018-01-24 20:08:02,280 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 20:08:02,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-24 20:08:02,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2018-01-24 20:08:02,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-24 20:08:02,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-01-24 20:08:02,286 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 23 [2018-01-24 20:08:02,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:08:02,286 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-01-24 20:08:02,287 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 20:08:02,287 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-01-24 20:08:02,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 20:08:02,290 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:08:02,290 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:08:02,290 INFO L371 AbstractCegarLoop]: === Iteration 8 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr0EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-24 20:08:02,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1295560178, now seen corresponding path program 1 times [2018-01-24 20:08:02,290 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:08:02,291 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:08:02,291 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:08:02,291 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:08:02,292 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:08:02,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:08:02,307 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:08:02,621 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-24 20:08:02,621 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:08:02,621 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-01-24 20:08:02,621 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:08:02,622 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-24 20:08:02,622 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-24 20:08:02,622 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-01-24 20:08:02,623 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 16 states. [2018-01-24 20:08:02,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:08:02,888 INFO L93 Difference]: Finished difference Result 43 states and 42 transitions. [2018-01-24 20:08:02,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 20:08:02,888 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2018-01-24 20:08:02,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:08:02,889 INFO L225 Difference]: With dead ends: 43 [2018-01-24 20:08:02,889 INFO L226 Difference]: Without dead ends: 30 [2018-01-24 20:08:02,890 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2018-01-24 20:08:02,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-01-24 20:08:02,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-01-24 20:08:02,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-01-24 20:08:02,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 29 transitions. [2018-01-24 20:08:02,894 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 29 transitions. Word has length 23 [2018-01-24 20:08:02,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:08:02,894 INFO L432 AbstractCegarLoop]: Abstraction has 30 states and 29 transitions. [2018-01-24 20:08:02,894 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-24 20:08:02,894 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 29 transitions. [2018-01-24 20:08:02,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 20:08:02,895 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:08:02,895 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:08:02,895 INFO L371 AbstractCegarLoop]: === Iteration 9 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr0EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-24 20:08:02,895 INFO L82 PathProgramCache]: Analyzing trace with hash -117517057, now seen corresponding path program 1 times [2018-01-24 20:08:02,895 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:08:02,896 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:08:02,896 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:08:02,896 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:08:02,897 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:08:02,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-24 20:08:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-24 20:08:02,952 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-24 20:08:02,965 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-24 20:08:02,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 08:08:02 BoogieIcfgContainer [2018-01-24 20:08:02,981 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 20:08:02,982 INFO L168 Benchmark]: Toolchain (without parser) took 3454.56 ms. Allocated memory was 303.0 MB in the beginning and 516.4 MB in the end (delta: 213.4 MB). Free memory was 261.4 MB in the beginning and 437.8 MB in the end (delta: -176.5 MB). Peak memory consumption was 36.9 MB. Max. memory is 5.3 GB. [2018-01-24 20:08:02,984 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 303.0 MB. Free memory is still 267.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 20:08:02,984 INFO L168 Benchmark]: CACSL2BoogieTranslator took 187.97 ms. Allocated memory is still 303.0 MB. Free memory was 260.4 MB in the beginning and 250.3 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-24 20:08:02,984 INFO L168 Benchmark]: Boogie Preprocessor took 31.90 ms. Allocated memory is still 303.0 MB. Free memory was 250.3 MB in the beginning and 248.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 20:08:02,984 INFO L168 Benchmark]: RCFGBuilder took 255.05 ms. Allocated memory is still 303.0 MB. Free memory was 248.3 MB in the beginning and 230.7 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 5.3 GB. [2018-01-24 20:08:02,985 INFO L168 Benchmark]: TraceAbstraction took 2969.99 ms. Allocated memory was 303.0 MB in the beginning and 516.4 MB in the end (delta: 213.4 MB). Free memory was 230.7 MB in the beginning and 437.8 MB in the end (delta: -207.1 MB). Peak memory consumption was 6.3 MB. Max. memory is 5.3 GB. [2018-01-24 20:08:02,986 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.18 ms. Allocated memory is still 303.0 MB. Free memory is still 267.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 187.97 ms. Allocated memory is still 303.0 MB. Free memory was 260.4 MB in the beginning and 250.3 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.90 ms. Allocated memory is still 303.0 MB. Free memory was 250.3 MB in the beginning and 248.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 255.05 ms. Allocated memory is still 303.0 MB. Free memory was 248.3 MB in the beginning and 230.7 MB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2969.99 ms. Allocated memory was 303.0 MB in the beginning and 516.4 MB in the end (delta: 213.4 MB). Free memory was 230.7 MB in the beginning and 437.8 MB in the end (delta: -207.1 MB). Peak memory consumption was 6.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: 639]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 639. Possible FailurePath: [L640] FCALL TData data; VAL [data={26:0}] [L641] CALL alloc_data(&data) VAL [pdata={26:0}] [L625] EXPR, FCALL malloc(16) VAL [malloc(16)={27:0}, pdata={26:0}, pdata={26:0}] [L625] FCALL pdata->lo = malloc(16) VAL [malloc(16)={27:0}, pdata={26:0}, pdata={26:0}] [L626] EXPR, FCALL malloc(24) VAL [malloc(16)={27:0}, malloc(24)={28:0}, pdata={26:0}, pdata={26:0}] [L626] RET, FCALL pdata->hi = malloc(24) VAL [malloc(16)={27:0}, malloc(24)={28:0}, pdata={26:0}, pdata={26:0}] [L641] alloc_data(&data) VAL [data={26:0}] [L642] CALL free_data(&data) VAL [data={26:0}] [L630] EXPR, FCALL data->lo VAL [data={26:0}, data={26:0}, data->lo={27:0}] [L630] void *lo = data->lo; [L631] EXPR, FCALL data->hi VAL [data={26:0}, data={26:0}, data->hi={28:0}, lo={27:0}] [L631] void *hi = data->hi; [L632] COND FALSE !(lo == hi) VAL [data={26:0}, data={26:0}, hi={28:0}, lo={27:0}] [L636] FCALL data->lo = (void *) 0 VAL [data={26:0}, data={26:0}, hi={28:0}, lo={27:0}] [L637] RET, FCALL data->hi = (void *) 0 VAL [data={26:0}, data={26:0}, hi={28:0}, lo={27:0}] [L642] free_data(&data) VAL [data={26:0}] [L643] return 0; VAL [\result=0, data={26:0}] [L643] return 0; VAL [\result=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 51 locations, 17 error locations. UNSAFE Result, 2.8s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 220 SDtfs, 196 SDslu, 666 SDs, 0 SdLazy, 731 SolverSat, 71 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred 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, 8 MinimizatonAttempts, 13 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 173 NumberOfCodeBlocks, 173 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 136 ConstructedInterpolants, 0 QuantifiedInterpolants, 14783 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 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/test-0019_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_20-08-02-993.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0019_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_20-08-02-993.csv Received shutdown request...