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/array-examples/standard_strcpy_original_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c5b1954-m [2018-10-10 14:43:04,668 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 14:43:04,670 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 14:43:04,682 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 14:43:04,683 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 14:43:04,684 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 14:43:04,685 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 14:43:04,687 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 14:43:04,689 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 14:43:04,690 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 14:43:04,691 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 14:43:04,691 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 14:43:04,692 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 14:43:04,693 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 14:43:04,694 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 14:43:04,695 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 14:43:04,696 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 14:43:04,697 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 14:43:04,699 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 14:43:04,701 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 14:43:04,702 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 14:43:04,703 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 14:43:04,706 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 14:43:04,706 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 14:43:04,707 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 14:43:04,708 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 14:43:04,709 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 14:43:04,709 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 14:43:04,710 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 14:43:04,712 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 14:43:04,712 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 14:43:04,712 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 14:43:04,713 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 14:43:04,713 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 14:43:04,714 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 14:43:04,715 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 14:43:04,715 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,731 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 14:43:04,732 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 14:43:04,733 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-10 14:43:04,733 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-10 14:43:04,733 INFO L133 SettingsManager]: * Use SBE=true [2018-10-10 14:43:04,734 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-10 14:43:04,734 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-10 14:43:04,734 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-10 14:43:04,734 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-10 14:43:04,734 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-10 14:43:04,735 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-10 14:43:04,735 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-10 14:43:04,735 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-10 14:43:04,735 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-10 14:43:04,735 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-10 14:43:04,736 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-10 14:43:04,736 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 14:43:04,736 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-10 14:43:04,736 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-10 14:43:04,736 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-10 14:43:04,737 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:43:04,737 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 14:43:04,737 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-10 14:43:04,737 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-10 14:43:04,737 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-10 14:43:04,738 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,806 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 14:43:04,821 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 14:43:04,827 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 14:43:04,829 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-10 14:43:04,829 INFO L276 PluginConnector]: CDTParser initialized [2018-10-10 14:43:04,830 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_strcpy_original_false-valid-deref.i [2018-10-10 14:43:05,163 INFO L217 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0722221fb/c67221868c894ea6bf6b8b92e4d6b516/FLAGf3c356af8 [2018-10-10 14:43:05,381 INFO L289 CDTParser]: Found 1 translation units. [2018-10-10 14:43:05,382 INFO L157 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_strcpy_original_false-valid-deref.i [2018-10-10 14:43:05,395 INFO L337 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0722221fb/c67221868c894ea6bf6b8b92e4d6b516/FLAGf3c356af8 [2018-10-10 14:43:05,421 INFO L345 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0722221fb/c67221868c894ea6bf6b8b92e4d6b516 [2018-10-10 14:43:05,431 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 14:43:05,433 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-10 14:43:05,434 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-10 14:43:05,434 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-10 14:43:05,438 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-10 14:43:05,439 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,442 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@499fb976 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,442 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,453 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-10 14:43:05,473 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-10 14:43:05,645 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:43:05,650 INFO L189 MainTranslator]: Completed pre-run [2018-10-10 14:43:05,672 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:43:05,696 INFO L193 MainTranslator]: Completed translation [2018-10-10 14:43:05,697 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,697 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-10 14:43:05,698 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-10 14:43:05,698 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-10 14:43:05,698 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-10 14:43:05,711 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:05,722 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:05,748 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-10 14:43:05,749 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 14:43:05,749 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 14:43:05,749 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 14:43:05,760 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:05,760 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:05,763 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:05,764 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:05,776 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:05,781 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:05,783 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:05,786 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 14:43:05,786 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 14:43:05,786 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 14:43:05,786 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 14:43:05,787 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:05,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 14:43:05,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 14:43:06,811 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 14:43:06,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:43:06 BoogieIcfgContainer [2018-10-10 14:43:06,812 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 14:43:06,813 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 14:43:06,814 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 14:43:06,817 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 14:43:06,817 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:06,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57916b12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:43:06, skipping insertion in model container [2018-10-10 14:43:06,819 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:06,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57916b12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:43:06, skipping insertion in model container [2018-10-10 14:43:06,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:43:06" (3/3) ... [2018-10-10 14:43:06,821 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_strcpy_original_false-valid-deref.i [2018-10-10 14:43:06,831 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-10 14:43:06,839 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-10-10 14:43:06,855 INFO L257 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2018-10-10 14:43:06,888 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 14:43:06,889 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 14:43:06,889 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 14:43:06,889 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-10 14:43:06,889 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 14:43:06,890 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 14:43:06,890 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 14:43:06,890 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 14:43:06,890 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 14:43:06,911 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2018-10-10 14:43:06,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-10 14:43:06,920 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:06,922 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] [2018-10-10 14:43:06,924 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:06,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:06,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1805784654, now seen corresponding path program 1 times [2018-10-10 14:43:06,935 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:06,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:06,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:06,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:06,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:07,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:07,328 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,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:07,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 14:43:07,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 14:43:07,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 14:43:07,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:43:07,355 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 7 states. [2018-10-10 14:43:08,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:08,382 INFO L93 Difference]: Finished difference Result 147 states and 148 transitions. [2018-10-10 14:43:08,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:43:08,384 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2018-10-10 14:43:08,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:08,402 INFO L225 Difference]: With dead ends: 147 [2018-10-10 14:43:08,402 INFO L226 Difference]: Without dead ends: 141 [2018-10-10 14:43:08,405 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:43:08,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-10-10 14:43:08,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 138. [2018-10-10 14:43:08,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-10-10 14:43:08,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 139 transitions. [2018-10-10 14:43:08,463 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 139 transitions. Word has length 37 [2018-10-10 14:43:08,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:08,463 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 139 transitions. [2018-10-10 14:43:08,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 14:43:08,464 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 139 transitions. [2018-10-10 14:43:08,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-10 14:43:08,465 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:08,465 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] [2018-10-10 14:43:08,466 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:08,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:08,467 INFO L82 PathProgramCache]: Analyzing trace with hash -144749352, now seen corresponding path program 1 times [2018-10-10 14:43:08,467 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:08,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:08,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:08,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:08,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:08,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:08,905 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:08,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:08,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-10 14:43:08,907 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 14:43:08,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 14:43:08,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:43:08,909 INFO L87 Difference]: Start difference. First operand 138 states and 139 transitions. Second operand 12 states. [2018-10-10 14:43:10,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:10,417 INFO L93 Difference]: Finished difference Result 248 states and 250 transitions. [2018-10-10 14:43:10,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-10 14:43:10,418 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2018-10-10 14:43:10,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:10,421 INFO L225 Difference]: With dead ends: 248 [2018-10-10 14:43:10,421 INFO L226 Difference]: Without dead ends: 248 [2018-10-10 14:43:10,422 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=185, Invalid=517, Unknown=0, NotChecked=0, Total=702 [2018-10-10 14:43:10,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-10-10 14:43:10,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 182. [2018-10-10 14:43:10,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-10 14:43:10,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 187 transitions. [2018-10-10 14:43:10,456 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 187 transitions. Word has length 38 [2018-10-10 14:43:10,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:10,457 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 187 transitions. [2018-10-10 14:43:10,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 14:43:10,457 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 187 transitions. [2018-10-10 14:43:10,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-10 14:43:10,460 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:10,461 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] [2018-10-10 14:43:10,462 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:10,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:10,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1547536165, now seen corresponding path program 1 times [2018-10-10 14:43:10,463 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:10,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:10,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:10,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:10,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:10,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:10,580 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,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:10,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 14:43:10,582 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 14:43:10,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 14:43:10,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-10 14:43:10,583 INFO L87 Difference]: Start difference. First operand 182 states and 187 transitions. Second operand 5 states. [2018-10-10 14:43:10,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:10,927 INFO L93 Difference]: Finished difference Result 271 states and 280 transitions. [2018-10-10 14:43:10,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-10 14:43:10,931 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2018-10-10 14:43:10,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:10,934 INFO L225 Difference]: With dead ends: 271 [2018-10-10 14:43:10,934 INFO L226 Difference]: Without dead ends: 271 [2018-10-10 14:43:10,935 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:43:10,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-10-10 14:43:10,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 181. [2018-10-10 14:43:10,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-10 14:43:10,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 186 transitions. [2018-10-10 14:43:10,949 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 186 transitions. Word has length 60 [2018-10-10 14:43:10,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:10,949 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 186 transitions. [2018-10-10 14:43:10,950 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 14:43:10,950 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 186 transitions. [2018-10-10 14:43:10,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-10 14:43:10,952 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:10,952 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,953 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:10,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:10,953 INFO L82 PathProgramCache]: Analyzing trace with hash 728980965, now seen corresponding path program 1 times [2018-10-10 14:43:10,953 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:10,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:10,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:10,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:10,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:10,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:11,173 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,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:11,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:43:11,174 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:43:11,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:43:11,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:43:11,175 INFO L87 Difference]: Start difference. First operand 181 states and 186 transitions. Second operand 8 states. [2018-10-10 14:43:11,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:11,747 INFO L93 Difference]: Finished difference Result 388 states and 393 transitions. [2018-10-10 14:43:11,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:43:11,748 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2018-10-10 14:43:11,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:11,751 INFO L225 Difference]: With dead ends: 388 [2018-10-10 14:43:11,751 INFO L226 Difference]: Without dead ends: 388 [2018-10-10 14:43:11,752 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:43:11,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-10-10 14:43:11,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 192. [2018-10-10 14:43:11,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-10-10 14:43:11,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 197 transitions. [2018-10-10 14:43:11,766 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 197 transitions. Word has length 61 [2018-10-10 14:43:11,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:11,767 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 197 transitions. [2018-10-10 14:43:11,767 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:43:11,767 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 197 transitions. [2018-10-10 14:43:11,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-10 14:43:11,769 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:11,769 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, 1] [2018-10-10 14:43:11,770 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:11,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:11,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1515885129, now seen corresponding path program 1 times [2018-10-10 14:43:11,771 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:11,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:11,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:11,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:11,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:11,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:11,851 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,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:11,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 14:43:11,852 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 14:43:11,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 14:43:11,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-10 14:43:11,853 INFO L87 Difference]: Start difference. First operand 192 states and 197 transitions. Second operand 5 states. [2018-10-10 14:43:12,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:12,004 INFO L93 Difference]: Finished difference Result 191 states and 195 transitions. [2018-10-10 14:43:12,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-10 14:43:12,004 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2018-10-10 14:43:12,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:12,006 INFO L225 Difference]: With dead ends: 191 [2018-10-10 14:43:12,006 INFO L226 Difference]: Without dead ends: 191 [2018-10-10 14:43:12,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:43:12,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-10-10 14:43:12,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-10-10 14:43:12,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-10-10 14:43:12,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 195 transitions. [2018-10-10 14:43:12,016 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 195 transitions. Word has length 63 [2018-10-10 14:43:12,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:12,017 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 195 transitions. [2018-10-10 14:43:12,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 14:43:12,017 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 195 transitions. [2018-10-10 14:43:12,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-10 14:43:12,019 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:12,020 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, 1, 1] [2018-10-10 14:43:12,020 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:12,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:12,021 INFO L82 PathProgramCache]: Analyzing trace with hash -252201110, now seen corresponding path program 1 times [2018-10-10 14:43:12,021 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:12,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:12,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:12,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:12,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:12,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:12,541 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:12,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:12,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-10-10 14:43:12,542 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-10 14:43:12,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-10 14:43:12,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-10-10 14:43:12,543 INFO L87 Difference]: Start difference. First operand 191 states and 195 transitions. Second operand 17 states. [2018-10-10 14:43:13,553 WARN L178 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2018-10-10 14:43:13,988 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2018-10-10 14:43:14,267 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2018-10-10 14:43:14,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:14,915 INFO L93 Difference]: Finished difference Result 190 states and 193 transitions. [2018-10-10 14:43:14,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-10 14:43:14,917 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 64 [2018-10-10 14:43:14,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:14,919 INFO L225 Difference]: With dead ends: 190 [2018-10-10 14:43:14,919 INFO L226 Difference]: Without dead ends: 190 [2018-10-10 14:43:14,920 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=378, Invalid=1028, Unknown=0, NotChecked=0, Total=1406 [2018-10-10 14:43:14,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-10-10 14:43:14,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2018-10-10 14:43:14,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-10-10 14:43:14,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 193 transitions. [2018-10-10 14:43:14,926 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 193 transitions. Word has length 64 [2018-10-10 14:43:14,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:14,927 INFO L481 AbstractCegarLoop]: Abstraction has 190 states and 193 transitions. [2018-10-10 14:43:14,927 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-10 14:43:14,927 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 193 transitions. [2018-10-10 14:43:14,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-10 14:43:14,930 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:14,930 INFO L375 BasicCegarLoop]: trace histogram [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:14,930 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:14,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:14,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1072539293, now seen corresponding path program 1 times [2018-10-10 14:43:14,931 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:14,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:14,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:14,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:14,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:14,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:15,358 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:15,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:43:15,359 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:15,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:15,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:15,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:43:15,473 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:15,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:15,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:15,485 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-10 14:43:15,501 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:15,502 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:15,522 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:15,522 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-10-10 14:43:15,607 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:43:15,608 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:43:15,611 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:15,611 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:15,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:15,629 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2018-10-10 14:43:15,638 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:15,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:15,688 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:15,688 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:9 [2018-10-10 14:43:15,869 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:15,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:43:15,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 16 [2018-10-10 14:43:15,928 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/standard_strcpy_original_false-valid-deref.i_7.bpl [2018-10-10 14:43:15,932 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-10 14:43:15,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-10 14:43:15,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-10-10 14:43:15,933 INFO L87 Difference]: Start difference. First operand 190 states and 193 transitions. Second operand 17 states. [2018-10-10 14:43:17,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:17,453 INFO L93 Difference]: Finished difference Result 333 states and 337 transitions. [2018-10-10 14:43:17,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-10 14:43:17,454 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 73 [2018-10-10 14:43:17,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:17,457 INFO L225 Difference]: With dead ends: 333 [2018-10-10 14:43:17,458 INFO L226 Difference]: Without dead ends: 333 [2018-10-10 14:43:17,459 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=375, Invalid=1107, Unknown=0, NotChecked=0, Total=1482 [2018-10-10 14:43:17,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-10-10 14:43:17,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 256. [2018-10-10 14:43:17,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-10-10 14:43:17,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 261 transitions. [2018-10-10 14:43:17,467 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 261 transitions. Word has length 73 [2018-10-10 14:43:17,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:17,468 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 261 transitions. [2018-10-10 14:43:17,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-10 14:43:17,468 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 261 transitions. [2018-10-10 14:43:17,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-10 14:43:17,473 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:17,473 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:43:17,473 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:17,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:17,477 INFO L82 PathProgramCache]: Analyzing trace with hash 76191217, now seen corresponding path program 1 times [2018-10-10 14:43:17,477 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:17,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:17,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:17,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:17,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:18,047 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:18,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:18,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-10-10 14:43:18,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 14:43:18,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 14:43:18,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-10-10 14:43:18,049 INFO L87 Difference]: Start difference. First operand 256 states and 261 transitions. Second operand 16 states. [2018-10-10 14:43:19,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:19,229 INFO L93 Difference]: Finished difference Result 255 states and 260 transitions. [2018-10-10 14:43:19,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 14:43:19,230 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 76 [2018-10-10 14:43:19,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:19,232 INFO L225 Difference]: With dead ends: 255 [2018-10-10 14:43:19,232 INFO L226 Difference]: Without dead ends: 238 [2018-10-10 14:43:19,233 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=148, Invalid=974, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 14:43:19,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-10-10 14:43:19,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2018-10-10 14:43:19,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-10-10 14:43:19,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 241 transitions. [2018-10-10 14:43:19,239 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 241 transitions. Word has length 76 [2018-10-10 14:43:19,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:19,239 INFO L481 AbstractCegarLoop]: Abstraction has 238 states and 241 transitions. [2018-10-10 14:43:19,239 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 14:43:19,240 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 241 transitions. [2018-10-10 14:43:19,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-10 14:43:19,242 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:19,242 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-10 14:43:19,242 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:19,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:19,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1694247296, now seen corresponding path program 1 times [2018-10-10 14:43:19,243 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:19,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:19,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:19,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:19,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:19,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:20,192 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:20,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:43:20,193 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:20,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:20,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:20,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:43:20,352 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:20,352 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:20,358 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:20,358 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-10 14:43:20,456 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:20,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:43:20,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 19 [2018-10-10 14:43:20,494 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/standard_strcpy_original_false-valid-deref.i_9.bpl [2018-10-10 14:43:20,495 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-10 14:43:20,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-10 14:43:20,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-10-10 14:43:20,496 INFO L87 Difference]: Start difference. First operand 238 states and 241 transitions. Second operand 20 states. [2018-10-10 14:43:21,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:21,648 INFO L93 Difference]: Finished difference Result 436 states and 440 transitions. [2018-10-10 14:43:21,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 14:43:21,648 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 96 [2018-10-10 14:43:21,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:21,652 INFO L225 Difference]: With dead ends: 436 [2018-10-10 14:43:21,652 INFO L226 Difference]: Without dead ends: 436 [2018-10-10 14:43:21,653 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2018-10-10 14:43:21,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-10-10 14:43:21,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 249. [2018-10-10 14:43:21,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-10-10 14:43:21,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 252 transitions. [2018-10-10 14:43:21,661 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 252 transitions. Word has length 96 [2018-10-10 14:43:21,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:21,661 INFO L481 AbstractCegarLoop]: Abstraction has 249 states and 252 transitions. [2018-10-10 14:43:21,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-10 14:43:21,662 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 252 transitions. [2018-10-10 14:43:21,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-10 14:43:21,663 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:21,664 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-10 14:43:21,665 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:21,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:21,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1411445064, now seen corresponding path program 2 times [2018-10-10 14:43:21,665 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:21,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:21,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:21,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:21,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:21,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:22,628 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:22,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:43:22,629 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:43:22,639 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-10 14:43:22,696 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-10 14:43:22,696 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-10 14:43:22,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:43:22,722 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:22,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:22,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:22,748 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-10 14:43:22,753 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:22,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:22,767 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:22,767 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-10-10 14:43:22,810 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:43:22,811 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:43:22,811 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:22,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:22,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:22,817 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2018-10-10 14:43:22,827 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:22,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:22,837 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:22,838 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:9 [2018-10-10 14:43:23,047 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:23,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:43:23,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 18 [2018-10-10 14:43:23,071 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-10 14:43:23,075 WARN L205 ceAbstractionStarter]: Timeout [2018-10-10 14:43:23,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 02:43:23 BoogieIcfgContainer [2018-10-10 14:43:23,076 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 14:43:23,076 INFO L168 Benchmark]: Toolchain (without parser) took 17644.53 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -961.0 MB). Peak memory consumption was 56.7 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:23,078 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:23,078 INFO L168 Benchmark]: CACSL2BoogieTranslator took 263.24 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:23,079 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.39 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:23,079 INFO L168 Benchmark]: Boogie Preprocessor took 36.90 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:23,080 INFO L168 Benchmark]: RCFGBuilder took 1026.35 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 761.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -784.3 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:23,081 INFO L168 Benchmark]: TraceAbstraction took 16262.28 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 256.4 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -187.3 MB). Peak memory consumption was 69.1 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:23,085 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 263.24 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 50.39 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 36.90 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 1026.35 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 761.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -784.3 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16262.28 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 256.4 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -187.3 MB). Peak memory consumption was 69.1 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 10). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 10). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 10). - TimeoutResultAtElement [Line: 3]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 3). Cancelled while PathProgramDumpController was trying to verify (iteration 10). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 10). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 10). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 10). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 10). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 10). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 10). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 10). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 10). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 10). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 13 error locations. TIMEOUT Result, 16.1s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 9.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1192 SDtfs, 10341 SDslu, 3246 SDs, 0 SdLazy, 2414 SolverSat, 455 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 368 GetRequests, 175 SyntacticMatches, 4 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 7.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=256occurred in iteration=7, 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.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 619 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 737 NumberOfCodeBlocks, 737 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 726 ConstructedInterpolants, 0 QuantifiedInterpolants, 474408 SizeOfPredicates, 22 NumberOfNonLiveVariables, 313 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 0/66 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Received shutdown request...