java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --traceabstraction.dump.automata.to.the.following.directory dump --rcfgbuilder.size.of.a.code.block SingleStatement --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/memsafety/960521-1_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c5b1954-m [2018-10-10 14:43:04,689 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 14:43:04,691 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 14:43:04,703 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 14:43:04,706 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 14:43:04,708 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 14:43:04,709 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 14:43:04,713 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 14:43:04,719 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 14:43:04,720 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 14:43:04,721 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 14:43:04,722 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 14:43:04,723 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 14:43:04,724 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 14:43:04,727 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 14:43:04,729 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 14:43:04,730 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 14:43:04,741 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 14:43:04,743 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 14:43:04,746 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 14:43:04,748 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 14:43:04,750 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 14:43:04,757 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 14:43:04,757 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 14:43:04,757 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 14:43:04,758 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 14:43:04,760 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 14:43:04,761 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 14:43:04,761 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 14:43:04,765 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 14:43:04,765 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 14:43:04,766 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 14:43:04,766 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 14:43:04,766 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 14:43:04,768 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 14:43:04,769 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 14:43:04,770 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-10-10 14:43:04,795 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 14:43:04,797 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 14:43:04,801 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-10 14:43:04,801 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-10 14:43:04,801 INFO L133 SettingsManager]: * Use SBE=true [2018-10-10 14:43:04,802 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-10 14:43:04,802 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-10 14:43:04,802 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-10 14:43:04,802 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-10 14:43:04,802 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-10 14:43:04,803 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-10 14:43:04,803 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-10 14:43:04,803 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-10 14:43:04,803 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-10 14:43:04,803 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-10 14:43:04,804 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-10 14:43:04,804 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 14:43:04,804 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-10 14:43:04,804 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-10 14:43:04,805 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-10 14:43:04,805 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:43:04,805 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 14:43:04,805 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-10 14:43:04,805 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-10 14:43:04,806 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-10 14:43:04,806 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Dump automata to the following directory -> dump Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> SingleStatement Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-10-10 14:43:04,859 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 14:43:04,877 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 14:43:04,882 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 14:43:04,883 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-10 14:43:04,884 INFO L276 PluginConnector]: CDTParser initialized [2018-10-10 14:43:04,885 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/960521-1_false-valid-deref.i [2018-10-10 14:43:05,198 INFO L217 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9c4d3520/e11f8b0779944f99b718828c16f0564a/FLAGed0671dc0 [2018-10-10 14:43:05,516 INFO L289 CDTParser]: Found 1 translation units. [2018-10-10 14:43:05,517 INFO L157 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety/960521-1_false-valid-deref.i [2018-10-10 14:43:05,533 INFO L337 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9c4d3520/e11f8b0779944f99b718828c16f0564a/FLAGed0671dc0 [2018-10-10 14:43:05,548 INFO L345 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9c4d3520/e11f8b0779944f99b718828c16f0564a [2018-10-10 14:43:05,557 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 14:43:05,558 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-10 14:43:05,559 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-10 14:43:05,559 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-10 14:43:05,563 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-10 14:43:05,564 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:43:05" (1/1) ... [2018-10-10 14:43:05,567 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ae1ba27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:05, skipping insertion in model container [2018-10-10 14:43:05,567 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:43:05" (1/1) ... [2018-10-10 14:43:05,578 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-10 14:43:05,623 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-10 14:43:05,852 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:43:05,864 INFO L189 MainTranslator]: Completed pre-run [2018-10-10 14:43:05,920 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:43:05,991 INFO L193 MainTranslator]: Completed translation [2018-10-10 14:43:05,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:05 WrapperNode [2018-10-10 14:43:05,992 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-10 14:43:05,993 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-10 14:43:05,993 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-10 14:43:05,993 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-10 14:43:06,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:05" (1/1) ... [2018-10-10 14:43:06,030 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:05" (1/1) ... [2018-10-10 14:43:06,058 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-10 14:43:06,059 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 14:43:06,059 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 14:43:06,059 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 14:43:06,070 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:05" (1/1) ... [2018-10-10 14:43:06,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:05" (1/1) ... [2018-10-10 14:43:06,074 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:05" (1/1) ... [2018-10-10 14:43:06,075 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:05" (1/1) ... [2018-10-10 14:43:06,082 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:05" (1/1) ... [2018-10-10 14:43:06,088 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:05" (1/1) ... [2018-10-10 14:43:06,089 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:05" (1/1) ... [2018-10-10 14:43:06,092 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 14:43:06,093 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 14:43:06,093 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 14:43:06,093 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 14:43:06,094 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:05" (1/1) ... No working directory specified, using /storage/repos/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-10-10 14:43:06,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 14:43:06,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 14:43:07,111 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 14:43:07,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:43:07 BoogieIcfgContainer [2018-10-10 14:43:07,112 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 14:43:07,113 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 14:43:07,113 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 14:43:07,117 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 14:43:07,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 02:43:05" (1/3) ... [2018-10-10 14:43:07,118 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dd0bc82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:43:07, skipping insertion in model container [2018-10-10 14:43:07,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:05" (2/3) ... [2018-10-10 14:43:07,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dd0bc82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:43:07, skipping insertion in model container [2018-10-10 14:43:07,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:43:07" (3/3) ... [2018-10-10 14:43:07,121 INFO L112 eAbstractionObserver]: Analyzing ICFG 960521-1_false-valid-deref.i [2018-10-10 14:43:07,129 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-10 14:43:07,137 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-10-10 14:43:07,154 INFO L257 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2018-10-10 14:43:07,184 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 14:43:07,185 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 14:43:07,185 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 14:43:07,185 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-10 14:43:07,185 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 14:43:07,186 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 14:43:07,186 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 14:43:07,186 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 14:43:07,186 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 14:43:07,209 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states. [2018-10-10 14:43:07,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-10 14:43:07,219 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:07,220 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:43:07,223 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2018-10-10 14:43:07,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:07,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1463978231, now seen corresponding path program 1 times [2018-10-10 14:43:07,233 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:07,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:07,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:07,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:07,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:07,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:07,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:07,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:07,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 14:43:07,596 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 14:43:07,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 14:43:07,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:43:07,615 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 7 states. [2018-10-10 14:43:08,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:08,876 INFO L93 Difference]: Finished difference Result 154 states and 156 transitions. [2018-10-10 14:43:08,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:43:08,878 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 44 [2018-10-10 14:43:08,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:08,891 INFO L225 Difference]: With dead ends: 154 [2018-10-10 14:43:08,891 INFO L226 Difference]: Without dead ends: 149 [2018-10-10 14:43:08,893 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:43:08,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-10-10 14:43:08,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-10-10 14:43:08,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-10-10 14:43:08,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 151 transitions. [2018-10-10 14:43:08,939 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 151 transitions. Word has length 44 [2018-10-10 14:43:08,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:08,940 INFO L481 AbstractCegarLoop]: Abstraction has 149 states and 151 transitions. [2018-10-10 14:43:08,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 14:43:08,940 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 151 transitions. [2018-10-10 14:43:08,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-10 14:43:08,941 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:08,942 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:43:08,943 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2018-10-10 14:43:08,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:08,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1861315018, now seen corresponding path program 1 times [2018-10-10 14:43:08,943 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:08,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:08,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:08,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:08,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:08,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:09,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:09,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:09,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-10 14:43:09,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 14:43:09,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 14:43:09,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-10-10 14:43:09,260 INFO L87 Difference]: Start difference. First operand 149 states and 151 transitions. Second operand 10 states. [2018-10-10 14:43:10,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:10,124 INFO L93 Difference]: Finished difference Result 218 states and 222 transitions. [2018-10-10 14:43:10,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 14:43:10,125 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2018-10-10 14:43:10,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:10,128 INFO L225 Difference]: With dead ends: 218 [2018-10-10 14:43:10,128 INFO L226 Difference]: Without dead ends: 218 [2018-10-10 14:43:10,130 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2018-10-10 14:43:10,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-10-10 14:43:10,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 148. [2018-10-10 14:43:10,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-10-10 14:43:10,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 150 transitions. [2018-10-10 14:43:10,144 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 150 transitions. Word has length 45 [2018-10-10 14:43:10,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:10,145 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 150 transitions. [2018-10-10 14:43:10,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 14:43:10,145 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 150 transitions. [2018-10-10 14:43:10,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-10 14:43:10,147 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:10,147 INFO L375 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, 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-10-10 14:43:10,148 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2018-10-10 14:43:10,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:10,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1667522659, now seen corresponding path program 1 times [2018-10-10 14:43:10,149 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:10,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:10,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:10,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:10,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:10,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:10,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:10,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:10,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:43:10,410 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:43:10,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:43:10,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:43:10,410 INFO L87 Difference]: Start difference. First operand 148 states and 150 transitions. Second operand 8 states. [2018-10-10 14:43:10,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:10,951 INFO L93 Difference]: Finished difference Result 145 states and 147 transitions. [2018-10-10 14:43:10,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 14:43:10,952 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2018-10-10 14:43:10,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:10,954 INFO L225 Difference]: With dead ends: 145 [2018-10-10 14:43:10,954 INFO L226 Difference]: Without dead ends: 145 [2018-10-10 14:43:10,955 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:43:10,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-10-10 14:43:10,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-10-10 14:43:10,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-10-10 14:43:10,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 147 transitions. [2018-10-10 14:43:10,965 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 147 transitions. Word has length 61 [2018-10-10 14:43:10,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:10,965 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 147 transitions. [2018-10-10 14:43:10,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:43:10,966 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 147 transitions. [2018-10-10 14:43:10,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-10 14:43:10,967 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:10,968 INFO L375 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, 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-10-10 14:43:10,968 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2018-10-10 14:43:10,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:10,969 INFO L82 PathProgramCache]: Analyzing trace with hash 153594980, now seen corresponding path program 1 times [2018-10-10 14:43:10,969 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:10,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:10,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:10,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:10,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:10,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:11,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:11,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:11,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-10-10 14:43:11,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 14:43:11,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 14:43:11,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:43:11,492 INFO L87 Difference]: Start difference. First operand 145 states and 147 transitions. Second operand 14 states. [2018-10-10 14:43:12,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:12,997 INFO L93 Difference]: Finished difference Result 184 states and 187 transitions. [2018-10-10 14:43:12,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-10 14:43:12,998 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 62 [2018-10-10 14:43:12,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:13,001 INFO L225 Difference]: With dead ends: 184 [2018-10-10 14:43:13,001 INFO L226 Difference]: Without dead ends: 184 [2018-10-10 14:43:13,002 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=248, Invalid=682, Unknown=0, NotChecked=0, Total=930 [2018-10-10 14:43:13,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-10-10 14:43:13,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 152. [2018-10-10 14:43:13,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-10-10 14:43:13,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 154 transitions. [2018-10-10 14:43:13,016 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 154 transitions. Word has length 62 [2018-10-10 14:43:13,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:13,016 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 154 transitions. [2018-10-10 14:43:13,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 14:43:13,017 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 154 transitions. [2018-10-10 14:43:13,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-10 14:43:13,019 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:13,020 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-10 14:43:13,021 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2018-10-10 14:43:13,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:13,021 INFO L82 PathProgramCache]: Analyzing trace with hash -603442218, now seen corresponding path program 1 times [2018-10-10 14:43:13,021 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:13,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:13,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:13,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:13,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:13,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:13,459 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:13,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:43:13,459 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:43:13,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:13,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:13,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:43:13,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 14:43:13,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:13,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:13,608 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-10 14:43:13,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 14:43:13,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:13,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:13,637 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-10-10 14:43:13,699 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:43:13,701 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:43:13,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-10 14:43:13,702 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:13,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:13,714 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2018-10-10 14:43:13,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-10-10 14:43:13,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:13,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:13,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:9 [2018-10-10 14:43:13,908 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:13,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:43:13,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 18 [2018-10-10 14:43:13,972 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/960521-1_false-valid-deref.i_5.bpl [2018-10-10 14:43:13,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-10 14:43:13,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-10 14:43:13,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-10-10 14:43:13,977 INFO L87 Difference]: Start difference. First operand 152 states and 154 transitions. Second operand 19 states. [2018-10-10 14:43:15,100 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-10-10 14:43:16,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:16,046 INFO L93 Difference]: Finished difference Result 199 states and 202 transitions. [2018-10-10 14:43:16,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-10 14:43:16,046 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 77 [2018-10-10 14:43:16,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:16,049 INFO L225 Difference]: With dead ends: 199 [2018-10-10 14:43:16,049 INFO L226 Difference]: Without dead ends: 199 [2018-10-10 14:43:16,051 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=474, Invalid=1418, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 14:43:16,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-10-10 14:43:16,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 167. [2018-10-10 14:43:16,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-10-10 14:43:16,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 169 transitions. [2018-10-10 14:43:16,058 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 169 transitions. Word has length 77 [2018-10-10 14:43:16,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:16,059 INFO L481 AbstractCegarLoop]: Abstraction has 167 states and 169 transitions. [2018-10-10 14:43:16,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-10 14:43:16,059 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 169 transitions. [2018-10-10 14:43:16,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-10 14:43:16,062 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:16,063 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:43:16,063 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2018-10-10 14:43:16,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:16,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1277008420, now seen corresponding path program 2 times [2018-10-10 14:43:16,064 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:16,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:16,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:16,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:16,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:16,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:16,714 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:16,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:43:16,714 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:43:16,724 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-10 14:43:16,759 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-10 14:43:16,759 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-10 14:43:16,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:43:16,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 14:43:16,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:16,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:16,796 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-10 14:43:16,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 14:43:16,800 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:16,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:16,813 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-10-10 14:43:16,837 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:43:16,847 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:43:16,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-10 14:43:16,848 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:16,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:16,945 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2018-10-10 14:43:17,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-10-10 14:43:17,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:17,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:17,087 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:9 [2018-10-10 14:43:17,211 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:17,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:43:17,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 23 [2018-10-10 14:43:17,234 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-10 14:43:17,239 WARN L205 ceAbstractionStarter]: Timeout [2018-10-10 14:43:17,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 02:43:17 BoogieIcfgContainer [2018-10-10 14:43:17,240 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 14:43:17,241 INFO L168 Benchmark]: Toolchain (without parser) took 11683.89 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 872.9 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -697.3 MB). Peak memory consumption was 175.7 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:17,242 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:43:17,243 INFO L168 Benchmark]: CACSL2BoogieTranslator took 433.36 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:17,244 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.55 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:43:17,244 INFO L168 Benchmark]: Boogie Preprocessor took 33.69 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:43:17,245 INFO L168 Benchmark]: RCFGBuilder took 1019.37 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -773.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:17,246 INFO L168 Benchmark]: TraceAbstraction took 10127.05 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 122.2 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 55.2 MB). Peak memory consumption was 177.3 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:17,250 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 433.36 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.55 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.69 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1019.37 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -773.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10127.05 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 122.2 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 55.2 MB). Peak memory consumption was 177.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 6). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 6). - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while PathProgramDumpController was trying to verify (iteration 6). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 6). - TimeoutResultAtElement [Line: 639]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while PathProgramDumpController was trying to verify (iteration 6). - TimeoutResultAtElement [Line: 629]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 629). Cancelled while PathProgramDumpController was trying to verify (iteration 6). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 6). - TimeoutResultAtElement [Line: 639]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while PathProgramDumpController was trying to verify (iteration 6). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 6). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 6). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 6). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 6). - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while PathProgramDumpController was trying to verify (iteration 6). - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while PathProgramDumpController was trying to verify (iteration 6). - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 637). Cancelled while PathProgramDumpController was trying to verify (iteration 6). - TimeoutResultAtElement [Line: 639]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while PathProgramDumpController was trying to verify (iteration 6). - TimeoutResultAtElement [Line: 639]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 639). Cancelled while PathProgramDumpController was trying to verify (iteration 6). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 156 locations, 17 error locations. TIMEOUT Result, 10.0s OverallTime, 6 OverallIterations, 3 TraceHistogramMax, 6.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 554 SDtfs, 4358 SDslu, 1811 SDs, 0 SdLazy, 1425 SolverSat, 106 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 192 GetRequests, 79 SyntacticMatches, 3 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=5, 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, 5 MinimizatonAttempts, 134 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 366 NumberOfCodeBlocks, 366 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 360 ConstructedInterpolants, 0 QuantifiedInterpolants, 164444 SizeOfPredicates, 20 NumberOfNonLiveVariables, 149 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 0/14 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Received shutdown request...