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.1_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c5b1954-m [2018-10-10 14:43:15,351 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 14:43:15,353 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 14:43:15,369 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 14:43:15,371 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 14:43:15,372 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 14:43:15,373 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 14:43:15,375 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 14:43:15,378 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 14:43:15,380 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 14:43:15,381 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 14:43:15,382 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 14:43:15,383 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 14:43:15,385 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 14:43:15,393 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 14:43:15,395 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 14:43:15,396 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 14:43:15,398 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 14:43:15,401 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 14:43:15,402 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 14:43:15,403 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 14:43:15,409 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 14:43:15,412 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 14:43:15,415 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 14:43:15,415 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 14:43:15,416 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 14:43:15,417 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 14:43:15,418 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 14:43:15,418 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 14:43:15,421 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 14:43:15,421 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 14:43:15,423 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 14:43:15,423 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 14:43:15,423 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 14:43:15,426 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 14:43:15,426 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 14:43:15,428 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:15,442 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 14:43:15,442 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 14:43:15,443 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-10 14:43:15,444 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-10 14:43:15,444 INFO L133 SettingsManager]: * Use SBE=true [2018-10-10 14:43:15,444 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-10 14:43:15,444 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-10 14:43:15,444 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-10 14:43:15,445 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-10 14:43:15,445 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-10 14:43:15,445 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-10 14:43:15,445 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-10 14:43:15,445 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-10 14:43:15,445 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-10 14:43:15,446 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-10 14:43:15,446 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-10 14:43:15,446 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 14:43:15,446 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-10 14:43:15,446 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-10 14:43:15,447 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-10 14:43:15,447 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:43:15,447 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 14:43:15,447 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-10 14:43:15,447 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-10 14:43:15,447 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-10 14:43:15,448 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:15,509 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 14:43:15,533 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 14:43:15,537 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 14:43:15,540 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-10 14:43:15,540 INFO L276 PluginConnector]: CDTParser initialized [2018-10-10 14:43:15,541 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/lockfree-3.1_false-valid-memtrack.i [2018-10-10 14:43:15,902 INFO L217 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c663a569d/1c0e88ef84d747ee8ee568e281d3d456/FLAG0bb0760c5 [2018-10-10 14:43:16,106 INFO L289 CDTParser]: Found 1 translation units. [2018-10-10 14:43:16,107 INFO L157 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety/lockfree-3.1_false-valid-memtrack.i [2018-10-10 14:43:16,122 INFO L337 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c663a569d/1c0e88ef84d747ee8ee568e281d3d456/FLAG0bb0760c5 [2018-10-10 14:43:16,135 INFO L345 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c663a569d/1c0e88ef84d747ee8ee568e281d3d456 [2018-10-10 14:43:16,145 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 14:43:16,146 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-10 14:43:16,147 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-10 14:43:16,147 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-10 14:43:16,151 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-10 14:43:16,152 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:43:16" (1/1) ... [2018-10-10 14:43:16,155 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2462ff4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:16, skipping insertion in model container [2018-10-10 14:43:16,156 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:43:16" (1/1) ... [2018-10-10 14:43:16,165 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-10 14:43:16,227 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-10 14:43:16,564 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:43:16,575 INFO L189 MainTranslator]: Completed pre-run [2018-10-10 14:43:16,659 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:43:16,730 INFO L193 MainTranslator]: Completed translation [2018-10-10 14:43:16,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:16 WrapperNode [2018-10-10 14:43:16,731 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-10 14:43:16,731 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-10 14:43:16,732 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-10 14:43:16,732 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-10 14:43:16,743 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:16" (1/1) ... [2018-10-10 14:43:16,764 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:16" (1/1) ... [2018-10-10 14:43:16,804 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-10 14:43:16,804 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 14:43:16,804 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 14:43:16,805 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 14:43:16,818 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:16" (1/1) ... [2018-10-10 14:43:16,819 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:16" (1/1) ... [2018-10-10 14:43:16,834 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:16" (1/1) ... [2018-10-10 14:43:16,834 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:16" (1/1) ... [2018-10-10 14:43:16,851 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:16" (1/1) ... [2018-10-10 14:43:16,864 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:16" (1/1) ... [2018-10-10 14:43:16,972 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:16" (1/1) ... [2018-10-10 14:43:16,978 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 14:43:16,979 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 14:43:16,979 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 14:43:16,979 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 14:43:16,981 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:16" (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:17,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 14:43:17,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 14:43:18,309 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 14:43:18,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:43:18 BoogieIcfgContainer [2018-10-10 14:43:18,310 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 14:43:18,311 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 14:43:18,311 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 14:43:18,315 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 14:43:18,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 02:43:16" (1/3) ... [2018-10-10 14:43:18,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46bb14e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:43:18, skipping insertion in model container [2018-10-10 14:43:18,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:16" (2/3) ... [2018-10-10 14:43:18,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46bb14e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:43:18, skipping insertion in model container [2018-10-10 14:43:18,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:43:18" (3/3) ... [2018-10-10 14:43:18,319 INFO L112 eAbstractionObserver]: Analyzing ICFG lockfree-3.1_false-valid-memtrack.i [2018-10-10 14:43:18,329 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-10 14:43:18,338 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-10-10 14:43:18,356 INFO L257 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2018-10-10 14:43:18,385 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 14:43:18,386 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 14:43:18,386 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 14:43:18,386 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-10 14:43:18,386 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 14:43:18,387 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 14:43:18,387 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 14:43:18,387 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 14:43:18,387 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 14:43:18,411 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states. [2018-10-10 14:43:18,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-10 14:43:18,420 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:18,422 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:18,427 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2018-10-10 14:43:18,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:18,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1128459374, now seen corresponding path program 1 times [2018-10-10 14:43:18,436 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:18,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:18,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:18,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:18,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:18,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:18,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:18,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:18,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-10 14:43:18,576 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-10 14:43:18,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-10 14:43:18,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-10 14:43:18,596 INFO L87 Difference]: Start difference. First operand 221 states. Second operand 2 states. [2018-10-10 14:43:18,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:18,626 INFO L93 Difference]: Finished difference Result 221 states and 238 transitions. [2018-10-10 14:43:18,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-10 14:43:18,628 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2018-10-10 14:43:18,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:18,644 INFO L225 Difference]: With dead ends: 221 [2018-10-10 14:43:18,644 INFO L226 Difference]: Without dead ends: 216 [2018-10-10 14:43:18,646 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:18,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-10-10 14:43:18,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2018-10-10 14:43:18,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-10-10 14:43:18,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 233 transitions. [2018-10-10 14:43:18,700 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 233 transitions. Word has length 23 [2018-10-10 14:43:18,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:18,701 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 233 transitions. [2018-10-10 14:43:18,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-10 14:43:18,701 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 233 transitions. [2018-10-10 14:43:18,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-10 14:43:18,703 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:18,703 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:18,704 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2018-10-10 14:43:18,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:18,704 INFO L82 PathProgramCache]: Analyzing trace with hash 67342139, now seen corresponding path program 1 times [2018-10-10 14:43:18,704 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:18,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:18,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:18,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:18,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:18,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:18,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:18,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:18,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-10 14:43:18,790 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-10 14:43:18,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-10 14:43:18,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 14:43:18,791 INFO L87 Difference]: Start difference. First operand 216 states and 233 transitions. Second operand 3 states. [2018-10-10 14:43:18,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:18,900 INFO L93 Difference]: Finished difference Result 217 states and 234 transitions. [2018-10-10 14:43:18,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-10 14:43:18,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-10-10 14:43:18,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:18,906 INFO L225 Difference]: With dead ends: 217 [2018-10-10 14:43:18,906 INFO L226 Difference]: Without dead ends: 217 [2018-10-10 14:43:18,907 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:18,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-10-10 14:43:18,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-10-10 14:43:18,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-10-10 14:43:18,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 234 transitions. [2018-10-10 14:43:18,937 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 234 transitions. Word has length 28 [2018-10-10 14:43:18,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:18,938 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 234 transitions. [2018-10-10 14:43:18,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-10 14:43:18,938 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 234 transitions. [2018-10-10 14:43:18,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-10 14:43:18,939 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:18,939 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:18,943 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2018-10-10 14:43:18,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:18,944 INFO L82 PathProgramCache]: Analyzing trace with hash 76387166, now seen corresponding path program 1 times [2018-10-10 14:43:18,944 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:18,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:18,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:18,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:18,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:19,057 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,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:19,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-10 14:43:19,058 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-10 14:43:19,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-10 14:43:19,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 14:43:19,059 INFO L87 Difference]: Start difference. First operand 217 states and 234 transitions. Second operand 3 states. [2018-10-10 14:43:19,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:19,122 INFO L93 Difference]: Finished difference Result 383 states and 417 transitions. [2018-10-10 14:43:19,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-10 14:43:19,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-10 14:43:19,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:19,128 INFO L225 Difference]: With dead ends: 383 [2018-10-10 14:43:19,129 INFO L226 Difference]: Without dead ends: 383 [2018-10-10 14:43:19,129 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:19,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-10-10 14:43:19,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 346. [2018-10-10 14:43:19,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-10-10 14:43:19,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 390 transitions. [2018-10-10 14:43:19,157 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 390 transitions. Word has length 30 [2018-10-10 14:43:19,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:19,158 INFO L481 AbstractCegarLoop]: Abstraction has 346 states and 390 transitions. [2018-10-10 14:43:19,158 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-10 14:43:19,158 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 390 transitions. [2018-10-10 14:43:19,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-10 14:43:19,163 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:19,163 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:19,167 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2018-10-10 14:43:19,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:19,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1040636351, now seen corresponding path program 1 times [2018-10-10 14:43:19,168 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:19,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:19,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:19,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:19,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:19,274 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,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:19,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-10 14:43:19,275 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-10 14:43:19,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-10 14:43:19,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 14:43:19,276 INFO L87 Difference]: Start difference. First operand 346 states and 390 transitions. Second operand 3 states. [2018-10-10 14:43:19,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:19,472 INFO L93 Difference]: Finished difference Result 611 states and 695 transitions. [2018-10-10 14:43:19,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-10 14:43:19,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-10-10 14:43:19,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:19,477 INFO L225 Difference]: With dead ends: 611 [2018-10-10 14:43:19,477 INFO L226 Difference]: Without dead ends: 600 [2018-10-10 14:43:19,477 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:19,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2018-10-10 14:43:19,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 557. [2018-10-10 14:43:19,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2018-10-10 14:43:19,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 650 transitions. [2018-10-10 14:43:19,501 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 650 transitions. Word has length 34 [2018-10-10 14:43:19,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:19,501 INFO L481 AbstractCegarLoop]: Abstraction has 557 states and 650 transitions. [2018-10-10 14:43:19,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-10 14:43:19,502 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 650 transitions. [2018-10-10 14:43:19,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-10 14:43:19,503 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:19,503 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:19,504 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2018-10-10 14:43:19,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:19,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1809141084, now seen corresponding path program 1 times [2018-10-10 14:43:19,505 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:19,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:19,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:19,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:19,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:19,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:19,581 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,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:19,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:43:19,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 14:43:19,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 14:43:19,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-10 14:43:19,583 INFO L87 Difference]: Start difference. First operand 557 states and 650 transitions. Second operand 5 states. [2018-10-10 14:43:19,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:19,965 INFO L93 Difference]: Finished difference Result 996 states and 1145 transitions. [2018-10-10 14:43:19,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 14:43:19,967 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-10-10 14:43:19,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:19,973 INFO L225 Difference]: With dead ends: 996 [2018-10-10 14:43:19,973 INFO L226 Difference]: Without dead ends: 996 [2018-10-10 14:43:19,974 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:43:19,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2018-10-10 14:43:20,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 812. [2018-10-10 14:43:20,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 812 states. [2018-10-10 14:43:20,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 960 transitions. [2018-10-10 14:43:20,005 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 960 transitions. Word has length 38 [2018-10-10 14:43:20,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:20,007 INFO L481 AbstractCegarLoop]: Abstraction has 812 states and 960 transitions. [2018-10-10 14:43:20,008 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 14:43:20,008 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 960 transitions. [2018-10-10 14:43:20,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-10 14:43:20,010 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:20,010 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:20,011 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2018-10-10 14:43:20,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:20,011 INFO L82 PathProgramCache]: Analyzing trace with hash -565958905, now seen corresponding path program 1 times [2018-10-10 14:43:20,014 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:20,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:20,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:20,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:20,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:20,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:20,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:20,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:20,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:43:20,175 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 14:43:20,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 14:43:20,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:43:20,176 INFO L87 Difference]: Start difference. First operand 812 states and 960 transitions. Second operand 7 states. [2018-10-10 14:43:20,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:20,822 INFO L93 Difference]: Finished difference Result 1182 states and 1354 transitions. [2018-10-10 14:43:20,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 14:43:20,823 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2018-10-10 14:43:20,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:20,829 INFO L225 Difference]: With dead ends: 1182 [2018-10-10 14:43:20,830 INFO L226 Difference]: Without dead ends: 1182 [2018-10-10 14:43:20,830 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:43:20,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2018-10-10 14:43:20,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 880. [2018-10-10 14:43:20,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2018-10-10 14:43:20,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1032 transitions. [2018-10-10 14:43:20,856 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1032 transitions. Word has length 40 [2018-10-10 14:43:20,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:20,856 INFO L481 AbstractCegarLoop]: Abstraction has 880 states and 1032 transitions. [2018-10-10 14:43:20,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 14:43:20,857 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1032 transitions. [2018-10-10 14:43:20,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-10 14:43:20,858 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:20,859 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:20,864 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2018-10-10 14:43:20,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:20,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1190606965, now seen corresponding path program 1 times [2018-10-10 14:43:20,864 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:20,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:20,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:20,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:20,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:20,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:21,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:21,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:21,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:43:21,329 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 14:43:21,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 14:43:21,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:43:21,330 INFO L87 Difference]: Start difference. First operand 880 states and 1032 transitions. Second operand 7 states. [2018-10-10 14:43:21,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:21,719 INFO L93 Difference]: Finished difference Result 1966 states and 2266 transitions. [2018-10-10 14:43:21,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 14:43:21,719 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-10-10 14:43:21,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:21,729 INFO L225 Difference]: With dead ends: 1966 [2018-10-10 14:43:21,729 INFO L226 Difference]: Without dead ends: 1966 [2018-10-10 14:43:21,730 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:43:21,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1966 states. [2018-10-10 14:43:21,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1966 to 1408. [2018-10-10 14:43:21,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1408 states. [2018-10-10 14:43:21,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1408 states to 1408 states and 1646 transitions. [2018-10-10 14:43:21,768 INFO L78 Accepts]: Start accepts. Automaton has 1408 states and 1646 transitions. Word has length 41 [2018-10-10 14:43:21,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:21,768 INFO L481 AbstractCegarLoop]: Abstraction has 1408 states and 1646 transitions. [2018-10-10 14:43:21,769 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 14:43:21,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1408 states and 1646 transitions. [2018-10-10 14:43:21,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-10 14:43:21,771 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:21,771 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:21,771 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2018-10-10 14:43:21,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:21,772 INFO L82 PathProgramCache]: Analyzing trace with hash 2047573667, now seen corresponding path program 1 times [2018-10-10 14:43:21,772 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:21,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:21,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:21,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:21,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:21,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:22,176 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,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:22,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:43:22,177 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:43:22,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:43:22,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:43:22,178 INFO L87 Difference]: Start difference. First operand 1408 states and 1646 transitions. Second operand 6 states. [2018-10-10 14:43:23,108 WARN L178 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-10 14:43:24,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:24,336 INFO L93 Difference]: Finished difference Result 2324 states and 2676 transitions. [2018-10-10 14:43:24,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 14:43:24,336 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2018-10-10 14:43:24,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:24,347 INFO L225 Difference]: With dead ends: 2324 [2018-10-10 14:43:24,347 INFO L226 Difference]: Without dead ends: 2324 [2018-10-10 14:43:24,348 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:43:24,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2324 states. [2018-10-10 14:43:24,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2324 to 1407. [2018-10-10 14:43:24,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1407 states. [2018-10-10 14:43:24,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407 states to 1407 states and 1638 transitions. [2018-10-10 14:43:24,383 INFO L78 Accepts]: Start accepts. Automaton has 1407 states and 1638 transitions. Word has length 51 [2018-10-10 14:43:24,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:24,383 INFO L481 AbstractCegarLoop]: Abstraction has 1407 states and 1638 transitions. [2018-10-10 14:43:24,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:43:24,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1407 states and 1638 transitions. [2018-10-10 14:43:24,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-10 14:43:24,385 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:24,385 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:24,386 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2018-10-10 14:43:24,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:24,386 INFO L82 PathProgramCache]: Analyzing trace with hash -949725660, now seen corresponding path program 1 times [2018-10-10 14:43:24,386 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:24,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:24,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:24,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:24,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:24,746 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:24,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:24,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:43:24,747 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:43:24,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:43:24,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:43:24,748 INFO L87 Difference]: Start difference. First operand 1407 states and 1638 transitions. Second operand 8 states. [2018-10-10 14:43:25,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:25,290 INFO L93 Difference]: Finished difference Result 1704 states and 1950 transitions. [2018-10-10 14:43:25,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 14:43:25,291 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2018-10-10 14:43:25,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:25,299 INFO L225 Difference]: With dead ends: 1704 [2018-10-10 14:43:25,299 INFO L226 Difference]: Without dead ends: 1704 [2018-10-10 14:43:25,300 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2018-10-10 14:43:25,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1704 states. [2018-10-10 14:43:25,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1704 to 1406. [2018-10-10 14:43:25,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1406 states. [2018-10-10 14:43:25,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1406 states and 1630 transitions. [2018-10-10 14:43:25,329 INFO L78 Accepts]: Start accepts. Automaton has 1406 states and 1630 transitions. Word has length 52 [2018-10-10 14:43:25,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:25,330 INFO L481 AbstractCegarLoop]: Abstraction has 1406 states and 1630 transitions. [2018-10-10 14:43:25,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:43:25,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 1630 transitions. [2018-10-10 14:43:25,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-10 14:43:25,331 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:25,332 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-10 14:43:25,332 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE]=== [2018-10-10 14:43:25,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:25,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1740692477, now seen corresponding path program 1 times [2018-10-10 14:43:25,333 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:25,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:25,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:25,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:25,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:25,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:25,511 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:25,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:43:25,512 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:43:25,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:25,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:25,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:43:25,695 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:25,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:43:25,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-10 14:43:25,784 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 ((.cse0 (= v_~pc1~0_2 1)) (.cse1 (= v_~pc4~0_2 1))) (or (and (or (not .cse0) (not .cse1)) |v_ULTIMATE.start_main_#t~short8_2|) (and .cse0 (not |v_ULTIMATE.start_main_#t~short8_2|) .cse1)))] 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:25,792 INFO L168 Benchmark]: Toolchain (without parser) took 9646.67 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 697.3 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -314.3 MB). Peak memory consumption was 383.0 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:25,794 INFO L168 Benchmark]: CDTParser took 0.21 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:25,794 INFO L168 Benchmark]: CACSL2BoogieTranslator took 583.75 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:25,795 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.57 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:25,796 INFO L168 Benchmark]: Boogie Preprocessor took 174.14 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 697.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -778.6 MB). Peak memory consumption was 27.8 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:25,802 INFO L168 Benchmark]: RCFGBuilder took 1331.63 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 57.4 MB). Peak memory consumption was 57.4 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:25,803 INFO L168 Benchmark]: TraceAbstraction took 7480.18 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 385.7 MB). Peak memory consumption was 385.7 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:25,813 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.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 583.75 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 72.57 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 174.14 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 697.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -778.6 MB). Peak memory consumption was 27.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1331.63 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 57.4 MB). Peak memory consumption was 57.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7480.18 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 385.7 MB). Peak memory consumption was 385.7 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 ((.cse0 (= v_~pc1~0_2 1)) (.cse1 (= v_~pc4~0_2 1))) (or (and (or (not .cse0) (not .cse1)) |v_ULTIMATE.start_main_#t~short8_2|) (and .cse0 (not |v_ULTIMATE.start_main_#t~short8_2|) .cse1)))] 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 ((.cse0 (= v_~pc1~0_2 1)) (.cse1 (= v_~pc4~0_2 1))) (or (and (or (not .cse0) (not .cse1)) |v_ULTIMATE.start_main_#t~short8_2|) (and .cse0 (not |v_ULTIMATE.start_main_#t~short8_2|) .cse1)))]: 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...