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-memsafety/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c5b1954-m [2018-10-10 14:42:36,664 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 14:42:36,666 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 14:42:36,680 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 14:42:36,680 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 14:42:36,681 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 14:42:36,685 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 14:42:36,687 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 14:42:36,689 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 14:42:36,690 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 14:42:36,691 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 14:42:36,691 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 14:42:36,692 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 14:42:36,693 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 14:42:36,694 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 14:42:36,695 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 14:42:36,696 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 14:42:36,698 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 14:42:36,700 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 14:42:36,701 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 14:42:36,705 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 14:42:36,706 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 14:42:36,712 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 14:42:36,712 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 14:42:36,712 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 14:42:36,718 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 14:42:36,719 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 14:42:36,720 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 14:42:36,721 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 14:42:36,724 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 14:42:36,725 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 14:42:36,725 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 14:42:36,726 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 14:42:36,726 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 14:42:36,729 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 14:42:36,730 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 14:42:36,730 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:42:36,759 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 14:42:36,760 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 14:42:36,761 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-10 14:42:36,764 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-10 14:42:36,764 INFO L133 SettingsManager]: * Use SBE=true [2018-10-10 14:42:36,765 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-10 14:42:36,765 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-10 14:42:36,765 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-10 14:42:36,765 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-10 14:42:36,765 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-10 14:42:36,766 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-10 14:42:36,766 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-10 14:42:36,766 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-10 14:42:36,766 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-10 14:42:36,766 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-10 14:42:36,767 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-10 14:42:36,768 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 14:42:36,768 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-10 14:42:36,768 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-10 14:42:36,769 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-10 14:42:36,769 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:42:36,769 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 14:42:36,769 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-10 14:42:36,769 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-10 14:42:36,770 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-10 14:42:36,770 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:42:36,847 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 14:42:36,868 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 14:42:36,873 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 14:42:36,875 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-10 14:42:36,875 INFO L276 PluginConnector]: CDTParser initialized [2018-10-10 14:42:36,876 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:42:37,182 INFO L217 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/464aede84/5313248263c24411b367fd2da4202512/FLAG3a5df7846 [2018-10-10 14:42:37,464 INFO L289 CDTParser]: Found 1 translation units. [2018-10-10 14:42:37,465 INFO L157 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-memsafety/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:42:37,479 INFO L337 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/464aede84/5313248263c24411b367fd2da4202512/FLAG3a5df7846 [2018-10-10 14:42:37,495 INFO L345 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/464aede84/5313248263c24411b367fd2da4202512 [2018-10-10 14:42:37,505 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 14:42:37,506 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-10 14:42:37,508 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-10 14:42:37,508 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-10 14:42:37,512 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-10 14:42:37,513 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:42:37" (1/1) ... [2018-10-10 14:42:37,517 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48874ad2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:37, skipping insertion in model container [2018-10-10 14:42:37,517 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:42:37" (1/1) ... [2018-10-10 14:42:37,528 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-10 14:42:37,595 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-10 14:42:37,867 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:42:37,882 INFO L189 MainTranslator]: Completed pre-run [2018-10-10 14:42:37,976 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:42:38,056 INFO L193 MainTranslator]: Completed translation [2018-10-10 14:42:38,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:38 WrapperNode [2018-10-10 14:42:38,057 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-10 14:42:38,058 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-10 14:42:38,058 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-10 14:42:38,059 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-10 14:42:38,070 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:42:38" (1/1) ... [2018-10-10 14:42:38,095 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:42:38" (1/1) ... [2018-10-10 14:42:38,140 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-10 14:42:38,140 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 14:42:38,140 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 14:42:38,140 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 14:42:38,152 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:38" (1/1) ... [2018-10-10 14:42:38,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:38" (1/1) ... [2018-10-10 14:42:38,165 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:38" (1/1) ... [2018-10-10 14:42:38,165 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:38" (1/1) ... [2018-10-10 14:42:38,183 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:38" (1/1) ... [2018-10-10 14:42:38,309 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:38" (1/1) ... [2018-10-10 14:42:38,311 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:38" (1/1) ... [2018-10-10 14:42:38,314 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 14:42:38,314 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 14:42:38,314 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 14:42:38,314 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 14:42:38,315 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:38" (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:42:38,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 14:42:38,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 14:42:39,279 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 14:42:39,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:42:39 BoogieIcfgContainer [2018-10-10 14:42:39,280 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 14:42:39,281 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 14:42:39,281 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 14:42:39,284 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 14:42:39,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 02:42:37" (1/3) ... [2018-10-10 14:42:39,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@641316f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:42:39, skipping insertion in model container [2018-10-10 14:42:39,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:38" (2/3) ... [2018-10-10 14:42:39,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@641316f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:42:39, skipping insertion in model container [2018-10-10 14:42:39,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:42:39" (3/3) ... [2018-10-10 14:42:39,288 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:42:39,298 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-10 14:42:39,307 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-10-10 14:42:39,325 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2018-10-10 14:42:39,352 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 14:42:39,353 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 14:42:39,353 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 14:42:39,354 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-10 14:42:39,354 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 14:42:39,354 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 14:42:39,355 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 14:42:39,355 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 14:42:39,355 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 14:42:39,375 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2018-10-10 14:42:39,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-10 14:42:39,385 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:39,386 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] [2018-10-10 14:42:39,389 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:42:39,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:39,396 INFO L82 PathProgramCache]: Analyzing trace with hash 989039711, now seen corresponding path program 1 times [2018-10-10 14:42:39,398 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:39,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:39,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:39,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:39,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:39,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:39,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:39,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:42:39,905 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:42:39,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:42:39,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:42:39,925 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 8 states. [2018-10-10 14:42:40,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:40,798 INFO L93 Difference]: Finished difference Result 143 states and 146 transitions. [2018-10-10 14:42:40,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:42:40,800 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-10-10 14:42:40,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:40,814 INFO L225 Difference]: With dead ends: 143 [2018-10-10 14:42:40,814 INFO L226 Difference]: Without dead ends: 138 [2018-10-10 14:42:40,816 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:42:40,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-10-10 14:42:40,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-10-10 14:42:40,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-10-10 14:42:40,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 141 transitions. [2018-10-10 14:42:40,864 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 141 transitions. Word has length 46 [2018-10-10 14:42:40,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:40,865 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 141 transitions. [2018-10-10 14:42:40,865 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:42:40,865 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 141 transitions. [2018-10-10 14:42:40,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-10 14:42:40,867 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:40,867 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] [2018-10-10 14:42:40,868 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:42:40,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:40,868 INFO L82 PathProgramCache]: Analyzing trace with hash 595460060, now seen corresponding path program 1 times [2018-10-10 14:42:40,868 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:40,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:40,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:40,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:40,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:40,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:41,444 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:42:41,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:41,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-10 14:42:41,446 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 14:42:41,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 14:42:41,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:42:41,447 INFO L87 Difference]: Start difference. First operand 138 states and 141 transitions. Second operand 13 states. [2018-10-10 14:42:42,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:42,394 INFO L93 Difference]: Finished difference Result 137 states and 140 transitions. [2018-10-10 14:42:42,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 14:42:42,395 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2018-10-10 14:42:42,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:42,398 INFO L225 Difference]: With dead ends: 137 [2018-10-10 14:42:42,399 INFO L226 Difference]: Without dead ends: 137 [2018-10-10 14:42:42,400 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2018-10-10 14:42:42,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-10-10 14:42:42,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-10-10 14:42:42,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-10-10 14:42:42,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 140 transitions. [2018-10-10 14:42:42,411 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 140 transitions. Word has length 47 [2018-10-10 14:42:42,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:42,411 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 140 transitions. [2018-10-10 14:42:42,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 14:42:42,412 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 140 transitions. [2018-10-10 14:42:42,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-10 14:42:42,413 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:42,414 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] [2018-10-10 14:42:42,414 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:42:42,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:42,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1452289403, now seen corresponding path program 1 times [2018-10-10 14:42:42,415 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:42,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:42,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:42,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:42,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:42,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:42,505 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:42:42,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:42,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:42:42,507 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:42:42,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:42:42,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:42:42,508 INFO L87 Difference]: Start difference. First operand 137 states and 140 transitions. Second operand 6 states. [2018-10-10 14:42:42,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:42,691 INFO L93 Difference]: Finished difference Result 136 states and 139 transitions. [2018-10-10 14:42:42,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 14:42:42,692 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-10-10 14:42:42,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:42,695 INFO L225 Difference]: With dead ends: 136 [2018-10-10 14:42:42,695 INFO L226 Difference]: Without dead ends: 136 [2018-10-10 14:42:42,696 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:42:42,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-10-10 14:42:42,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-10-10 14:42:42,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-10-10 14:42:42,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 139 transitions. [2018-10-10 14:42:42,705 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 139 transitions. Word has length 56 [2018-10-10 14:42:42,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:42,705 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 139 transitions. [2018-10-10 14:42:42,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:42:42,706 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 139 transitions. [2018-10-10 14:42:42,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-10 14:42:42,707 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:42,708 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] [2018-10-10 14:42:42,708 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:42:42,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:42,709 INFO L82 PathProgramCache]: Analyzing trace with hash -2071298430, now seen corresponding path program 1 times [2018-10-10 14:42:42,709 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:42,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:42,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:42,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:42,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:42,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:43,054 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:42:43,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:43,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:42:43,055 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:42:43,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:42:43,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:42:43,056 INFO L87 Difference]: Start difference. First operand 136 states and 139 transitions. Second operand 9 states. [2018-10-10 14:42:43,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:43,358 INFO L93 Difference]: Finished difference Result 135 states and 138 transitions. [2018-10-10 14:42:43,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:42:43,359 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2018-10-10 14:42:43,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:43,361 INFO L225 Difference]: With dead ends: 135 [2018-10-10 14:42:43,361 INFO L226 Difference]: Without dead ends: 135 [2018-10-10 14:42:43,362 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:42:43,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-10 14:42:43,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-10-10 14:42:43,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-10-10 14:42:43,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 138 transitions. [2018-10-10 14:42:43,369 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 138 transitions. Word has length 57 [2018-10-10 14:42:43,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:43,370 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 138 transitions. [2018-10-10 14:42:43,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:42:43,370 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 138 transitions. [2018-10-10 14:42:43,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-10 14:42:43,372 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:43,372 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, 1] [2018-10-10 14:42:43,372 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:42:43,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:43,373 INFO L82 PathProgramCache]: Analyzing trace with hash -2018136242, now seen corresponding path program 1 times [2018-10-10 14:42:43,373 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:43,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:43,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:43,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:43,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:43,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:43,540 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:42:43,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:43,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-10 14:42:43,541 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 14:42:43,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 14:42:43,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-10 14:42:43,542 INFO L87 Difference]: Start difference. First operand 135 states and 138 transitions. Second operand 10 states. [2018-10-10 14:42:43,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:43,978 INFO L93 Difference]: Finished difference Result 138 states and 141 transitions. [2018-10-10 14:42:43,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 14:42:43,979 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2018-10-10 14:42:43,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:43,981 INFO L225 Difference]: With dead ends: 138 [2018-10-10 14:42:43,981 INFO L226 Difference]: Without dead ends: 138 [2018-10-10 14:42:43,982 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-10-10 14:42:43,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-10-10 14:42:43,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 134. [2018-10-10 14:42:43,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-10-10 14:42:43,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 137 transitions. [2018-10-10 14:42:43,989 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 137 transitions. Word has length 77 [2018-10-10 14:42:43,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:43,990 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 137 transitions. [2018-10-10 14:42:43,990 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 14:42:43,991 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 137 transitions. [2018-10-10 14:42:43,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-10 14:42:43,992 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:43,992 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, 1, 1] [2018-10-10 14:42:43,993 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:42:43,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:43,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1862286065, now seen corresponding path program 1 times [2018-10-10 14:42:43,993 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:43,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:43,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:43,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:43,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:44,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:44,234 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:42:44,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:44,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-10 14:42:44,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 14:42:44,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 14:42:44,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:42:44,235 INFO L87 Difference]: Start difference. First operand 134 states and 137 transitions. Second operand 13 states. [2018-10-10 14:42:45,225 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-10-10 14:42:45,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:45,444 INFO L93 Difference]: Finished difference Result 155 states and 158 transitions. [2018-10-10 14:42:45,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-10 14:42:45,444 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 78 [2018-10-10 14:42:45,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:45,446 INFO L225 Difference]: With dead ends: 155 [2018-10-10 14:42:45,446 INFO L226 Difference]: Without dead ends: 155 [2018-10-10 14:42:45,446 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=191, Invalid=511, Unknown=0, NotChecked=0, Total=702 [2018-10-10 14:42:45,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-10-10 14:42:45,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 140. [2018-10-10 14:42:45,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-10 14:42:45,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 143 transitions. [2018-10-10 14:42:45,454 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 143 transitions. Word has length 78 [2018-10-10 14:42:45,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:45,454 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 143 transitions. [2018-10-10 14:42:45,454 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 14:42:45,455 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 143 transitions. [2018-10-10 14:42:45,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-10 14:42:45,456 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:45,457 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:45,457 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:42:45,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:45,458 INFO L82 PathProgramCache]: Analyzing trace with hash -2082905574, now seen corresponding path program 1 times [2018-10-10 14:42:45,458 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:45,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:45,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:45,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:45,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:45,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:45,630 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:42:45,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:45,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-10 14:42:45,631 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 14:42:45,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 14:42:45,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-10-10 14:42:45,632 INFO L87 Difference]: Start difference. First operand 140 states and 143 transitions. Second operand 10 states. [2018-10-10 14:42:46,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:46,048 INFO L93 Difference]: Finished difference Result 149 states and 152 transitions. [2018-10-10 14:42:46,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 14:42:46,049 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2018-10-10 14:42:46,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:46,051 INFO L225 Difference]: With dead ends: 149 [2018-10-10 14:42:46,051 INFO L226 Difference]: Without dead ends: 149 [2018-10-10 14:42:46,052 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2018-10-10 14:42:46,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-10-10 14:42:46,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 139. [2018-10-10 14:42:46,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-10-10 14:42:46,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 142 transitions. [2018-10-10 14:42:46,063 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 142 transitions. Word has length 94 [2018-10-10 14:42:46,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:46,063 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 142 transitions. [2018-10-10 14:42:46,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 14:42:46,064 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 142 transitions. [2018-10-10 14:42:46,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-10 14:42:46,066 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:46,067 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:46,067 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:42:46,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:46,069 INFO L82 PathProgramCache]: Analyzing trace with hash -145563205, now seen corresponding path program 1 times [2018-10-10 14:42:46,069 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:46,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:46,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:46,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:46,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:46,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:46,396 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:42:46,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:46,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-10 14:42:46,397 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 14:42:46,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 14:42:46,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:42:46,398 INFO L87 Difference]: Start difference. First operand 139 states and 142 transitions. Second operand 13 states. [2018-10-10 14:42:47,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:47,150 INFO L93 Difference]: Finished difference Result 189 states and 193 transitions. [2018-10-10 14:42:47,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-10 14:42:47,150 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 95 [2018-10-10 14:42:47,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:47,152 INFO L225 Difference]: With dead ends: 189 [2018-10-10 14:42:47,152 INFO L226 Difference]: Without dead ends: 189 [2018-10-10 14:42:47,153 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=224, Invalid=478, Unknown=0, NotChecked=0, Total=702 [2018-10-10 14:42:47,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-10-10 14:42:47,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 146. [2018-10-10 14:42:47,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-10-10 14:42:47,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 149 transitions. [2018-10-10 14:42:47,157 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 149 transitions. Word has length 95 [2018-10-10 14:42:47,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:47,158 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 149 transitions. [2018-10-10 14:42:47,158 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 14:42:47,158 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 149 transitions. [2018-10-10 14:42:47,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-10 14:42:47,160 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:47,160 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:47,161 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:42:47,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:47,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1311057914, now seen corresponding path program 1 times [2018-10-10 14:42:47,161 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:47,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:47,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:47,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:47,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:48,500 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:48,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:48,501 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:42:48,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:48,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:48,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:48,633 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:42:48,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:48,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:48,663 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-10 14:42:48,801 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:48,822 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:48,824 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:42:48,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:48,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:48,887 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-10-10 14:42:49,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-10 14:42:49,170 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 8 treesize of output 7 [2018-10-10 14:42:49,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:49,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:49,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:42:49,183 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-10-10 14:42:49,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-10-10 14:42:49,625 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 8 treesize of output 7 [2018-10-10 14:42:49,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:49,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:49,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:42:49,646 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:36, output treesize:21 [2018-10-10 14:42:50,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-10 14:42:50,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-10-10 14:42:50,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-10 14:42:50,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:42:50,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:42:50,269 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-10-10 14:42:50,986 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:51,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:42:51,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 47 [2018-10-10 14:42:51,052 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i_9.bpl [2018-10-10 14:42:51,056 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-10 14:42:51,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-10 14:42:51,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=2122, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 14:42:51,058 INFO L87 Difference]: Start difference. First operand 146 states and 149 transitions. Second operand 48 states. [2018-10-10 14:42:53,837 WARN L178 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 88 [2018-10-10 14:42:54,230 WARN L178 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 96 [2018-10-10 14:42:54,954 WARN L178 SmtUtils]: Spent 619.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 99 [2018-10-10 14:42:55,266 WARN L178 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 102 [2018-10-10 14:42:55,579 WARN L178 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 99 [2018-10-10 14:42:55,806 WARN L178 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 93 [2018-10-10 14:42:56,089 WARN L178 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 84 [2018-10-10 14:42:56,712 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2018-10-10 14:42:56,946 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 83 [2018-10-10 14:42:57,248 WARN L178 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2018-10-10 14:42:57,540 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2018-10-10 14:42:57,869 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2018-10-10 14:42:58,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:58,310 INFO L93 Difference]: Finished difference Result 240 states and 244 transitions. [2018-10-10 14:42:58,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-10 14:42:58,310 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 112 [2018-10-10 14:42:58,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:58,313 INFO L225 Difference]: With dead ends: 240 [2018-10-10 14:42:58,313 INFO L226 Difference]: Without dead ends: 240 [2018-10-10 14:42:58,316 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1390 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=1205, Invalid=6277, Unknown=0, NotChecked=0, Total=7482 [2018-10-10 14:42:58,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-10-10 14:42:58,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 187. [2018-10-10 14:42:58,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-10-10 14:42:58,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 193 transitions. [2018-10-10 14:42:58,322 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 193 transitions. Word has length 112 [2018-10-10 14:42:58,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:58,323 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 193 transitions. [2018-10-10 14:42:58,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-10 14:42:58,323 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 193 transitions. [2018-10-10 14:42:58,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-10-10 14:42:58,324 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:58,325 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:58,325 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:42:58,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:58,325 INFO L82 PathProgramCache]: Analyzing trace with hash -718476467, now seen corresponding path program 1 times [2018-10-10 14:42:58,326 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:58,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:58,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:58,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:58,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:58,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:59,085 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 22 [2018-10-10 14:42:59,542 WARN L178 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 24 [2018-10-10 14:42:59,855 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:42:59,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:59,856 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:42:59,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:59,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:59,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:59,949 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:42:59,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:00,049 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:00,049 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-10 14:43:00,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-10 14:43:00,559 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 8 treesize of output 7 [2018-10-10 14:43:00,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:00,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:00,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:43:00,576 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-10-10 14:43:01,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-10 14:43:01,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-10-10 14:43:01,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-10 14:43:01,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:43:01,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:43:01,176 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-10-10 14:43:01,460 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:01,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:43:01,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 36 [2018-10-10 14:43:01,502 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/openbsd_cstrspn-alloca_true-valid-memsafety_true-termination.i_10.bpl [2018-10-10 14:43:01,504 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-10 14:43:01,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-10 14:43:01,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1230, Unknown=0, NotChecked=0, Total=1332 [2018-10-10 14:43:01,505 INFO L87 Difference]: Start difference. First operand 187 states and 193 transitions. Second operand 37 states. [2018-10-10 14:43:03,123 WARN L178 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2018-10-10 14:43:03,433 WARN L178 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2018-10-10 14:43:03,767 WARN L178 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 88 [2018-10-10 14:43:04,074 WARN L178 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 91 [2018-10-10 14:43:04,292 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 80 [2018-10-10 14:43:04,626 WARN L178 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 88 [2018-10-10 14:43:04,849 WARN L178 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2018-10-10 14:43:05,460 WARN L178 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2018-10-10 14:43:05,857 WARN L178 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2018-10-10 14:43:06,056 WARN L178 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2018-10-10 14:43:06,208 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2018-10-10 14:43:06,469 WARN L178 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2018-10-10 14:43:06,834 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2018-10-10 14:43:06,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:06,951 INFO L93 Difference]: Finished difference Result 332 states and 344 transitions. [2018-10-10 14:43:06,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-10 14:43:06,959 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 113 [2018-10-10 14:43:06,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:06,961 INFO L225 Difference]: With dead ends: 332 [2018-10-10 14:43:06,961 INFO L226 Difference]: Without dead ends: 332 [2018-10-10 14:43:06,963 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=941, Invalid=3481, Unknown=0, NotChecked=0, Total=4422 [2018-10-10 14:43:06,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-10-10 14:43:06,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 223. [2018-10-10 14:43:06,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-10-10 14:43:06,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 233 transitions. [2018-10-10 14:43:06,969 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 233 transitions. Word has length 113 [2018-10-10 14:43:06,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:06,969 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 233 transitions. [2018-10-10 14:43:06,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-10 14:43:06,969 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 233 transitions. [2018-10-10 14:43:06,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-10 14:43:06,971 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:06,971 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,971 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:43:06,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:06,972 INFO L82 PathProgramCache]: Analyzing trace with hash -308001233, now seen corresponding path program 1 times [2018-10-10 14:43:06,972 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:06,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:06,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:06,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:06,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:07,634 WARN L178 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-10-10 14:43:08,257 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,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:08,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-10-10 14:43:08,258 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-10 14:43:08,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-10 14:43:08,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-10-10 14:43:08,259 INFO L87 Difference]: Start difference. First operand 223 states and 233 transitions. Second operand 21 states. [2018-10-10 14:43:09,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:09,412 INFO L93 Difference]: Finished difference Result 222 states and 232 transitions. [2018-10-10 14:43:09,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-10 14:43:09,412 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 125 [2018-10-10 14:43:09,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:09,414 INFO L225 Difference]: With dead ends: 222 [2018-10-10 14:43:09,414 INFO L226 Difference]: Without dead ends: 200 [2018-10-10 14:43:09,415 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=213, Invalid=1509, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 14:43:09,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-10-10 14:43:09,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2018-10-10 14:43:09,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-10 14:43:09,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 207 transitions. [2018-10-10 14:43:09,420 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 207 transitions. Word has length 125 [2018-10-10 14:43:09,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:09,421 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 207 transitions. [2018-10-10 14:43:09,421 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-10 14:43:09,421 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 207 transitions. [2018-10-10 14:43:09,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-10 14:43:09,422 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:09,423 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,423 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:43:09,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:09,423 INFO L82 PathProgramCache]: Analyzing trace with hash -115182497, now seen corresponding path program 2 times [2018-10-10 14:43:09,424 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:09,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:09,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:09,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:09,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:09,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:10,904 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:10,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:43:10,905 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:10,912 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-10 14:43:10,951 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-10 14:43:10,951 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-10 14:43:10,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:43:11,064 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:11,065 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:11,080 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:11,081 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-10 14:43:11,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-10 14:43:11,268 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 8 treesize of output 7 [2018-10-10 14:43:11,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:11,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:11,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:43:11,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:27 [2018-10-10 14:43:12,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-10 14:43:12,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-10-10 14:43:12,186 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-10 14:43:12,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:43:12,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:43:12,212 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:29 [2018-10-10 14:43:12,777 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:12,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:43:12,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 45 [2018-10-10 14:43:12,799 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-10 14:43:12,803 WARN L205 ceAbstractionStarter]: Timeout [2018-10-10 14:43:12,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 02:43:12 BoogieIcfgContainer [2018-10-10 14:43:12,803 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 14:43:12,804 INFO L168 Benchmark]: Toolchain (without parser) took 35298.25 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -817.6 MB). Peak memory consumption was 300.7 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:12,805 INFO L168 Benchmark]: CDTParser took 0.21 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:12,805 INFO L168 Benchmark]: CACSL2BoogieTranslator took 549.92 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:12,806 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.58 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:12,806 INFO L168 Benchmark]: Boogie Preprocessor took 173.70 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 769.1 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -854.3 MB). Peak memory consumption was 16.6 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:12,807 INFO L168 Benchmark]: RCFGBuilder took 966.13 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 52.2 MB). Peak memory consumption was 52.2 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:12,808 INFO L168 Benchmark]: TraceAbstraction took 33522.04 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 349.2 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -50.3 MB). Peak memory consumption was 298.8 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:12,812 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.21 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 549.92 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 81.58 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 173.70 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 769.1 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -854.3 MB). Peak memory consumption was 16.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 966.13 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 52.2 MB). Peak memory consumption was 52.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 33522.04 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 349.2 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -50.3 MB). Peak memory consumption was 298.8 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 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: 552]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 552). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 144 locations, 9 error locations. TIMEOUT Result, 33.4s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 19.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1278 SDtfs, 9401 SDslu, 8517 SDs, 0 SdLazy, 4581 SolverSat, 143 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 526 GetRequests, 202 SyntacticMatches, 3 SemanticMatches, 321 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2566 ImplicationChecksByTransitivity, 20.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=223occurred in iteration=10, 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, 11 MinimizatonAttempts, 234 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 1125 NumberOfCodeBlocks, 1125 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1112 ConstructedInterpolants, 69 QuantifiedInterpolants, 1034786 SizeOfPredicates, 72 NumberOfNonLiveVariables, 462 ConjunctsInSsa, 133 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 0/26 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Received shutdown request...