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/lis-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c5b1954-m [2018-10-10 14:41:51,682 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 14:41:51,684 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 14:41:51,701 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 14:41:51,701 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 14:41:51,702 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 14:41:51,704 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 14:41:51,706 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 14:41:51,708 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 14:41:51,710 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 14:41:51,711 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 14:41:51,711 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 14:41:51,714 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 14:41:51,715 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 14:41:51,716 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 14:41:51,719 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 14:41:51,720 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 14:41:51,730 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 14:41:51,732 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 14:41:51,736 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 14:41:51,737 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 14:41:51,739 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 14:41:51,742 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 14:41:51,743 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 14:41:51,743 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 14:41:51,744 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 14:41:51,745 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 14:41:51,747 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 14:41:51,748 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 14:41:51,750 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 14:41:51,750 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 14:41:51,751 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 14:41:51,751 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 14:41:51,751 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 14:41:51,753 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 14:41:51,754 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 14:41:51,754 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:41:51,780 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 14:41:51,781 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 14:41:51,784 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-10 14:41:51,784 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-10 14:41:51,785 INFO L133 SettingsManager]: * Use SBE=true [2018-10-10 14:41:51,786 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-10 14:41:51,786 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-10 14:41:51,786 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-10 14:41:51,786 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-10 14:41:51,786 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-10 14:41:51,786 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-10 14:41:51,787 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-10 14:41:51,787 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-10 14:41:51,787 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-10 14:41:51,787 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-10 14:41:51,787 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-10 14:41:51,788 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 14:41:51,788 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-10 14:41:51,788 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-10 14:41:51,789 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-10 14:41:51,789 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:41:51,789 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 14:41:51,789 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-10 14:41:51,789 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-10 14:41:51,790 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-10 14:41:51,790 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:41:51,865 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 14:41:51,881 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 14:41:51,885 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 14:41:51,887 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-10 14:41:51,887 INFO L276 PluginConnector]: CDTParser initialized [2018-10-10 14:41:51,888 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:41:52,236 INFO L217 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80583d5fe/e2e0c9ab850b407f99125dcb70df226c/FLAG7202315ab [2018-10-10 14:41:52,458 INFO L289 CDTParser]: Found 1 translation units. [2018-10-10 14:41:52,458 INFO L157 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-memsafety/lis-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:41:52,483 INFO L337 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80583d5fe/e2e0c9ab850b407f99125dcb70df226c/FLAG7202315ab [2018-10-10 14:41:52,496 INFO L345 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80583d5fe/e2e0c9ab850b407f99125dcb70df226c [2018-10-10 14:41:52,505 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 14:41:52,507 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-10 14:41:52,508 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-10 14:41:52,508 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-10 14:41:52,514 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-10 14:41:52,515 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:41:52" (1/1) ... [2018-10-10 14:41:52,518 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e15d4db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:52, skipping insertion in model container [2018-10-10 14:41:52,518 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:41:52" (1/1) ... [2018-10-10 14:41:52,528 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-10 14:41:52,584 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-10 14:41:52,855 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:41:52,866 INFO L189 MainTranslator]: Completed pre-run [2018-10-10 14:41:52,940 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:41:53,020 INFO L193 MainTranslator]: Completed translation [2018-10-10 14:41:53,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:53 WrapperNode [2018-10-10 14:41:53,021 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-10 14:41:53,022 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-10 14:41:53,022 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-10 14:41:53,022 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-10 14:41:53,034 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:41:53" (1/1) ... [2018-10-10 14:41:53,059 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:41:53" (1/1) ... [2018-10-10 14:41:53,106 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-10 14:41:53,107 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 14:41:53,107 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 14:41:53,107 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 14:41:53,115 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:53" (1/1) ... [2018-10-10 14:41:53,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:53" (1/1) ... [2018-10-10 14:41:53,122 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:53" (1/1) ... [2018-10-10 14:41:53,122 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:53" (1/1) ... [2018-10-10 14:41:53,132 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:53" (1/1) ... [2018-10-10 14:41:53,139 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:53" (1/1) ... [2018-10-10 14:41:53,142 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:53" (1/1) ... [2018-10-10 14:41:53,146 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 14:41:53,147 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 14:41:53,147 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 14:41:53,147 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 14:41:53,148 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:53" (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:41:53,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 14:41:53,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 14:41:54,638 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 14:41:54,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:41:54 BoogieIcfgContainer [2018-10-10 14:41:54,639 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 14:41:54,640 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 14:41:54,640 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 14:41:54,643 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 14:41:54,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 02:41:52" (1/3) ... [2018-10-10 14:41:54,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7de32b06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:41:54, skipping insertion in model container [2018-10-10 14:41:54,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:53" (2/3) ... [2018-10-10 14:41:54,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7de32b06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:41:54, skipping insertion in model container [2018-10-10 14:41:54,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:41:54" (3/3) ... [2018-10-10 14:41:54,647 INFO L112 eAbstractionObserver]: Analyzing ICFG lis-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:41:54,657 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-10 14:41:54,666 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2018-10-10 14:41:54,683 INFO L257 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2018-10-10 14:41:54,716 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 14:41:54,716 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 14:41:54,717 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 14:41:54,717 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-10 14:41:54,717 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 14:41:54,717 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 14:41:54,717 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 14:41:54,717 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 14:41:54,718 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 14:41:54,746 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states. [2018-10-10 14:41:54,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-10 14:41:54,757 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:54,759 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] [2018-10-10 14:41:54,762 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:54,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:54,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1824719898, now seen corresponding path program 1 times [2018-10-10 14:41:54,770 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:54,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:54,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:54,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:54,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:55,260 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:41:55,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:55,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:41:55,268 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:41:55,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:41:55,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:41:55,288 INFO L87 Difference]: Start difference. First operand 273 states. Second operand 8 states. [2018-10-10 14:41:56,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:56,795 INFO L93 Difference]: Finished difference Result 405 states and 419 transitions. [2018-10-10 14:41:56,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:41:56,802 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2018-10-10 14:41:56,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:56,818 INFO L225 Difference]: With dead ends: 405 [2018-10-10 14:41:56,819 INFO L226 Difference]: Without dead ends: 400 [2018-10-10 14:41:56,821 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:41:56,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2018-10-10 14:41:56,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 266. [2018-10-10 14:41:56,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-10-10 14:41:56,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 273 transitions. [2018-10-10 14:41:56,884 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 273 transitions. Word has length 69 [2018-10-10 14:41:56,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:56,885 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 273 transitions. [2018-10-10 14:41:56,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:41:56,885 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 273 transitions. [2018-10-10 14:41:56,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-10 14:41:56,887 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:56,888 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] [2018-10-10 14:41:56,889 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:56,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:56,889 INFO L82 PathProgramCache]: Analyzing trace with hash -731741875, now seen corresponding path program 1 times [2018-10-10 14:41:56,889 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:56,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:56,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:56,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:56,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:56,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:57,353 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:41:57,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:57,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-10-10 14:41:57,355 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 14:41:57,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 14:41:57,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-10-10 14:41:57,356 INFO L87 Difference]: Start difference. First operand 266 states and 273 transitions. Second operand 16 states. [2018-10-10 14:41:59,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:59,887 INFO L93 Difference]: Finished difference Result 325 states and 333 transitions. [2018-10-10 14:41:59,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-10 14:41:59,894 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 70 [2018-10-10 14:41:59,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:59,898 INFO L225 Difference]: With dead ends: 325 [2018-10-10 14:41:59,898 INFO L226 Difference]: Without dead ends: 325 [2018-10-10 14:41:59,902 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=380, Invalid=1026, Unknown=0, NotChecked=0, Total=1406 [2018-10-10 14:41:59,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-10-10 14:41:59,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 275. [2018-10-10 14:41:59,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-10-10 14:41:59,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 282 transitions. [2018-10-10 14:41:59,937 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 282 transitions. Word has length 70 [2018-10-10 14:41:59,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:59,938 INFO L481 AbstractCegarLoop]: Abstraction has 275 states and 282 transitions. [2018-10-10 14:41:59,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 14:41:59,938 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 282 transitions. [2018-10-10 14:41:59,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-10 14:41:59,944 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:59,947 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] [2018-10-10 14:41:59,948 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:59,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:59,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1390761036, now seen corresponding path program 1 times [2018-10-10 14:41:59,948 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:59,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:59,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:59,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:59,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:59,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:00,095 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:00,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:00,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:42:00,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:42:00,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:42:00,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:42:00,097 INFO L87 Difference]: Start difference. First operand 275 states and 282 transitions. Second operand 6 states. [2018-10-10 14:42:00,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:00,355 INFO L93 Difference]: Finished difference Result 273 states and 280 transitions. [2018-10-10 14:42:00,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 14:42:00,355 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2018-10-10 14:42:00,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:00,358 INFO L225 Difference]: With dead ends: 273 [2018-10-10 14:42:00,359 INFO L226 Difference]: Without dead ends: 273 [2018-10-10 14:42:00,359 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:00,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-10-10 14:42:00,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2018-10-10 14:42:00,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-10-10 14:42:00,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 280 transitions. [2018-10-10 14:42:00,369 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 280 transitions. Word has length 79 [2018-10-10 14:42:00,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:00,370 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 280 transitions. [2018-10-10 14:42:00,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:42:00,370 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 280 transitions. [2018-10-10 14:42:00,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-10 14:42:00,371 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:00,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, 1, 1, 1] [2018-10-10 14:42:00,373 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:00,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:00,373 INFO L82 PathProgramCache]: Analyzing trace with hash 163919283, now seen corresponding path program 1 times [2018-10-10 14:42:00,373 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:00,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:00,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:00,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:00,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:00,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:00,861 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:00,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:00,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-10 14:42:00,862 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 14:42:00,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 14:42:00,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:42:00,863 INFO L87 Difference]: Start difference. First operand 273 states and 280 transitions. Second operand 12 states. [2018-10-10 14:42:01,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:01,600 INFO L93 Difference]: Finished difference Result 321 states and 329 transitions. [2018-10-10 14:42:01,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 14:42:01,605 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 80 [2018-10-10 14:42:01,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:01,607 INFO L225 Difference]: With dead ends: 321 [2018-10-10 14:42:01,608 INFO L226 Difference]: Without dead ends: 321 [2018-10-10 14:42:01,608 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=198, Invalid=402, Unknown=0, NotChecked=0, Total=600 [2018-10-10 14:42:01,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-10-10 14:42:01,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 283. [2018-10-10 14:42:01,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-10-10 14:42:01,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 290 transitions. [2018-10-10 14:42:01,620 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 290 transitions. Word has length 80 [2018-10-10 14:42:01,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:01,621 INFO L481 AbstractCegarLoop]: Abstraction has 283 states and 290 transitions. [2018-10-10 14:42:01,621 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 14:42:01,621 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 290 transitions. [2018-10-10 14:42:01,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-10 14:42:01,623 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:01,624 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] [2018-10-10 14:42:01,625 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:01,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:01,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1470472755, now seen corresponding path program 1 times [2018-10-10 14:42:01,625 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:01,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:01,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:01,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:01,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:02,136 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:02,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:02,136 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:02,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:02,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:02,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:02,255 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:02,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:02,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:02,265 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-10-10 14:42:02,311 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:02,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:02,380 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:42:02,380 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:16 [2018-10-10 14:42:02,426 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:02,427 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:02,428 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:02,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:02,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:02,471 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2018-10-10 14:42:02,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-10-10 14:42:02,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:02,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:02,521 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:11 [2018-10-10 14:42:02,736 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:02,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:42:02,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 19 [2018-10-10 14:42:02,828 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/lis-alloca_true-valid-memsafety_true-termination.i_5.bpl [2018-10-10 14:42:02,832 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-10 14:42:02,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-10 14:42:02,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2018-10-10 14:42:02,833 INFO L87 Difference]: Start difference. First operand 283 states and 290 transitions. Second operand 20 states. [2018-10-10 14:42:05,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:05,926 INFO L93 Difference]: Finished difference Result 428 states and 440 transitions. [2018-10-10 14:42:05,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-10 14:42:05,926 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 95 [2018-10-10 14:42:05,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:05,930 INFO L225 Difference]: With dead ends: 428 [2018-10-10 14:42:05,931 INFO L226 Difference]: Without dead ends: 428 [2018-10-10 14:42:05,932 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 91 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=414, Invalid=1392, Unknown=0, NotChecked=0, Total=1806 [2018-10-10 14:42:05,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-10-10 14:42:05,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 375. [2018-10-10 14:42:05,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-10-10 14:42:05,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 397 transitions. [2018-10-10 14:42:05,941 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 397 transitions. Word has length 95 [2018-10-10 14:42:05,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:05,942 INFO L481 AbstractCegarLoop]: Abstraction has 375 states and 397 transitions. [2018-10-10 14:42:05,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-10 14:42:05,942 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 397 transitions. [2018-10-10 14:42:05,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-10 14:42:05,944 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:05,944 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-10 14:42:05,945 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:05,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:05,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1533291227, now seen corresponding path program 1 times [2018-10-10 14:42:05,945 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:05,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:05,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:05,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:05,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:05,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:06,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:06,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:06,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 14:42:06,144 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 14:42:06,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 14:42:06,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-10 14:42:06,145 INFO L87 Difference]: Start difference. First operand 375 states and 397 transitions. Second operand 5 states. [2018-10-10 14:42:06,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:06,423 INFO L93 Difference]: Finished difference Result 389 states and 411 transitions. [2018-10-10 14:42:06,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 14:42:06,423 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2018-10-10 14:42:06,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:06,426 INFO L225 Difference]: With dead ends: 389 [2018-10-10 14:42:06,427 INFO L226 Difference]: Without dead ends: 389 [2018-10-10 14:42:06,427 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:42:06,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-10-10 14:42:06,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 370. [2018-10-10 14:42:06,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-10-10 14:42:06,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 389 transitions. [2018-10-10 14:42:06,435 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 389 transitions. Word has length 99 [2018-10-10 14:42:06,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:06,435 INFO L481 AbstractCegarLoop]: Abstraction has 370 states and 389 transitions. [2018-10-10 14:42:06,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 14:42:06,436 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 389 transitions. [2018-10-10 14:42:06,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-10 14:42:06,437 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:06,437 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-10 14:42:06,438 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:06,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:06,438 INFO L82 PathProgramCache]: Analyzing trace with hash -567134147, now seen corresponding path program 1 times [2018-10-10 14:42:06,439 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:06,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:06,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:06,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:06,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:06,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:07,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:07,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:07,118 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:07,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:07,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:07,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:07,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:07,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:42:07,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2018-10-10 14:42:07,569 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/lis-alloca_true-valid-memsafety_true-termination.i_7.bpl [2018-10-10 14:42:07,570 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 14:42:07,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 14:42:07,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-10-10 14:42:07,571 INFO L87 Difference]: Start difference. First operand 370 states and 389 transitions. Second operand 10 states. [2018-10-10 14:42:07,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:07,830 INFO L93 Difference]: Finished difference Result 539 states and 554 transitions. [2018-10-10 14:42:07,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 14:42:07,833 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 99 [2018-10-10 14:42:07,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:07,836 INFO L225 Difference]: With dead ends: 539 [2018-10-10 14:42:07,836 INFO L226 Difference]: Without dead ends: 539 [2018-10-10 14:42:07,836 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-10-10 14:42:07,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2018-10-10 14:42:07,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 383. [2018-10-10 14:42:07,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-10-10 14:42:07,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 403 transitions. [2018-10-10 14:42:07,845 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 403 transitions. Word has length 99 [2018-10-10 14:42:07,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:07,846 INFO L481 AbstractCegarLoop]: Abstraction has 383 states and 403 transitions. [2018-10-10 14:42:07,846 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 14:42:07,846 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 403 transitions. [2018-10-10 14:42:07,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-10 14:42:07,847 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:07,847 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-10 14:42:07,848 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:07,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:07,848 INFO L82 PathProgramCache]: Analyzing trace with hash 287388077, now seen corresponding path program 1 times [2018-10-10 14:42:07,848 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:07,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:07,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:07,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:07,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:07,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:08,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:08,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:08,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-10 14:42:08,022 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 14:42:08,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 14:42:08,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-10-10 14:42:08,023 INFO L87 Difference]: Start difference. First operand 383 states and 403 transitions. Second operand 10 states. [2018-10-10 14:42:08,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:08,579 INFO L93 Difference]: Finished difference Result 429 states and 453 transitions. [2018-10-10 14:42:08,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-10 14:42:08,579 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 100 [2018-10-10 14:42:08,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:08,583 INFO L225 Difference]: With dead ends: 429 [2018-10-10 14:42:08,583 INFO L226 Difference]: Without dead ends: 429 [2018-10-10 14:42:08,584 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2018-10-10 14:42:08,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2018-10-10 14:42:08,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 399. [2018-10-10 14:42:08,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-10-10 14:42:08,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 420 transitions. [2018-10-10 14:42:08,593 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 420 transitions. Word has length 100 [2018-10-10 14:42:08,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:08,593 INFO L481 AbstractCegarLoop]: Abstraction has 399 states and 420 transitions. [2018-10-10 14:42:08,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 14:42:08,593 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 420 transitions. [2018-10-10 14:42:08,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-10-10 14:42:08,594 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:08,595 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,596 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:08,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:08,596 INFO L82 PathProgramCache]: Analyzing trace with hash -250024167, now seen corresponding path program 1 times [2018-10-10 14:42:08,596 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:08,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:08,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:08,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:08,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:08,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:08,856 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:08,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:08,857 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:42:08,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:08,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:08,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:08,942 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:08,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:08,957 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:42:08,957 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-10-10 14:42:09,296 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:09,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:42:09,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-10-10 14:42:09,336 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/lis-alloca_true-valid-memsafety_true-termination.i_9.bpl [2018-10-10 14:42:09,337 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 14:42:09,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 14:42:09,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-10-10 14:42:09,338 INFO L87 Difference]: Start difference. First operand 399 states and 420 transitions. Second operand 15 states. [2018-10-10 14:42:11,366 WARN L178 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-10-10 14:42:11,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:11,988 INFO L93 Difference]: Finished difference Result 599 states and 618 transitions. [2018-10-10 14:42:11,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-10 14:42:11,990 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 105 [2018-10-10 14:42:11,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:11,994 INFO L225 Difference]: With dead ends: 599 [2018-10-10 14:42:11,995 INFO L226 Difference]: Without dead ends: 599 [2018-10-10 14:42:11,995 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=264, Invalid=666, Unknown=0, NotChecked=0, Total=930 [2018-10-10 14:42:11,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2018-10-10 14:42:12,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 398. [2018-10-10 14:42:12,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-10-10 14:42:12,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 418 transitions. [2018-10-10 14:42:12,005 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 418 transitions. Word has length 105 [2018-10-10 14:42:12,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:12,005 INFO L481 AbstractCegarLoop]: Abstraction has 398 states and 418 transitions. [2018-10-10 14:42:12,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 14:42:12,006 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 418 transitions. [2018-10-10 14:42:12,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-10-10 14:42:12,007 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:12,007 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, 1, 1, 1, 1] [2018-10-10 14:42:12,008 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:12,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:12,008 INFO L82 PathProgramCache]: Analyzing trace with hash -731546147, now seen corresponding path program 1 times [2018-10-10 14:42:12,008 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:12,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:12,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:12,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:12,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:12,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:12,163 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:12,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:12,164 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:42:12,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:12,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:12,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:12,440 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:12,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:42:12,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-10-10 14:42:12,477 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/lis-alloca_true-valid-memsafety_true-termination.i_10.bpl [2018-10-10 14:42:12,479 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 14:42:12,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 14:42:12,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:42:12,480 INFO L87 Difference]: Start difference. First operand 398 states and 418 transitions. Second operand 14 states. [2018-10-10 14:42:12,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:12,770 INFO L93 Difference]: Finished difference Result 503 states and 516 transitions. [2018-10-10 14:42:12,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 14:42:12,771 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 117 [2018-10-10 14:42:12,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:12,774 INFO L225 Difference]: With dead ends: 503 [2018-10-10 14:42:12,774 INFO L226 Difference]: Without dead ends: 503 [2018-10-10 14:42:12,775 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2018-10-10 14:42:12,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2018-10-10 14:42:12,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 431. [2018-10-10 14:42:12,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-10-10 14:42:12,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 452 transitions. [2018-10-10 14:42:12,783 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 452 transitions. Word has length 117 [2018-10-10 14:42:12,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:12,783 INFO L481 AbstractCegarLoop]: Abstraction has 431 states and 452 transitions. [2018-10-10 14:42:12,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 14:42:12,784 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 452 transitions. [2018-10-10 14:42:12,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-10 14:42:12,785 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:12,785 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12,786 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:12,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:12,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1449478423, now seen corresponding path program 2 times [2018-10-10 14:42:12,786 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:12,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:12,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:12,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:12,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:12,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:13,011 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-10 14:42:13,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:13,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-10 14:42:13,012 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 14:42:13,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 14:42:13,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:42:13,012 INFO L87 Difference]: Start difference. First operand 431 states and 452 transitions. Second operand 11 states. [2018-10-10 14:42:13,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:13,526 INFO L93 Difference]: Finished difference Result 448 states and 470 transitions. [2018-10-10 14:42:13,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-10 14:42:13,527 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 124 [2018-10-10 14:42:13,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:13,530 INFO L225 Difference]: With dead ends: 448 [2018-10-10 14:42:13,530 INFO L226 Difference]: Without dead ends: 448 [2018-10-10 14:42:13,531 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2018-10-10 14:42:13,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2018-10-10 14:42:13,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 429. [2018-10-10 14:42:13,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-10-10 14:42:13,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 448 transitions. [2018-10-10 14:42:13,538 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 448 transitions. Word has length 124 [2018-10-10 14:42:13,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:13,539 INFO L481 AbstractCegarLoop]: Abstraction has 429 states and 448 transitions. [2018-10-10 14:42:13,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 14:42:13,539 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 448 transitions. [2018-10-10 14:42:13,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-10 14:42:13,540 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:13,540 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,541 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:13,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:13,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1984158318, now seen corresponding path program 1 times [2018-10-10 14:42:13,542 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:13,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:13,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:13,543 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-10 14:42:13,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:14,046 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-10 14:42:14,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:14,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-10-10 14:42:14,047 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-10 14:42:14,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-10 14:42:14,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2018-10-10 14:42:14,048 INFO L87 Difference]: Start difference. First operand 429 states and 448 transitions. Second operand 21 states. [2018-10-10 14:42:16,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:16,485 INFO L93 Difference]: Finished difference Result 614 states and 642 transitions. [2018-10-10 14:42:16,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-10 14:42:16,486 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 125 [2018-10-10 14:42:16,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:16,489 INFO L225 Difference]: With dead ends: 614 [2018-10-10 14:42:16,490 INFO L226 Difference]: Without dead ends: 614 [2018-10-10 14:42:16,490 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=276, Invalid=1364, Unknown=0, NotChecked=0, Total=1640 [2018-10-10 14:42:16,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2018-10-10 14:42:16,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 428. [2018-10-10 14:42:16,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-10-10 14:42:16,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 446 transitions. [2018-10-10 14:42:16,499 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 446 transitions. Word has length 125 [2018-10-10 14:42:16,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:16,500 INFO L481 AbstractCegarLoop]: Abstraction has 428 states and 446 transitions. [2018-10-10 14:42:16,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-10 14:42:16,500 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 446 transitions. [2018-10-10 14:42:16,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-10 14:42:16,501 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:16,502 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16,503 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:16,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:16,503 INFO L82 PathProgramCache]: Analyzing trace with hash -589768492, now seen corresponding path program 1 times [2018-10-10 14:42:16,503 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:16,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:16,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:16,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:16,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:16,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:17,094 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-10 14:42:17,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:17,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-10 14:42:17,095 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 14:42:17,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 14:42:17,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:42:17,096 INFO L87 Difference]: Start difference. First operand 428 states and 446 transitions. Second operand 13 states. [2018-10-10 14:42:17,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:17,972 INFO L93 Difference]: Finished difference Result 763 states and 800 transitions. [2018-10-10 14:42:17,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-10 14:42:17,975 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 135 [2018-10-10 14:42:17,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:17,978 INFO L225 Difference]: With dead ends: 763 [2018-10-10 14:42:17,978 INFO L226 Difference]: Without dead ends: 763 [2018-10-10 14:42:17,979 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=254, Invalid=558, Unknown=0, NotChecked=0, Total=812 [2018-10-10 14:42:17,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2018-10-10 14:42:17,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 460. [2018-10-10 14:42:17,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-10-10 14:42:17,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 480 transitions. [2018-10-10 14:42:17,989 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 480 transitions. Word has length 135 [2018-10-10 14:42:17,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:17,989 INFO L481 AbstractCegarLoop]: Abstraction has 460 states and 480 transitions. [2018-10-10 14:42:17,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 14:42:17,990 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 480 transitions. [2018-10-10 14:42:17,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-10 14:42:17,991 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:17,991 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17,992 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:17,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:17,992 INFO L82 PathProgramCache]: Analyzing trace with hash 71903369, now seen corresponding path program 1 times [2018-10-10 14:42:17,993 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:17,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:17,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:17,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:17,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:18,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:19,000 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:19,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:19,000 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:42:19,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:19,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:19,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:19,127 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:19,128 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:19,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:19,133 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-10 14:42:19,227 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:19,228 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:19,229 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:19,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:19,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:19,233 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-10-10 14:42:19,578 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:19,581 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:19,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:19,586 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:19,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:19,599 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-10-10 14:42:19,773 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:19,775 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:19,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:19,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:19,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:19,789 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:26, output treesize:11 [2018-10-10 14:42:19,933 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:19,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 7 [2018-10-10 14:42:19,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:19,936 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:19,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:19,939 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:7 [2018-10-10 14:42:20,023 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:20,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:42:20,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 20] total 44 [2018-10-10 14:42:20,061 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/lis-alloca_true-valid-memsafety_true-termination.i_14.bpl [2018-10-10 14:42:20,062 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-10 14:42:20,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-10 14:42:20,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1739, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 14:42:20,063 INFO L87 Difference]: Start difference. First operand 460 states and 480 transitions. Second operand 44 states. [2018-10-10 14:42:21,354 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2018-10-10 14:42:21,567 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2018-10-10 14:42:21,838 WARN L178 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2018-10-10 14:42:22,105 WARN L178 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2018-10-10 14:42:22,262 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2018-10-10 14:42:22,779 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2018-10-10 14:42:23,013 WARN L178 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2018-10-10 14:42:23,217 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2018-10-10 14:42:23,419 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2018-10-10 14:42:23,954 WARN L178 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2018-10-10 14:42:24,287 WARN L178 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2018-10-10 14:42:24,516 WARN L178 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2018-10-10 14:42:24,822 WARN L178 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 72 [2018-10-10 14:42:25,075 WARN L178 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2018-10-10 14:42:25,329 WARN L178 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2018-10-10 14:42:25,658 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2018-10-10 14:42:25,944 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 68 [2018-10-10 14:42:26,291 WARN L178 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 74 [2018-10-10 14:42:26,818 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2018-10-10 14:42:27,221 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2018-10-10 14:42:27,419 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2018-10-10 14:42:27,607 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 59 [2018-10-10 14:42:27,997 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2018-10-10 14:42:28,194 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2018-10-10 14:42:28,457 WARN L178 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2018-10-10 14:42:28,719 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2018-10-10 14:42:29,896 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2018-10-10 14:42:31,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:31,177 INFO L93 Difference]: Finished difference Result 850 states and 880 transitions. [2018-10-10 14:42:31,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-10 14:42:31,178 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 141 [2018-10-10 14:42:31,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:31,185 INFO L225 Difference]: With dead ends: 850 [2018-10-10 14:42:31,185 INFO L226 Difference]: Without dead ends: 850 [2018-10-10 14:42:31,188 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 127 SyntacticMatches, 2 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2110 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=2140, Invalid=7960, Unknown=0, NotChecked=0, Total=10100 [2018-10-10 14:42:31,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2018-10-10 14:42:31,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 459. [2018-10-10 14:42:31,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2018-10-10 14:42:31,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 478 transitions. [2018-10-10 14:42:31,202 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 478 transitions. Word has length 141 [2018-10-10 14:42:31,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:31,203 INFO L481 AbstractCegarLoop]: Abstraction has 459 states and 478 transitions. [2018-10-10 14:42:31,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-10 14:42:31,203 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 478 transitions. [2018-10-10 14:42:31,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-10 14:42:31,204 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:31,204 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31,205 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:31,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:31,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1737731069, now seen corresponding path program 1 times [2018-10-10 14:42:31,206 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:31,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:31,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:31,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:31,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:31,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:31,708 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-10 14:42:31,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:31,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-10-10 14:42:31,708 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-10 14:42:31,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-10 14:42:31,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2018-10-10 14:42:31,709 INFO L87 Difference]: Start difference. First operand 459 states and 478 transitions. Second operand 20 states. [2018-10-10 14:42:33,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:33,515 INFO L93 Difference]: Finished difference Result 460 states and 478 transitions. [2018-10-10 14:42:33,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-10 14:42:33,515 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 147 [2018-10-10 14:42:33,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:33,518 INFO L225 Difference]: With dead ends: 460 [2018-10-10 14:42:33,519 INFO L226 Difference]: Without dead ends: 460 [2018-10-10 14:42:33,520 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=615, Invalid=1547, Unknown=0, NotChecked=0, Total=2162 [2018-10-10 14:42:33,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-10-10 14:42:33,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 458. [2018-10-10 14:42:33,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-10-10 14:42:33,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 476 transitions. [2018-10-10 14:42:33,528 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 476 transitions. Word has length 147 [2018-10-10 14:42:33,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:33,528 INFO L481 AbstractCegarLoop]: Abstraction has 458 states and 476 transitions. [2018-10-10 14:42:33,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-10 14:42:33,528 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 476 transitions. [2018-10-10 14:42:33,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-10 14:42:33,530 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:33,530 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33,531 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:33,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:33,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1635679575, now seen corresponding path program 1 times [2018-10-10 14:42:33,531 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:33,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:33,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:33,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:33,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:33,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:33,797 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-10 14:42:33,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:33,797 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:42:33,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:33,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:33,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:33,899 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-10 14:42:33,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-10 14:42:33,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [14] total 17 [2018-10-10 14:42:33,921 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-10 14:42:33,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-10 14:42:33,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-10-10 14:42:33,922 INFO L87 Difference]: Start difference. First operand 458 states and 476 transitions. Second operand 17 states. [2018-10-10 14:42:35,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:35,543 INFO L93 Difference]: Finished difference Result 725 states and 741 transitions. [2018-10-10 14:42:35,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-10 14:42:35,543 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 150 [2018-10-10 14:42:35,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:35,546 INFO L225 Difference]: With dead ends: 725 [2018-10-10 14:42:35,546 INFO L226 Difference]: Without dead ends: 725 [2018-10-10 14:42:35,547 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=413, Invalid=1393, Unknown=0, NotChecked=0, Total=1806 [2018-10-10 14:42:35,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2018-10-10 14:42:35,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 488. [2018-10-10 14:42:35,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2018-10-10 14:42:35,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 507 transitions. [2018-10-10 14:42:35,556 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 507 transitions. Word has length 150 [2018-10-10 14:42:35,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:35,556 INFO L481 AbstractCegarLoop]: Abstraction has 488 states and 507 transitions. [2018-10-10 14:42:35,556 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-10 14:42:35,557 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 507 transitions. [2018-10-10 14:42:35,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-10 14:42:35,558 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:35,558 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,559 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:35,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:35,559 INFO L82 PathProgramCache]: Analyzing trace with hash 625170082, now seen corresponding path program 1 times [2018-10-10 14:42:35,559 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:35,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:35,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:35,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:35,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:35,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:37,483 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 42 [2018-10-10 14:42:37,723 WARN L178 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 42 [2018-10-10 14:42:40,225 WARN L178 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 12 [2018-10-10 14:42:41,220 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:41,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:41,221 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:42:41,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:41,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:41,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:41,499 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:41,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 23 treesize of output 25 [2018-10-10 14:42:41,500 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:41,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:41,510 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:25 [2018-10-10 14:42:41,791 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:41,792 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:41,792 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:41,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-10-10 14:42:41,793 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:41,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:41,809 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:38 [2018-10-10 14:42:42,142 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:42,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 28 [2018-10-10 14:42:42,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:42,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:42:42,171 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:30 [2018-10-10 14:42:42,446 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:42,446 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:42,449 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:42,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-10-10 14:42:42,451 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:42,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-10 14:42:42,466 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:30 [2018-10-10 14:42:42,733 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:42,734 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:42,735 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:42,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-10-10 14:42:42,736 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:42,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-10-10 14:42:42,754 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:38 [2018-10-10 14:42:42,980 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-10 14:42:43,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-10 14:42:43,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [40] total 57 [2018-10-10 14:42:43,003 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-10 14:42:43,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-10 14:42:43,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=3154, Unknown=2, NotChecked=0, Total=3306 [2018-10-10 14:42:43,004 INFO L87 Difference]: Start difference. First operand 488 states and 507 transitions. Second operand 58 states. [2018-10-10 14:42:46,222 WARN L178 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 42 [2018-10-10 14:42:46,531 WARN L178 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 44 [2018-10-10 14:42:47,019 WARN L178 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 45 [2018-10-10 14:42:47,578 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 47 [2018-10-10 14:42:47,863 WARN L178 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 48 [2018-10-10 14:42:48,115 WARN L178 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 46 [2018-10-10 14:42:48,441 WARN L178 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 54 [2018-10-10 14:42:48,742 WARN L178 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 50 [2018-10-10 14:42:49,748 WARN L178 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 61 [2018-10-10 14:42:50,165 WARN L178 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 62 [2018-10-10 14:42:50,401 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 40 [2018-10-10 14:42:50,667 WARN L178 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 48 [2018-10-10 14:42:53,649 WARN L178 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 46 [2018-10-10 14:42:54,516 WARN L178 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 56 [2018-10-10 14:42:54,808 WARN L178 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 57 [2018-10-10 14:42:55,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:55,103 INFO L93 Difference]: Finished difference Result 497 states and 513 transitions. [2018-10-10 14:42:55,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-10 14:42:55,104 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 153 [2018-10-10 14:42:55,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:55,105 INFO L225 Difference]: With dead ends: 497 [2018-10-10 14:42:55,106 INFO L226 Difference]: Without dead ends: 429 [2018-10-10 14:42:55,110 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 144 SyntacticMatches, 20 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2066 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=786, Invalid=9312, Unknown=2, NotChecked=0, Total=10100 [2018-10-10 14:42:55,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2018-10-10 14:42:55,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 424. [2018-10-10 14:42:55,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-10-10 14:42:55,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 440 transitions. [2018-10-10 14:42:55,116 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 440 transitions. Word has length 153 [2018-10-10 14:42:55,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:55,117 INFO L481 AbstractCegarLoop]: Abstraction has 424 states and 440 transitions. [2018-10-10 14:42:55,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-10 14:42:55,117 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 440 transitions. [2018-10-10 14:42:55,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-10 14:42:55,118 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:55,118 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,119 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:55,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:55,119 INFO L82 PathProgramCache]: Analyzing trace with hash 140720155, now seen corresponding path program 1 times [2018-10-10 14:42:55,119 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:55,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:55,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:55,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:55,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:55,206 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-10 14:42:55,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:55,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-10 14:42:55,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-10 14:42:55,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-10 14:42:55,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 14:42:55,208 INFO L87 Difference]: Start difference. First operand 424 states and 440 transitions. Second operand 3 states. [2018-10-10 14:42:55,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:55,323 INFO L93 Difference]: Finished difference Result 426 states and 442 transitions. [2018-10-10 14:42:55,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-10 14:42:55,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2018-10-10 14:42:55,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:55,325 INFO L225 Difference]: With dead ends: 426 [2018-10-10 14:42:55,325 INFO L226 Difference]: Without dead ends: 426 [2018-10-10 14:42:55,326 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 14:42:55,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-10-10 14:42:55,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2018-10-10 14:42:55,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2018-10-10 14:42:55,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 442 transitions. [2018-10-10 14:42:55,334 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 442 transitions. Word has length 153 [2018-10-10 14:42:55,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:55,334 INFO L481 AbstractCegarLoop]: Abstraction has 426 states and 442 transitions. [2018-10-10 14:42:55,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-10 14:42:55,334 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 442 transitions. [2018-10-10 14:42:55,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-10 14:42:55,335 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:55,336 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,336 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:55,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:55,337 INFO L82 PathProgramCache]: Analyzing trace with hash -540371677, now seen corresponding path program 1 times [2018-10-10 14:42:55,337 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:55,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:55,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:55,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:55,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:55,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:56,574 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-10 14:42:56,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:56,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-10-10 14:42:56,574 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-10 14:42:56,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-10 14:42:56,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-10-10 14:42:56,575 INFO L87 Difference]: Start difference. First operand 426 states and 442 transitions. Second operand 17 states. [2018-10-10 14:42:57,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:57,588 INFO L93 Difference]: Finished difference Result 463 states and 481 transitions. [2018-10-10 14:42:57,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-10 14:42:57,588 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 157 [2018-10-10 14:42:57,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:57,591 INFO L225 Difference]: With dead ends: 463 [2018-10-10 14:42:57,591 INFO L226 Difference]: Without dead ends: 463 [2018-10-10 14:42:57,592 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=343, Invalid=847, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 14:42:57,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-10-10 14:42:57,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 424. [2018-10-10 14:42:57,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-10-10 14:42:57,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 438 transitions. [2018-10-10 14:42:57,600 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 438 transitions. Word has length 157 [2018-10-10 14:42:57,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:57,600 INFO L481 AbstractCegarLoop]: Abstraction has 424 states and 438 transitions. [2018-10-10 14:42:57,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-10 14:42:57,600 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 438 transitions. [2018-10-10 14:42:57,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-10 14:42:57,601 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:57,601 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-10 14:42:57,602 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:57,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:57,602 INFO L82 PathProgramCache]: Analyzing trace with hash 302894820, now seen corresponding path program 1 times [2018-10-10 14:42:57,603 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:57,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:57,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:57,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:57,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:57,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:57,929 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 14 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:57,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:57,929 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:42:57,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:57,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:57,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:58,140 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-10 14:42:58,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-10 14:42:58,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 14 [2018-10-10 14:42:58,163 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 14:42:58,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 14:42:58,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:42:58,164 INFO L87 Difference]: Start difference. First operand 424 states and 438 transitions. Second operand 14 states. [2018-10-10 14:42:58,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:58,567 INFO L93 Difference]: Finished difference Result 740 states and 762 transitions. [2018-10-10 14:42:58,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-10 14:42:58,567 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 168 [2018-10-10 14:42:58,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:58,571 INFO L225 Difference]: With dead ends: 740 [2018-10-10 14:42:58,571 INFO L226 Difference]: Without dead ends: 740 [2018-10-10 14:42:58,572 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2018-10-10 14:42:58,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2018-10-10 14:42:58,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 615. [2018-10-10 14:42:58,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2018-10-10 14:42:58,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 636 transitions. [2018-10-10 14:42:58,582 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 636 transitions. Word has length 168 [2018-10-10 14:42:58,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:58,582 INFO L481 AbstractCegarLoop]: Abstraction has 615 states and 636 transitions. [2018-10-10 14:42:58,583 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 14:42:58,583 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 636 transitions. [2018-10-10 14:42:58,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-10 14:42:58,584 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:58,584 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:58,585 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:58,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:58,585 INFO L82 PathProgramCache]: Analyzing trace with hash -2128580221, now seen corresponding path program 1 times [2018-10-10 14:42:58,586 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:58,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:58,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:58,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:58,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:58,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:59,118 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 11 proven. 20 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-10 14:42:59,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:59,118 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:42:59,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:59,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:59,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:59,472 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 29 proven. 29 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-10 14:42:59,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:42:59,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 20 [2018-10-10 14:42:59,516 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: cannot bring into simultaneous update form ULTIMATE.start_lis_#t~short11's outvar occurs in several conjuncts [(let ((.cse0 (< |v_ULTIMATE.start_lis_#t~mem8_3| |v_ULTIMATE.start_lis_#t~mem7_3|))) (or (and .cse0 |v_ULTIMATE.start_lis_#t~short11_2|) (and (not |v_ULTIMATE.start_lis_#t~short11_2|) (not .cse0))))] at de.uni_freiburg.informatik.ultimate.modelcheckerutils.cfg.transitions.SimultaneousUpdate.(SimultaneousUpdate.java:107) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumper.addStatementsAndVariables(PathProgramDumper.java:634) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumper.constructTransitionStatements(PathProgramDumper.java:560) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumper.processTransition(PathProgramDumper.java:521) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumper.constructProcedureStatements(PathProgramDumper.java:509) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumper.constructNewImplementation(PathProgramDumper.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumper.(PathProgramDumper.java:194) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumpController.doDump(PathProgramDumpController.java:105) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumpController.reportPathProgram(PathProgramDumpController.java:69) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:435) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-10 14:42:59,526 INFO L168 Benchmark]: Toolchain (without parser) took 67020.30 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.3 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -946.3 MB). Peak memory consumption was 342.4 MB. Max. memory is 7.1 GB. [2018-10-10 14:42:59,527 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:42:59,528 INFO L168 Benchmark]: CACSL2BoogieTranslator took 513.76 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:42:59,528 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.55 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:42:59,528 INFO L168 Benchmark]: Boogie Preprocessor took 39.98 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-10-10 14:42:59,531 INFO L168 Benchmark]: RCFGBuilder took 1492.25 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -764.1 MB). Peak memory consumption was 17.3 MB. Max. memory is 7.1 GB. [2018-10-10 14:42:59,532 INFO L168 Benchmark]: TraceAbstraction took 64885.44 ms. Allocated memory was 2.3 GB in the beginning and 2.8 GB in the end (delta: 550.5 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -213.9 MB). Peak memory consumption was 336.6 MB. Max. memory is 7.1 GB. [2018-10-10 14:42:59,538 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 513.76 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 84.55 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.98 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1492.25 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -764.1 MB). Peak memory consumption was 17.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 64885.44 ms. Allocated memory was 2.3 GB in the beginning and 2.8 GB in the end (delta: 550.5 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -213.9 MB). Peak memory consumption was 336.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalArgumentException: cannot bring into simultaneous update form ULTIMATE.start_lis_#t~short11's outvar occurs in several conjuncts [(let ((.cse0 (< |v_ULTIMATE.start_lis_#t~mem8_3| |v_ULTIMATE.start_lis_#t~mem7_3|))) (or (and .cse0 |v_ULTIMATE.start_lis_#t~short11_2|) (and (not |v_ULTIMATE.start_lis_#t~short11_2|) (not .cse0))))] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: cannot bring into simultaneous update form ULTIMATE.start_lis_#t~short11's outvar occurs in several conjuncts [(let ((.cse0 (< |v_ULTIMATE.start_lis_#t~mem8_3| |v_ULTIMATE.start_lis_#t~mem7_3|))) (or (and .cse0 |v_ULTIMATE.start_lis_#t~short11_2|) (and (not |v_ULTIMATE.start_lis_#t~short11_2|) (not .cse0))))]: de.uni_freiburg.informatik.ultimate.modelcheckerutils.cfg.transitions.SimultaneousUpdate.(SimultaneousUpdate.java:107) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...