java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --traceabstraction.dump.automata.to.the.following.directory dump --rcfgbuilder.size.of.a.code.block SingleStatement --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/memsafety/lockfree-3.3_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c5b1954-m [2018-10-10 14:43:16,736 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 14:43:16,738 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 14:43:16,750 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 14:43:16,751 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 14:43:16,752 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 14:43:16,753 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 14:43:16,755 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 14:43:16,757 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 14:43:16,758 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 14:43:16,758 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 14:43:16,759 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 14:43:16,760 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 14:43:16,761 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 14:43:16,762 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 14:43:16,763 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 14:43:16,763 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 14:43:16,765 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 14:43:16,767 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 14:43:16,769 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 14:43:16,770 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 14:43:16,772 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 14:43:16,774 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 14:43:16,775 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 14:43:16,775 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 14:43:16,776 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 14:43:16,777 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 14:43:16,778 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 14:43:16,779 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 14:43:16,780 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 14:43:16,780 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 14:43:16,781 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 14:43:16,781 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 14:43:16,782 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 14:43:16,783 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 14:43:16,784 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 14:43:16,784 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-10-10 14:43:16,800 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 14:43:16,801 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 14:43:16,802 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-10 14:43:16,802 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-10 14:43:16,802 INFO L133 SettingsManager]: * Use SBE=true [2018-10-10 14:43:16,803 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-10 14:43:16,803 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-10 14:43:16,803 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-10 14:43:16,803 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-10 14:43:16,803 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-10 14:43:16,804 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-10 14:43:16,804 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-10 14:43:16,804 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-10 14:43:16,804 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-10 14:43:16,804 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-10 14:43:16,805 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-10 14:43:16,805 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 14:43:16,805 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-10 14:43:16,805 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-10 14:43:16,806 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-10 14:43:16,806 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:43:16,806 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 14:43:16,806 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-10 14:43:16,806 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-10 14:43:16,807 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-10 14:43:16,807 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Dump automata to the following directory -> dump Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> SingleStatement Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-10-10 14:43:16,866 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 14:43:16,886 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 14:43:16,890 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 14:43:16,892 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-10 14:43:16,892 INFO L276 PluginConnector]: CDTParser initialized [2018-10-10 14:43:16,893 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/lockfree-3.3_false-valid-memtrack.i [2018-10-10 14:43:17,218 INFO L217 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e3254277/57485da4d564473da74ae694f3447d55/FLAG9e3dbf600 [2018-10-10 14:43:17,488 INFO L289 CDTParser]: Found 1 translation units. [2018-10-10 14:43:17,489 INFO L157 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety/lockfree-3.3_false-valid-memtrack.i [2018-10-10 14:43:17,516 INFO L337 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e3254277/57485da4d564473da74ae694f3447d55/FLAG9e3dbf600 [2018-10-10 14:43:17,532 INFO L345 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e3254277/57485da4d564473da74ae694f3447d55 [2018-10-10 14:43:17,542 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 14:43:17,543 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-10 14:43:17,544 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-10 14:43:17,544 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-10 14:43:17,548 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-10 14:43:17,549 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:43:17" (1/1) ... [2018-10-10 14:43:17,552 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cd44ca5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:17, skipping insertion in model container [2018-10-10 14:43:17,552 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:43:17" (1/1) ... [2018-10-10 14:43:17,562 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-10 14:43:17,613 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-10 14:43:17,849 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:43:17,865 INFO L189 MainTranslator]: Completed pre-run [2018-10-10 14:43:17,948 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:43:18,023 INFO L193 MainTranslator]: Completed translation [2018-10-10 14:43:18,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:18 WrapperNode [2018-10-10 14:43:18,024 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-10 14:43:18,025 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-10 14:43:18,025 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-10 14:43:18,025 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-10 14:43:18,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:18" (1/1) ... [2018-10-10 14:43:18,062 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:18" (1/1) ... [2018-10-10 14:43:18,104 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-10 14:43:18,105 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 14:43:18,105 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 14:43:18,105 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 14:43:18,113 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:18" (1/1) ... [2018-10-10 14:43:18,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:18" (1/1) ... [2018-10-10 14:43:18,119 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:18" (1/1) ... [2018-10-10 14:43:18,119 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:18" (1/1) ... [2018-10-10 14:43:18,209 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:18" (1/1) ... [2018-10-10 14:43:18,220 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:18" (1/1) ... [2018-10-10 14:43:18,222 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:18" (1/1) ... [2018-10-10 14:43:18,227 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 14:43:18,231 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 14:43:18,231 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 14:43:18,231 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 14:43:18,232 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:43:18,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 14:43:18,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 14:43:19,409 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 14:43:19,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:43:19 BoogieIcfgContainer [2018-10-10 14:43:19,411 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 14:43:19,411 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 14:43:19,412 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 14:43:19,415 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 14:43:19,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 02:43:17" (1/3) ... [2018-10-10 14:43:19,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53e2a14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:43:19, skipping insertion in model container [2018-10-10 14:43:19,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:18" (2/3) ... [2018-10-10 14:43:19,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53e2a14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:43:19, skipping insertion in model container [2018-10-10 14:43:19,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:43:19" (3/3) ... [2018-10-10 14:43:19,419 INFO L112 eAbstractionObserver]: Analyzing ICFG lockfree-3.3_false-valid-memtrack.i [2018-10-10 14:43:19,429 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-10 14:43:19,437 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-10-10 14:43:19,455 INFO L257 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2018-10-10 14:43:19,480 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 14:43:19,481 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 14:43:19,481 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 14:43:19,481 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-10 14:43:19,481 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 14:43:19,482 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 14:43:19,482 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 14:43:19,482 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 14:43:19,482 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 14:43:19,504 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states. [2018-10-10 14:43:19,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-10 14:43:19,512 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:19,513 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] [2018-10-10 14:43:19,516 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:19,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:19,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1128459374, now seen corresponding path program 1 times [2018-10-10 14:43:19,524 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:19,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:19,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:19,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:19,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:19,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:19,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:19,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:19,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-10 14:43:19,674 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-10 14:43:19,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-10 14:43:19,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-10 14:43:19,691 INFO L87 Difference]: Start difference. First operand 221 states. Second operand 2 states. [2018-10-10 14:43:19,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:19,723 INFO L93 Difference]: Finished difference Result 221 states and 238 transitions. [2018-10-10 14:43:19,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-10 14:43:19,725 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2018-10-10 14:43:19,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:19,741 INFO L225 Difference]: With dead ends: 221 [2018-10-10 14:43:19,742 INFO L226 Difference]: Without dead ends: 216 [2018-10-10 14:43:19,743 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-10 14:43:19,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-10-10 14:43:19,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2018-10-10 14:43:19,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-10-10 14:43:19,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 233 transitions. [2018-10-10 14:43:19,814 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 233 transitions. Word has length 23 [2018-10-10 14:43:19,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:19,815 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 233 transitions. [2018-10-10 14:43:19,815 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-10 14:43:19,815 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 233 transitions. [2018-10-10 14:43:19,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-10 14:43:19,816 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:19,816 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] [2018-10-10 14:43:19,817 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:19,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:19,818 INFO L82 PathProgramCache]: Analyzing trace with hash 67342139, now seen corresponding path program 1 times [2018-10-10 14:43:19,818 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:19,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:19,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:19,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:19,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:19,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:19,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:19,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:19,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-10 14:43:19,917 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-10 14:43:19,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-10 14:43:19,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 14:43:19,918 INFO L87 Difference]: Start difference. First operand 216 states and 233 transitions. Second operand 3 states. [2018-10-10 14:43:20,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:20,089 INFO L93 Difference]: Finished difference Result 217 states and 234 transitions. [2018-10-10 14:43:20,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-10 14:43:20,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-10-10 14:43:20,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:20,101 INFO L225 Difference]: With dead ends: 217 [2018-10-10 14:43:20,101 INFO L226 Difference]: Without dead ends: 217 [2018-10-10 14:43:20,103 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:43:20,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-10-10 14:43:20,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-10-10 14:43:20,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-10-10 14:43:20,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 234 transitions. [2018-10-10 14:43:20,131 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 234 transitions. Word has length 28 [2018-10-10 14:43:20,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:20,131 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 234 transitions. [2018-10-10 14:43:20,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-10 14:43:20,131 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 234 transitions. [2018-10-10 14:43:20,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-10 14:43:20,133 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:20,133 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] [2018-10-10 14:43:20,134 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:20,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:20,134 INFO L82 PathProgramCache]: Analyzing trace with hash 76387166, now seen corresponding path program 1 times [2018-10-10 14:43:20,134 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:20,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:20,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:20,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:20,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:20,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:20,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:20,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-10 14:43:20,222 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-10 14:43:20,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-10 14:43:20,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 14:43:20,223 INFO L87 Difference]: Start difference. First operand 217 states and 234 transitions. Second operand 3 states. [2018-10-10 14:43:20,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:20,295 INFO L93 Difference]: Finished difference Result 383 states and 417 transitions. [2018-10-10 14:43:20,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-10 14:43:20,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-10 14:43:20,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:20,301 INFO L225 Difference]: With dead ends: 383 [2018-10-10 14:43:20,301 INFO L226 Difference]: Without dead ends: 383 [2018-10-10 14:43:20,302 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:43:20,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-10-10 14:43:20,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 346. [2018-10-10 14:43:20,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-10-10 14:43:20,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 390 transitions. [2018-10-10 14:43:20,337 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 390 transitions. Word has length 30 [2018-10-10 14:43:20,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:20,338 INFO L481 AbstractCegarLoop]: Abstraction has 346 states and 390 transitions. [2018-10-10 14:43:20,338 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-10 14:43:20,338 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 390 transitions. [2018-10-10 14:43:20,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-10 14:43:20,340 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:20,340 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] [2018-10-10 14:43:20,341 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:20,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:20,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1040636351, now seen corresponding path program 1 times [2018-10-10 14:43:20,342 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:20,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:20,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:20,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:20,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:20,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:20,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:20,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:20,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-10 14:43:20,426 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-10 14:43:20,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-10 14:43:20,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 14:43:20,427 INFO L87 Difference]: Start difference. First operand 346 states and 390 transitions. Second operand 3 states. [2018-10-10 14:43:20,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:20,736 INFO L93 Difference]: Finished difference Result 611 states and 695 transitions. [2018-10-10 14:43:20,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-10 14:43:20,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-10 14:43:20,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:20,741 INFO L225 Difference]: With dead ends: 611 [2018-10-10 14:43:20,741 INFO L226 Difference]: Without dead ends: 600 [2018-10-10 14:43:20,742 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:43:20,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2018-10-10 14:43:20,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 557. [2018-10-10 14:43:20,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2018-10-10 14:43:20,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 650 transitions. [2018-10-10 14:43:20,769 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 650 transitions. Word has length 34 [2018-10-10 14:43:20,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:20,770 INFO L481 AbstractCegarLoop]: Abstraction has 557 states and 650 transitions. [2018-10-10 14:43:20,770 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-10 14:43:20,770 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 650 transitions. [2018-10-10 14:43:20,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-10 14:43:20,772 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:20,772 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:43:20,773 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:20,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:20,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1809141084, now seen corresponding path program 1 times [2018-10-10 14:43:20,775 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:20,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:20,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:20,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:20,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:20,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:21,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:21,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:21,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:43:21,022 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 14:43:21,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 14:43:21,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-10 14:43:21,023 INFO L87 Difference]: Start difference. First operand 557 states and 650 transitions. Second operand 5 states. [2018-10-10 14:43:21,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:21,331 INFO L93 Difference]: Finished difference Result 1031 states and 1193 transitions. [2018-10-10 14:43:21,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 14:43:21,332 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-10-10 14:43:21,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:21,337 INFO L225 Difference]: With dead ends: 1031 [2018-10-10 14:43:21,338 INFO L226 Difference]: Without dead ends: 1031 [2018-10-10 14:43:21,338 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:43:21,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2018-10-10 14:43:21,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 671. [2018-10-10 14:43:21,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2018-10-10 14:43:21,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 789 transitions. [2018-10-10 14:43:21,358 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 789 transitions. Word has length 38 [2018-10-10 14:43:21,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:21,359 INFO L481 AbstractCegarLoop]: Abstraction has 671 states and 789 transitions. [2018-10-10 14:43:21,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 14:43:21,359 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 789 transitions. [2018-10-10 14:43:21,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-10 14:43:21,364 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:21,364 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] [2018-10-10 14:43:21,365 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:21,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:21,365 INFO L82 PathProgramCache]: Analyzing trace with hash -565958905, now seen corresponding path program 1 times [2018-10-10 14:43:21,366 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:21,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:21,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:21,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:21,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:21,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:21,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:21,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:21,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:43:21,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 14:43:21,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 14:43:21,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:43:21,623 INFO L87 Difference]: Start difference. First operand 671 states and 789 transitions. Second operand 7 states. [2018-10-10 14:43:22,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:22,114 INFO L93 Difference]: Finished difference Result 1276 states and 1473 transitions. [2018-10-10 14:43:22,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 14:43:22,115 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2018-10-10 14:43:22,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:22,121 INFO L225 Difference]: With dead ends: 1276 [2018-10-10 14:43:22,122 INFO L226 Difference]: Without dead ends: 1276 [2018-10-10 14:43:22,122 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:43:22,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2018-10-10 14:43:22,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 978. [2018-10-10 14:43:22,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 978 states. [2018-10-10 14:43:22,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1155 transitions. [2018-10-10 14:43:22,146 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1155 transitions. Word has length 40 [2018-10-10 14:43:22,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:22,146 INFO L481 AbstractCegarLoop]: Abstraction has 978 states and 1155 transitions. [2018-10-10 14:43:22,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 14:43:22,147 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1155 transitions. [2018-10-10 14:43:22,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-10 14:43:22,148 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:22,148 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] [2018-10-10 14:43:22,149 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:22,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:22,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1190606965, now seen corresponding path program 1 times [2018-10-10 14:43:22,149 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:22,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:22,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:22,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:22,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:22,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:22,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:22,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:22,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 14:43:22,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:43:22,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:43:22,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:43:22,258 INFO L87 Difference]: Start difference. First operand 978 states and 1155 transitions. Second operand 6 states. [2018-10-10 14:43:22,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:22,619 INFO L93 Difference]: Finished difference Result 2152 states and 2485 transitions. [2018-10-10 14:43:22,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 14:43:22,620 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-10-10 14:43:22,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:22,630 INFO L225 Difference]: With dead ends: 2152 [2018-10-10 14:43:22,631 INFO L226 Difference]: Without dead ends: 2152 [2018-10-10 14:43:22,631 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:43:22,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2152 states. [2018-10-10 14:43:22,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2152 to 1562. [2018-10-10 14:43:22,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1562 states. [2018-10-10 14:43:22,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 1830 transitions. [2018-10-10 14:43:22,672 INFO L78 Accepts]: Start accepts. Automaton has 1562 states and 1830 transitions. Word has length 41 [2018-10-10 14:43:22,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:22,673 INFO L481 AbstractCegarLoop]: Abstraction has 1562 states and 1830 transitions. [2018-10-10 14:43:22,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:43:22,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 1830 transitions. [2018-10-10 14:43:22,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-10 14:43:22,675 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:22,675 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] [2018-10-10 14:43:22,676 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:22,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:22,676 INFO L82 PathProgramCache]: Analyzing trace with hash 2047573667, now seen corresponding path program 1 times [2018-10-10 14:43:22,676 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:22,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:22,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:22,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:22,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:22,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:22,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:22,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:43:22,803 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:43:22,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:43:22,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:43:22,803 INFO L87 Difference]: Start difference. First operand 1562 states and 1830 transitions. Second operand 6 states. [2018-10-10 14:43:24,018 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-10 14:43:25,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:25,522 INFO L93 Difference]: Finished difference Result 2472 states and 2854 transitions. [2018-10-10 14:43:25,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 14:43:25,524 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2018-10-10 14:43:25,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:25,536 INFO L225 Difference]: With dead ends: 2472 [2018-10-10 14:43:25,536 INFO L226 Difference]: Without dead ends: 2472 [2018-10-10 14:43:25,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:43:25,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2472 states. [2018-10-10 14:43:25,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2472 to 1561. [2018-10-10 14:43:25,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2018-10-10 14:43:25,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 1822 transitions. [2018-10-10 14:43:25,577 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 1822 transitions. Word has length 51 [2018-10-10 14:43:25,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:25,578 INFO L481 AbstractCegarLoop]: Abstraction has 1561 states and 1822 transitions. [2018-10-10 14:43:25,578 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:43:25,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 1822 transitions. [2018-10-10 14:43:25,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-10 14:43:25,579 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:25,579 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] [2018-10-10 14:43:25,580 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:25,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:25,580 INFO L82 PathProgramCache]: Analyzing trace with hash -949725660, now seen corresponding path program 1 times [2018-10-10 14:43:25,580 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:25,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:25,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:25,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:25,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:25,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:26,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:26,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:26,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:43:26,132 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:43:26,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:43:26,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:43:26,133 INFO L87 Difference]: Start difference. First operand 1561 states and 1822 transitions. Second operand 8 states. [2018-10-10 14:43:26,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:26,650 INFO L93 Difference]: Finished difference Result 1858 states and 2134 transitions. [2018-10-10 14:43:26,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 14:43:26,650 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2018-10-10 14:43:26,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:26,659 INFO L225 Difference]: With dead ends: 1858 [2018-10-10 14:43:26,660 INFO L226 Difference]: Without dead ends: 1858 [2018-10-10 14:43:26,660 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2018-10-10 14:43:26,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1858 states. [2018-10-10 14:43:26,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1858 to 1560. [2018-10-10 14:43:26,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2018-10-10 14:43:26,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 1814 transitions. [2018-10-10 14:43:26,690 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 1814 transitions. Word has length 52 [2018-10-10 14:43:26,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:26,691 INFO L481 AbstractCegarLoop]: Abstraction has 1560 states and 1814 transitions. [2018-10-10 14:43:26,691 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:43:26,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 1814 transitions. [2018-10-10 14:43:26,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-10 14:43:26,692 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:26,692 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] [2018-10-10 14:43:26,693 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:26,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:26,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1847690560, now seen corresponding path program 1 times [2018-10-10 14:43:26,694 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:26,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:26,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:26,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:26,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:26,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:26,829 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:26,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:43:26,830 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) [2018-10-10 14:43:26,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:43:26,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:26,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:43:26,963 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:26,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:43:26,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-10 14:43:27,023 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_main_#t~short8's outvar occurs in several conjuncts [(let ((.cse1 (= v_~S~0.base_2 0)) (.cse2 (= v_~S~0.offset_2 0)) (.cse0 (= v_~pc1~0_2 1))) (or (and .cse0 (not |v_ULTIMATE.start_main_#t~short8_2|) .cse1 .cse2) (and (or (not .cse1) (not .cse2) (not .cse0)) |v_ULTIMATE.start_main_#t~short8_2|)))] 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:489) 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:43:27,030 INFO L168 Benchmark]: Toolchain (without parser) took 9488.15 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.7 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -379.2 MB). Peak memory consumption was 370.5 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:27,032 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:43:27,032 INFO L168 Benchmark]: CACSL2BoogieTranslator took 480.27 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:27,033 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.59 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:43:27,034 INFO L168 Benchmark]: Boogie Preprocessor took 125.88 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -830.3 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:27,036 INFO L168 Benchmark]: RCFGBuilder took 1179.61 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 67.3 MB). Peak memory consumption was 67.3 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:27,037 INFO L168 Benchmark]: TraceAbstraction took 7618.08 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 362.6 MB). Peak memory consumption was 362.6 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:27,047 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.20 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 480.27 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 79.59 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 125.88 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -830.3 MB). Peak memory consumption was 27.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1179.61 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 67.3 MB). Peak memory consumption was 67.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7618.08 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 362.6 MB). Peak memory consumption was 362.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_main_#t~short8's outvar occurs in several conjuncts [(let ((.cse1 (= v_~S~0.base_2 0)) (.cse2 (= v_~S~0.offset_2 0)) (.cse0 (= v_~pc1~0_2 1))) (or (and .cse0 (not |v_ULTIMATE.start_main_#t~short8_2|) .cse1 .cse2) (and (or (not .cse1) (not .cse2) (not .cse0)) |v_ULTIMATE.start_main_#t~short8_2|)))] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: cannot bring into simultaneous update form ULTIMATE.start_main_#t~short8's outvar occurs in several conjuncts [(let ((.cse1 (= v_~S~0.base_2 0)) (.cse2 (= v_~S~0.offset_2 0)) (.cse0 (= v_~pc1~0_2 1))) (or (and .cse0 (not |v_ULTIMATE.start_main_#t~short8_2|) .cse1 .cse2) (and (or (not .cse1) (not .cse2) (not .cse0)) |v_ULTIMATE.start_main_#t~short8_2|)))]: 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...