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_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/memsafety/test-0019_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 09:11:46,991 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 09:11:46,993 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 09:11:47,010 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 09:11:47,011 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 09:11:47,011 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 09:11:47,013 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 09:11:47,014 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 09:11:47,017 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 09:11:47,018 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 09:11:47,019 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 09:11:47,019 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 09:11:47,020 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 09:11:47,022 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 09:11:47,023 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 09:11:47,025 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 09:11:47,027 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 09:11:47,029 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 09:11:47,031 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 09:11:47,032 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 09:11:47,035 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 09:11:47,035 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 09:11:47,035 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 09:11:47,036 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 09:11:47,037 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 09:11:47,039 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 09:11:47,039 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 09:11:47,040 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 09:11:47,040 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 09:11:47,040 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 09:11:47,041 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 09:11:47,041 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-31 09:11:47,052 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 09:11:47,052 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 09:11:47,053 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 09:11:47,054 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 09:11:47,054 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 09:11:47,054 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 09:11:47,054 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 09:11:47,055 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 09:11:47,055 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 09:11:47,055 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 09:11:47,056 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 09:11:47,056 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 09:11:47,056 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 09:11:47,056 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 09:11:47,057 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 09:11:47,057 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 09:11:47,057 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 09:11:47,057 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 09:11:47,057 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 09:11:47,058 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 09:11:47,058 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 09:11:47,058 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 09:11:47,058 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 09:11:47,058 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 09:11:47,059 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 09:11:47,059 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 09:11:47,059 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 09:11:47,059 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 09:11:47,060 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 09:11:47,060 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 09:11:47,060 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 09:11:47,060 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 09:11:47,061 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 09:11:47,061 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 09:11:47,112 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 09:11:47,130 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 09:11:47,137 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 09:11:47,139 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 09:11:47,139 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 09:11:47,140 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-31 09:11:47,335 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 09:11:47,342 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 09:11:47,343 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 09:11:47,343 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 09:11:47,358 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 09:11:47,359 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:11:47" (1/1) ... [2018-01-31 09:11:47,365 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21da746d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:11:47, skipping insertion in model container [2018-01-31 09:11:47,366 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:11:47" (1/1) ... [2018-01-31 09:11:47,385 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:11:47,448 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:11:47,612 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:11:47,636 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:11:47,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:11:47 WrapperNode [2018-01-31 09:11:47,644 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 09:11:47,645 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 09:11:47,645 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 09:11:47,646 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 09:11:47,662 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:11:47" (1/1) ... [2018-01-31 09:11:47,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:11:47" (1/1) ... [2018-01-31 09:11:47,675 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:11:47" (1/1) ... [2018-01-31 09:11:47,676 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:11:47" (1/1) ... [2018-01-31 09:11:47,681 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:11:47" (1/1) ... [2018-01-31 09:11:47,685 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:11:47" (1/1) ... [2018-01-31 09:11:47,687 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:11:47" (1/1) ... [2018-01-31 09:11:47,690 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 09:11:47,691 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 09:11:47,691 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 09:11:47,691 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 09:11:47,694 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:11:47" (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-31 09:11:47,751 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 09:11:47,751 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 09:11:47,751 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_data [2018-01-31 09:11:47,751 INFO L136 BoogieDeclarations]: Found implementation of procedure free_data [2018-01-31 09:11:47,751 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 09:11:47,751 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-31 09:11:47,751 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-31 09:11:47,751 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 09:11:47,752 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 09:11:47,752 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 09:11:47,752 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-31 09:11:47,752 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-31 09:11:47,752 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_data [2018-01-31 09:11:47,752 INFO L128 BoogieDeclarations]: Found specification of procedure free_data [2018-01-31 09:11:47,752 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 09:11:47,753 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 09:11:47,753 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 09:11:48,266 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 09:11:48,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:11:48 BoogieIcfgContainer [2018-01-31 09:11:48,267 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 09:11:48,268 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 09:11:48,268 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 09:11:48,273 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 09:11:48,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 09:11:47" (1/3) ... [2018-01-31 09:11:48,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@122c2ec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:11:48, skipping insertion in model container [2018-01-31 09:11:48,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:11:47" (2/3) ... [2018-01-31 09:11:48,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@122c2ec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:11:48, skipping insertion in model container [2018-01-31 09:11:48,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:11:48" (3/3) ... [2018-01-31 09:11:48,277 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0019_false-valid-memtrack_true-termination.i [2018-01-31 09:11:48,284 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 09:11:48,294 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-01-31 09:11:48,354 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 09:11:48,354 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 09:11:48,354 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 09:11:48,354 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 09:11:48,354 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 09:11:48,354 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 09:11:48,355 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 09:11:48,355 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 09:11:48,356 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 09:11:48,385 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-01-31 09:11:48,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-31 09:11:48,393 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:11:48,394 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:11:48,394 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-31 09:11:48,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1846006383, now seen corresponding path program 1 times [2018-01-31 09:11:48,404 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:11:48,404 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:11:48,464 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:48,464 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:11:48,464 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:11:48,547 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:11:48,895 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-31 09:11:48,898 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:11:48,911 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 09:11:48,913 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 09:11:48,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 09:11:48,926 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:11:48,928 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 5 states. [2018-01-31 09:11:49,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:11:49,598 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-01-31 09:11:49,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 09:11:49,600 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-01-31 09:11:49,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:11:49,609 INFO L225 Difference]: With dead ends: 54 [2018-01-31 09:11:49,610 INFO L226 Difference]: Without dead ends: 49 [2018-01-31 09:11:49,612 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:11:49,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-31 09:11:49,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-31 09:11:49,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-31 09:11:49,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-01-31 09:11:49,645 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 11 [2018-01-31 09:11:49,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:11:49,645 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-01-31 09:11:49,645 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 09:11:49,645 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-01-31 09:11:49,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-31 09:11:49,646 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:11:49,646 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:11:49,646 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-31 09:11:49,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1846006382, now seen corresponding path program 1 times [2018-01-31 09:11:49,647 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:11:49,647 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:11:49,648 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:49,648 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:11:49,648 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:49,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:11:49,684 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:11:49,960 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-31 09:11:49,961 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:11:49,961 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:11:49,963 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:11:49,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:11:49,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:11:49,963 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 6 states. [2018-01-31 09:11:50,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:11:50,396 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-01-31 09:11:50,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 09:11:50,396 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-01-31 09:11:50,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:11:50,397 INFO L225 Difference]: With dead ends: 49 [2018-01-31 09:11:50,397 INFO L226 Difference]: Without dead ends: 47 [2018-01-31 09:11:50,398 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-31 09:11:50,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-01-31 09:11:50,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-01-31 09:11:50,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-01-31 09:11:50,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-01-31 09:11:50,405 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 11 [2018-01-31 09:11:50,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:11:50,405 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-01-31 09:11:50,405 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:11:50,406 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-01-31 09:11:50,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-31 09:11:50,406 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:11:50,406 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:11:50,407 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-31 09:11:50,407 INFO L82 PathProgramCache]: Analyzing trace with hash 635583073, now seen corresponding path program 1 times [2018-01-31 09:11:50,407 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:11:50,407 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:11:50,408 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:50,408 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:11:50,409 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:50,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:11:50,429 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:11:50,523 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-31 09:11:50,523 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:11:50,523 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 09:11:50,524 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 09:11:50,524 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 09:11:50,524 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-31 09:11:50,524 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 7 states. [2018-01-31 09:11:50,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:11:50,990 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2018-01-31 09:11:50,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 09:11:50,991 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-01-31 09:11:50,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:11:50,992 INFO L225 Difference]: With dead ends: 56 [2018-01-31 09:11:50,992 INFO L226 Difference]: Without dead ends: 52 [2018-01-31 09:11:50,993 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-31 09:11:50,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-31 09:11:50,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2018-01-31 09:11:50,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-31 09:11:51,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-01-31 09:11:51,001 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 18 [2018-01-31 09:11:51,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:11:51,001 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-01-31 09:11:51,001 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 09:11:51,001 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-01-31 09:11:51,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-31 09:11:51,002 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:11:51,002 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:11:51,002 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-31 09:11:51,003 INFO L82 PathProgramCache]: Analyzing trace with hash 635583074, now seen corresponding path program 1 times [2018-01-31 09:11:51,003 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:11:51,003 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:11:51,004 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:51,004 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:11:51,004 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:51,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:11:51,023 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:11:51,206 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-31 09:11:51,207 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:11:51,207 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 09:11:51,207 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 09:11:51,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 09:11:51,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:11:51,208 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 8 states. [2018-01-31 09:11:51,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:11:51,357 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-01-31 09:11:51,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 09:11:51,358 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-01-31 09:11:51,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:11:51,359 INFO L225 Difference]: With dead ends: 45 [2018-01-31 09:11:51,359 INFO L226 Difference]: Without dead ends: 41 [2018-01-31 09:11:51,360 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-01-31 09:11:51,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-31 09:11:51,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-31 09:11:51,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-31 09:11:51,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-01-31 09:11:51,367 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 18 [2018-01-31 09:11:51,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:11:51,367 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-01-31 09:11:51,367 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 09:11:51,367 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-01-31 09:11:51,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-31 09:11:51,368 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:11:51,368 INFO L351 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] [2018-01-31 09:11:51,368 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-31 09:11:51,369 INFO L82 PathProgramCache]: Analyzing trace with hash -858086304, now seen corresponding path program 1 times [2018-01-31 09:11:51,369 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:11:51,369 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:11:51,370 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:51,370 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:11:51,370 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:11:51,391 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:11:51,660 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-31 09:11:51,661 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:11:51,661 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-31 09:11:51,661 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-31 09:11:51,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-31 09:11:51,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-31 09:11:51,662 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 11 states. [2018-01-31 09:11:51,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:11:51,864 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-01-31 09:11:51,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-31 09:11:51,868 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-01-31 09:11:51,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:11:51,869 INFO L225 Difference]: With dead ends: 41 [2018-01-31 09:11:51,870 INFO L226 Difference]: Without dead ends: 40 [2018-01-31 09:11:51,870 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2018-01-31 09:11:51,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-31 09:11:51,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-01-31 09:11:51,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-31 09:11:51,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-01-31 09:11:51,876 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 25 [2018-01-31 09:11:51,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:11:51,876 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-01-31 09:11:51,876 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-31 09:11:51,877 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-01-31 09:11:51,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-31 09:11:51,877 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:11:51,877 INFO L351 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] [2018-01-31 09:11:51,878 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-31 09:11:51,878 INFO L82 PathProgramCache]: Analyzing trace with hash -858086303, now seen corresponding path program 1 times [2018-01-31 09:11:51,878 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:11:51,878 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:11:51,879 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:51,879 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:11:51,880 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:51,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:11:51,898 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:11:52,113 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-31 09:11:52,114 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:11:52,114 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-31 09:11:52,114 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-31 09:11:52,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-31 09:11:52,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-31 09:11:52,115 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 11 states. [2018-01-31 09:11:52,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:11:52,483 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-01-31 09:11:52,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-31 09:11:52,484 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-01-31 09:11:52,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:11:52,488 INFO L225 Difference]: With dead ends: 43 [2018-01-31 09:11:52,488 INFO L226 Difference]: Without dead ends: 42 [2018-01-31 09:11:52,488 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2018-01-31 09:11:52,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-31 09:11:52,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2018-01-31 09:11:52,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-31 09:11:52,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-01-31 09:11:52,494 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 25 [2018-01-31 09:11:52,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:11:52,494 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-01-31 09:11:52,494 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-31 09:11:52,494 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-01-31 09:11:52,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-31 09:11:52,495 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:11:52,495 INFO L351 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] [2018-01-31 09:11:52,496 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-31 09:11:52,496 INFO L82 PathProgramCache]: Analyzing trace with hash -830871637, now seen corresponding path program 1 times [2018-01-31 09:11:52,496 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:11:52,496 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:11:52,497 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:52,497 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:11:52,497 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:52,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:11:52,520 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:11:52,776 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-31 09:11:52,777 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:11:52,777 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-31 09:11:52,777 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-31 09:11:52,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-31 09:11:52,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-01-31 09:11:52,778 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 12 states. [2018-01-31 09:11:53,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:11:53,022 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-01-31 09:11:53,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-31 09:11:53,023 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-01-31 09:11:53,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:11:53,024 INFO L225 Difference]: With dead ends: 42 [2018-01-31 09:11:53,024 INFO L226 Difference]: Without dead ends: 41 [2018-01-31 09:11:53,025 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-01-31 09:11:53,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-31 09:11:53,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2018-01-31 09:11:53,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-31 09:11:53,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-01-31 09:11:53,030 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 26 [2018-01-31 09:11:53,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:11:53,031 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-01-31 09:11:53,031 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-31 09:11:53,031 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-01-31 09:11:53,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-31 09:11:53,032 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:11:53,032 INFO L351 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] [2018-01-31 09:11:53,032 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-31 09:11:53,033 INFO L82 PathProgramCache]: Analyzing trace with hash -830871636, now seen corresponding path program 1 times [2018-01-31 09:11:53,033 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:11:53,033 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:11:53,034 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:53,034 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:11:53,034 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:11:53,052 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:11:53,472 WARN L146 SmtUtils]: Spent 203ms on a formula simplification. DAG size of input: 14 DAG size of output 7 [2018-01-31 09:11:53,666 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 22 DAG size of output 19 [2018-01-31 09:11:53,887 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-31 09:11:53,887 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:11:53,887 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-01-31 09:11:53,888 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-31 09:11:53,888 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-31 09:11:53,888 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-01-31 09:11:53,888 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 16 states. [2018-01-31 09:11:54,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:11:54,405 INFO L93 Difference]: Finished difference Result 46 states and 45 transitions. [2018-01-31 09:11:54,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-31 09:11:54,427 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2018-01-31 09:11:54,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:11:54,427 INFO L225 Difference]: With dead ends: 46 [2018-01-31 09:11:54,427 INFO L226 Difference]: Without dead ends: 33 [2018-01-31 09:11:54,428 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=112, Invalid=590, Unknown=0, NotChecked=0, Total=702 [2018-01-31 09:11:54,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-01-31 09:11:54,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-01-31 09:11:54,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-01-31 09:11:54,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 32 transitions. [2018-01-31 09:11:54,432 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 32 transitions. Word has length 26 [2018-01-31 09:11:54,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:11:54,432 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 32 transitions. [2018-01-31 09:11:54,432 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-31 09:11:54,432 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 32 transitions. [2018-01-31 09:11:54,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-31 09:11:54,433 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:11:54,433 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:11:54,434 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-31 09:11:54,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1290828611, now seen corresponding path program 1 times [2018-01-31 09:11:54,434 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:11:54,434 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:11:54,435 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:54,435 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:11:54,435 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:11:54,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-31 09:11:54,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-31 09:11:54,505 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-01-31 09:11:54,521 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-31 09:11:54,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 09:11:54 BoogieIcfgContainer [2018-01-31 09:11:54,539 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 09:11:54,540 INFO L168 Benchmark]: Toolchain (without parser) took 7204.88 ms. Allocated memory was 304.6 MB in the beginning and 516.9 MB in the end (delta: 212.3 MB). Free memory was 264.5 MB in the beginning and 342.8 MB in the end (delta: -78.3 MB). Peak memory consumption was 134.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:11:54,542 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 304.6 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 09:11:54,542 INFO L168 Benchmark]: CACSL2BoogieTranslator took 301.54 ms. Allocated memory is still 304.6 MB. Free memory was 263.5 MB in the beginning and 253.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:11:54,542 INFO L168 Benchmark]: Boogie Preprocessor took 45.05 ms. Allocated memory is still 304.6 MB. Free memory was 253.5 MB in the beginning and 251.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. [2018-01-31 09:11:54,543 INFO L168 Benchmark]: RCFGBuilder took 576.42 ms. Allocated memory is still 304.6 MB. Free memory was 251.4 MB in the beginning and 232.4 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:11:54,543 INFO L168 Benchmark]: TraceAbstraction took 6271.66 ms. Allocated memory was 304.6 MB in the beginning and 516.9 MB in the end (delta: 212.3 MB). Free memory was 232.4 MB in the beginning and 342.8 MB in the end (delta: -110.3 MB). Peak memory consumption was 102.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:11:54,545 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 304.6 MB. Free memory is still 270.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 301.54 ms. Allocated memory is still 304.6 MB. Free memory was 263.5 MB in the beginning and 253.5 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 45.05 ms. Allocated memory is still 304.6 MB. Free memory was 253.5 MB in the beginning and 251.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. * RCFGBuilder took 576.42 ms. Allocated memory is still 304.6 MB. Free memory was 251.4 MB in the beginning and 232.4 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 6271.66 ms. Allocated memory was 304.6 MB in the beginning and 516.9 MB in the end (delta: 212.3 MB). Free memory was 232.4 MB in the beginning and 342.8 MB in the end (delta: -110.3 MB). Peak memory consumption was 102.0 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; VAL [data={26:0}, data={26:0}, data->lo={27:0}, lo={27:0}] [L631] EXPR, FCALL data->hi VAL [data={26:0}, data={26:0}, data->hi={28:0}, lo={27:0}] [L631] void *hi = data->hi; VAL [data={26:0}, data={26:0}, data->hi={28:0}, hi={28:0}, lo={27:0}] [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, 54 locations, 17 error locations. UNSAFE Result, 6.1s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 3.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 227 SDtfs, 267 SDslu, 842 SDs, 0 SdLazy, 853 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred 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, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 13 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 192 NumberOfCodeBlocks, 192 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 152 ConstructedInterpolants, 0 QuantifiedInterpolants, 20629 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: 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_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-31_09-11-54-556.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_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_09-11-54-556.csv Received shutdown request...