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/list-ext-properties/simple-ext_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c5b1954-m [2018-10-10 14:52:18,257 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 14:52:18,259 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 14:52:18,271 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 14:52:18,271 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 14:52:18,272 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 14:52:18,274 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 14:52:18,275 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 14:52:18,277 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 14:52:18,278 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 14:52:18,279 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 14:52:18,279 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 14:52:18,280 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 14:52:18,281 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 14:52:18,282 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 14:52:18,283 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 14:52:18,284 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 14:52:18,286 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 14:52:18,288 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 14:52:18,289 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 14:52:18,290 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 14:52:18,291 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 14:52:18,294 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 14:52:18,294 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 14:52:18,294 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 14:52:18,295 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 14:52:18,296 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 14:52:18,297 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 14:52:18,298 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 14:52:18,299 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 14:52:18,299 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 14:52:18,300 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 14:52:18,300 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 14:52:18,301 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 14:52:18,302 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 14:52:18,302 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 14:52:18,303 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:52:18,325 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 14:52:18,325 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 14:52:18,326 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-10 14:52:18,326 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-10 14:52:18,327 INFO L133 SettingsManager]: * Use SBE=true [2018-10-10 14:52:18,327 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-10 14:52:18,327 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-10 14:52:18,327 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-10 14:52:18,327 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-10 14:52:18,328 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-10 14:52:18,328 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-10 14:52:18,328 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-10 14:52:18,328 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-10 14:52:18,328 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-10 14:52:18,328 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-10 14:52:18,329 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-10 14:52:18,329 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 14:52:18,329 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-10 14:52:18,329 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-10 14:52:18,329 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-10 14:52:18,330 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:52:18,330 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 14:52:18,330 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-10 14:52:18,330 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-10 14:52:18,330 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-10 14:52:18,331 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:52:18,386 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 14:52:18,406 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 14:52:18,409 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 14:52:18,410 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-10 14:52:18,411 INFO L276 PluginConnector]: CDTParser initialized [2018-10-10 14:52:18,411 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/simple-ext_1_true-valid-memsafety.i [2018-10-10 14:52:18,715 INFO L217 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2df36c4ab/72fb6da71df5499eafcee4614445f940/FLAGdd95d4d97 [2018-10-10 14:52:18,966 INFO L289 CDTParser]: Found 1 translation units. [2018-10-10 14:52:18,967 INFO L157 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext-properties/simple-ext_1_true-valid-memsafety.i [2018-10-10 14:52:18,980 INFO L337 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2df36c4ab/72fb6da71df5499eafcee4614445f940/FLAGdd95d4d97 [2018-10-10 14:52:18,997 INFO L345 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2df36c4ab/72fb6da71df5499eafcee4614445f940 [2018-10-10 14:52:19,008 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 14:52:19,010 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-10 14:52:19,011 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-10 14:52:19,012 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-10 14:52:19,017 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-10 14:52:19,018 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:52:18" (1/1) ... [2018-10-10 14:52:19,021 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@793c4c30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:19, skipping insertion in model container [2018-10-10 14:52:19,021 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:52:18" (1/1) ... [2018-10-10 14:52:19,032 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-10 14:52:19,076 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-10 14:52:19,357 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:52:19,367 INFO L189 MainTranslator]: Completed pre-run [2018-10-10 14:52:19,429 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:52:19,495 INFO L193 MainTranslator]: Completed translation [2018-10-10 14:52:19,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:19 WrapperNode [2018-10-10 14:52:19,496 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-10 14:52:19,498 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-10 14:52:19,498 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-10 14:52:19,498 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-10 14:52:19,507 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:52:19" (1/1) ... [2018-10-10 14:52:19,525 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:52:19" (1/1) ... [2018-10-10 14:52:19,558 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-10 14:52:19,558 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 14:52:19,559 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 14:52:19,559 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 14:52:19,568 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:19" (1/1) ... [2018-10-10 14:52:19,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:19" (1/1) ... [2018-10-10 14:52:19,573 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:19" (1/1) ... [2018-10-10 14:52:19,574 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:19" (1/1) ... [2018-10-10 14:52:19,582 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:19" (1/1) ... [2018-10-10 14:52:19,664 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:19" (1/1) ... [2018-10-10 14:52:19,666 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:19" (1/1) ... [2018-10-10 14:52:19,669 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 14:52:19,670 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 14:52:19,670 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 14:52:19,670 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 14:52:19,671 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:19" (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:52:19,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 14:52:19,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 14:52:20,797 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 14:52:20,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:52:20 BoogieIcfgContainer [2018-10-10 14:52:20,798 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 14:52:20,799 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 14:52:20,799 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 14:52:20,802 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 14:52:20,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 02:52:18" (1/3) ... [2018-10-10 14:52:20,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78e36ebb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:52:20, skipping insertion in model container [2018-10-10 14:52:20,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:52:19" (2/3) ... [2018-10-10 14:52:20,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78e36ebb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:52:20, skipping insertion in model container [2018-10-10 14:52:20,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:52:20" (3/3) ... [2018-10-10 14:52:20,806 INFO L112 eAbstractionObserver]: Analyzing ICFG simple-ext_1_true-valid-memsafety.i [2018-10-10 14:52:20,816 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-10 14:52:20,825 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2018-10-10 14:52:20,843 INFO L257 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2018-10-10 14:52:20,871 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 14:52:20,872 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 14:52:20,872 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 14:52:20,872 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-10 14:52:20,872 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 14:52:20,873 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 14:52:20,873 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 14:52:20,873 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 14:52:20,873 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 14:52:20,895 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states. [2018-10-10 14:52:20,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-10 14:52:20,904 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:20,905 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:52:20,907 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:52:20,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:20,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1915038615, now seen corresponding path program 1 times [2018-10-10 14:52:20,915 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:20,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:20,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:20,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:20,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:21,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:21,048 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:52:21,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:52:21,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-10 14:52:21,055 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-10 14:52:21,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-10 14:52:21,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-10 14:52:21,072 INFO L87 Difference]: Start difference. First operand 197 states. Second operand 2 states. [2018-10-10 14:52:21,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:21,098 INFO L93 Difference]: Finished difference Result 197 states and 200 transitions. [2018-10-10 14:52:21,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-10 14:52:21,099 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 30 [2018-10-10 14:52:21,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:21,113 INFO L225 Difference]: With dead ends: 197 [2018-10-10 14:52:21,113 INFO L226 Difference]: Without dead ends: 180 [2018-10-10 14:52:21,115 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:52:21,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-10-10 14:52:21,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2018-10-10 14:52:21,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-10-10 14:52:21,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 183 transitions. [2018-10-10 14:52:21,168 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 183 transitions. Word has length 30 [2018-10-10 14:52:21,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:21,168 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 183 transitions. [2018-10-10 14:52:21,169 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-10 14:52:21,169 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 183 transitions. [2018-10-10 14:52:21,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-10 14:52:21,170 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:21,170 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] [2018-10-10 14:52:21,171 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:52:21,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:21,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1906024245, now seen corresponding path program 1 times [2018-10-10 14:52:21,172 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:21,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:21,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:21,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:21,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:21,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:21,375 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:52:21,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:52:21,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 14:52:21,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-10 14:52:21,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-10 14:52:21,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-10 14:52:21,378 INFO L87 Difference]: Start difference. First operand 180 states and 183 transitions. Second operand 4 states. [2018-10-10 14:52:21,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:21,606 INFO L93 Difference]: Finished difference Result 333 states and 338 transitions. [2018-10-10 14:52:21,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-10 14:52:21,613 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-10-10 14:52:21,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:21,618 INFO L225 Difference]: With dead ends: 333 [2018-10-10 14:52:21,619 INFO L226 Difference]: Without dead ends: 333 [2018-10-10 14:52:21,623 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-10 14:52:21,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-10-10 14:52:21,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 183. [2018-10-10 14:52:21,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-10-10 14:52:21,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 186 transitions. [2018-10-10 14:52:21,656 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 186 transitions. Word has length 35 [2018-10-10 14:52:21,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:21,657 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 186 transitions. [2018-10-10 14:52:21,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-10 14:52:21,657 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 186 transitions. [2018-10-10 14:52:21,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-10 14:52:21,659 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:21,660 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:52:21,660 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:52:21,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:21,661 INFO L82 PathProgramCache]: Analyzing trace with hash -749273416, now seen corresponding path program 1 times [2018-10-10 14:52:21,661 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:21,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:21,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:21,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:21,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:21,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:21,828 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:52:21,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:52:21,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 14:52:21,831 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 14:52:21,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 14:52:21,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:52:21,832 INFO L87 Difference]: Start difference. First operand 183 states and 186 transitions. Second operand 7 states. [2018-10-10 14:52:23,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:23,202 INFO L93 Difference]: Finished difference Result 348 states and 354 transitions. [2018-10-10 14:52:23,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 14:52:23,203 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2018-10-10 14:52:23,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:23,206 INFO L225 Difference]: With dead ends: 348 [2018-10-10 14:52:23,206 INFO L226 Difference]: Without dead ends: 348 [2018-10-10 14:52:23,207 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:52:23,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-10-10 14:52:23,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 262. [2018-10-10 14:52:23,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-10-10 14:52:23,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 278 transitions. [2018-10-10 14:52:23,224 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 278 transitions. Word has length 37 [2018-10-10 14:52:23,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:23,224 INFO L481 AbstractCegarLoop]: Abstraction has 262 states and 278 transitions. [2018-10-10 14:52:23,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 14:52:23,224 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 278 transitions. [2018-10-10 14:52:23,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-10 14:52:23,231 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:23,232 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:52:23,232 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:52:23,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:23,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1752639249, now seen corresponding path program 1 times [2018-10-10 14:52:23,233 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:23,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:23,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:23,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:23,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:23,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:23,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:52:23,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:52:23,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:52:23,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:52:23,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:52:23,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:52:23,446 INFO L87 Difference]: Start difference. First operand 262 states and 278 transitions. Second operand 9 states. [2018-10-10 14:52:24,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:24,284 INFO L93 Difference]: Finished difference Result 351 states and 357 transitions. [2018-10-10 14:52:24,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 14:52:24,291 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2018-10-10 14:52:24,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:24,293 INFO L225 Difference]: With dead ends: 351 [2018-10-10 14:52:24,294 INFO L226 Difference]: Without dead ends: 351 [2018-10-10 14:52:24,295 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-10-10 14:52:24,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-10-10 14:52:24,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 263. [2018-10-10 14:52:24,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-10-10 14:52:24,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 277 transitions. [2018-10-10 14:52:24,322 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 277 transitions. Word has length 38 [2018-10-10 14:52:24,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:24,323 INFO L481 AbstractCegarLoop]: Abstraction has 263 states and 277 transitions. [2018-10-10 14:52:24,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:52:24,323 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 277 transitions. [2018-10-10 14:52:24,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-10 14:52:24,327 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:24,327 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:52:24,328 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:52:24,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:24,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1736222434, now seen corresponding path program 1 times [2018-10-10 14:52:24,328 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:24,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:24,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:24,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:24,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:24,575 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:52:24,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:52:24,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:52:24,576 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:52:24,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:52:24,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:52:24,577 INFO L87 Difference]: Start difference. First operand 263 states and 277 transitions. Second operand 6 states. [2018-10-10 14:52:24,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:24,945 INFO L93 Difference]: Finished difference Result 299 states and 312 transitions. [2018-10-10 14:52:24,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 14:52:24,945 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-10-10 14:52:24,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:24,948 INFO L225 Difference]: With dead ends: 299 [2018-10-10 14:52:24,949 INFO L226 Difference]: Without dead ends: 299 [2018-10-10 14:52:24,950 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:52:24,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-10-10 14:52:24,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 262. [2018-10-10 14:52:24,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-10-10 14:52:24,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 275 transitions. [2018-10-10 14:52:24,957 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 275 transitions. Word has length 47 [2018-10-10 14:52:24,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:24,958 INFO L481 AbstractCegarLoop]: Abstraction has 262 states and 275 transitions. [2018-10-10 14:52:24,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:52:24,958 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 275 transitions. [2018-10-10 14:52:24,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-10 14:52:24,960 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:24,960 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] [2018-10-10 14:52:24,961 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:52:24,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:24,962 INFO L82 PathProgramCache]: Analyzing trace with hash 2011679573, now seen corresponding path program 1 times [2018-10-10 14:52:24,962 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:24,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:24,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:24,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:24,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:24,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:25,147 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:52:25,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:52:25,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:52:25,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:52:25,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:52:25,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:52:25,150 INFO L87 Difference]: Start difference. First operand 262 states and 275 transitions. Second operand 9 states. [2018-10-10 14:52:25,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:25,748 INFO L93 Difference]: Finished difference Result 348 states and 354 transitions. [2018-10-10 14:52:25,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 14:52:25,749 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2018-10-10 14:52:25,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:25,751 INFO L225 Difference]: With dead ends: 348 [2018-10-10 14:52:25,751 INFO L226 Difference]: Without dead ends: 348 [2018-10-10 14:52:25,752 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2018-10-10 14:52:25,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-10-10 14:52:25,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 262. [2018-10-10 14:52:25,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-10-10 14:52:25,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 274 transitions. [2018-10-10 14:52:25,759 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 274 transitions. Word has length 48 [2018-10-10 14:52:25,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:25,759 INFO L481 AbstractCegarLoop]: Abstraction has 262 states and 274 transitions. [2018-10-10 14:52:25,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:52:25,760 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 274 transitions. [2018-10-10 14:52:25,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-10 14:52:25,762 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:25,762 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:52:25,763 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:52:25,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:25,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1899814751, now seen corresponding path program 1 times [2018-10-10 14:52:25,764 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:25,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:25,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:25,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:25,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:25,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:25,887 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:52:25,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:52:25,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:52:25,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:52:25,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:52:25,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:52:25,889 INFO L87 Difference]: Start difference. First operand 262 states and 274 transitions. Second operand 8 states. [2018-10-10 14:52:26,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:26,669 INFO L93 Difference]: Finished difference Result 513 states and 522 transitions. [2018-10-10 14:52:26,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 14:52:26,669 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2018-10-10 14:52:26,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:26,674 INFO L225 Difference]: With dead ends: 513 [2018-10-10 14:52:26,674 INFO L226 Difference]: Without dead ends: 513 [2018-10-10 14:52:26,675 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:52:26,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-10-10 14:52:26,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 267. [2018-10-10 14:52:26,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-10-10 14:52:26,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 280 transitions. [2018-10-10 14:52:26,683 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 280 transitions. Word has length 60 [2018-10-10 14:52:26,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:26,684 INFO L481 AbstractCegarLoop]: Abstraction has 267 states and 280 transitions. [2018-10-10 14:52:26,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:52:26,684 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 280 transitions. [2018-10-10 14:52:26,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-10 14:52:26,686 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:26,686 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:52:26,687 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:52:26,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:26,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1235284661, now seen corresponding path program 1 times [2018-10-10 14:52:26,687 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:26,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:26,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:26,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:26,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:26,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:26,893 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:52:26,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:52:26,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-10 14:52:26,894 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 14:52:26,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 14:52:26,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:52:26,895 INFO L87 Difference]: Start difference. First operand 267 states and 280 transitions. Second operand 11 states. [2018-10-10 14:52:28,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:28,192 INFO L93 Difference]: Finished difference Result 764 states and 777 transitions. [2018-10-10 14:52:28,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-10 14:52:28,196 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 61 [2018-10-10 14:52:28,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:28,199 INFO L225 Difference]: With dead ends: 764 [2018-10-10 14:52:28,200 INFO L226 Difference]: Without dead ends: 764 [2018-10-10 14:52:28,201 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=227, Invalid=529, Unknown=0, NotChecked=0, Total=756 [2018-10-10 14:52:28,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2018-10-10 14:52:28,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 363. [2018-10-10 14:52:28,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-10-10 14:52:28,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 390 transitions. [2018-10-10 14:52:28,212 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 390 transitions. Word has length 61 [2018-10-10 14:52:28,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:28,213 INFO L481 AbstractCegarLoop]: Abstraction has 363 states and 390 transitions. [2018-10-10 14:52:28,213 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 14:52:28,213 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 390 transitions. [2018-10-10 14:52:28,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-10 14:52:28,214 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:28,214 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:52:28,215 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:52:28,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:28,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1967949268, now seen corresponding path program 1 times [2018-10-10 14:52:28,216 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:28,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:28,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:28,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:28,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:28,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:28,463 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:52:28,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:52:28,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:52:28,463 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:52:28,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:52:28,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:52:28,464 INFO L87 Difference]: Start difference. First operand 363 states and 390 transitions. Second operand 9 states. [2018-10-10 14:52:29,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:29,843 INFO L93 Difference]: Finished difference Result 412 states and 425 transitions. [2018-10-10 14:52:29,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-10 14:52:29,844 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2018-10-10 14:52:29,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:29,846 INFO L225 Difference]: With dead ends: 412 [2018-10-10 14:52:29,846 INFO L226 Difference]: Without dead ends: 412 [2018-10-10 14:52:29,846 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2018-10-10 14:52:29,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2018-10-10 14:52:29,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 363. [2018-10-10 14:52:29,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-10-10 14:52:29,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 389 transitions. [2018-10-10 14:52:29,852 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 389 transitions. Word has length 61 [2018-10-10 14:52:29,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:29,853 INFO L481 AbstractCegarLoop]: Abstraction has 363 states and 389 transitions. [2018-10-10 14:52:29,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:52:29,853 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 389 transitions. [2018-10-10 14:52:29,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-10 14:52:29,854 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:29,854 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:52:29,855 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:52:29,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:29,855 INFO L82 PathProgramCache]: Analyzing trace with hash 343799152, now seen corresponding path program 1 times [2018-10-10 14:52:29,855 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:29,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:29,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:29,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:29,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:29,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:29,983 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:52:29,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:52:29,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 14:52:29,984 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:52:29,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:52:29,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:52:29,985 INFO L87 Difference]: Start difference. First operand 363 states and 389 transitions. Second operand 6 states. [2018-10-10 14:52:30,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:30,116 INFO L93 Difference]: Finished difference Result 424 states and 444 transitions. [2018-10-10 14:52:30,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:52:30,116 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-10-10 14:52:30,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:30,118 INFO L225 Difference]: With dead ends: 424 [2018-10-10 14:52:30,119 INFO L226 Difference]: Without dead ends: 424 [2018-10-10 14:52:30,119 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:52:30,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2018-10-10 14:52:30,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 365. [2018-10-10 14:52:30,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-10-10 14:52:30,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 387 transitions. [2018-10-10 14:52:30,127 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 387 transitions. Word has length 62 [2018-10-10 14:52:30,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:30,127 INFO L481 AbstractCegarLoop]: Abstraction has 365 states and 387 transitions. [2018-10-10 14:52:30,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:52:30,127 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 387 transitions. [2018-10-10 14:52:30,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-10 14:52:30,128 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:30,128 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:52:30,129 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:52:30,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:30,129 INFO L82 PathProgramCache]: Analyzing trace with hash 876885299, now seen corresponding path program 1 times [2018-10-10 14:52:30,129 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:30,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:30,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:30,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:30,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:30,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:30,453 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:52:30,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:52:30,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-10 14:52:30,454 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 14:52:30,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 14:52:30,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:52:30,455 INFO L87 Difference]: Start difference. First operand 365 states and 387 transitions. Second operand 13 states. [2018-10-10 14:52:31,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:31,870 INFO L93 Difference]: Finished difference Result 460 states and 469 transitions. [2018-10-10 14:52:31,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-10 14:52:31,875 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 62 [2018-10-10 14:52:31,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:31,877 INFO L225 Difference]: With dead ends: 460 [2018-10-10 14:52:31,877 INFO L226 Difference]: Without dead ends: 460 [2018-10-10 14:52:31,878 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=203, Invalid=667, Unknown=0, NotChecked=0, Total=870 [2018-10-10 14:52:31,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-10-10 14:52:31,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 365. [2018-10-10 14:52:31,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-10-10 14:52:31,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 386 transitions. [2018-10-10 14:52:31,886 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 386 transitions. Word has length 62 [2018-10-10 14:52:31,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:31,886 INFO L481 AbstractCegarLoop]: Abstraction has 365 states and 386 transitions. [2018-10-10 14:52:31,886 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 14:52:31,886 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 386 transitions. [2018-10-10 14:52:31,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-10 14:52:31,887 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:31,887 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:52:31,888 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:52:31,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:31,888 INFO L82 PathProgramCache]: Analyzing trace with hash -686019016, now seen corresponding path program 1 times [2018-10-10 14:52:31,888 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:31,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:31,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:31,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:31,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:31,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:32,127 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:52:32,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:52:32,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 14:52:32,128 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 14:52:32,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 14:52:32,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-10 14:52:32,128 INFO L87 Difference]: Start difference. First operand 365 states and 386 transitions. Second operand 5 states. [2018-10-10 14:52:32,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:32,635 INFO L93 Difference]: Finished difference Result 374 states and 394 transitions. [2018-10-10 14:52:32,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 14:52:32,636 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-10-10 14:52:32,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:32,638 INFO L225 Difference]: With dead ends: 374 [2018-10-10 14:52:32,638 INFO L226 Difference]: Without dead ends: 374 [2018-10-10 14:52:32,638 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:52:32,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-10-10 14:52:32,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 364. [2018-10-10 14:52:32,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-10-10 14:52:32,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 384 transitions. [2018-10-10 14:52:32,645 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 384 transitions. Word has length 70 [2018-10-10 14:52:32,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:32,645 INFO L481 AbstractCegarLoop]: Abstraction has 364 states and 384 transitions. [2018-10-10 14:52:32,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 14:52:32,645 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 384 transitions. [2018-10-10 14:52:32,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-10 14:52:32,646 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:32,646 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:52:32,647 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:52:32,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:32,647 INFO L82 PathProgramCache]: Analyzing trace with hash 208247130, now seen corresponding path program 1 times [2018-10-10 14:52:32,647 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:32,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:32,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:32,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:32,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:32,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:32,789 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:52:32,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:52:32,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-10 14:52:32,790 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 14:52:32,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 14:52:32,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-10-10 14:52:32,791 INFO L87 Difference]: Start difference. First operand 364 states and 384 transitions. Second operand 10 states. [2018-10-10 14:52:33,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:33,267 INFO L93 Difference]: Finished difference Result 445 states and 460 transitions. [2018-10-10 14:52:33,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-10 14:52:33,267 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 71 [2018-10-10 14:52:33,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:33,269 INFO L225 Difference]: With dead ends: 445 [2018-10-10 14:52:33,269 INFO L226 Difference]: Without dead ends: 445 [2018-10-10 14:52:33,270 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-10-10 14:52:33,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-10-10 14:52:33,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 364. [2018-10-10 14:52:33,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-10-10 14:52:33,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 383 transitions. [2018-10-10 14:52:33,275 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 383 transitions. Word has length 71 [2018-10-10 14:52:33,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:33,276 INFO L481 AbstractCegarLoop]: Abstraction has 364 states and 383 transitions. [2018-10-10 14:52:33,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 14:52:33,276 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 383 transitions. [2018-10-10 14:52:33,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-10 14:52:33,277 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:33,277 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:52:33,278 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:52:33,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:33,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1911873166, now seen corresponding path program 1 times [2018-10-10 14:52:33,278 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:33,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:33,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:33,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:33,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:33,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:33,429 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:52:33,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:52:33,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 14:52:33,430 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 14:52:33,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 14:52:33,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:52:33,431 INFO L87 Difference]: Start difference. First operand 364 states and 383 transitions. Second operand 7 states. [2018-10-10 14:52:33,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:33,870 INFO L93 Difference]: Finished difference Result 401 states and 412 transitions. [2018-10-10 14:52:33,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 14:52:33,870 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2018-10-10 14:52:33,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:33,872 INFO L225 Difference]: With dead ends: 401 [2018-10-10 14:52:33,873 INFO L226 Difference]: Without dead ends: 401 [2018-10-10 14:52:33,873 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:52:33,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-10-10 14:52:33,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 375. [2018-10-10 14:52:33,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-10-10 14:52:33,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 393 transitions. [2018-10-10 14:52:33,879 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 393 transitions. Word has length 72 [2018-10-10 14:52:33,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:33,879 INFO L481 AbstractCegarLoop]: Abstraction has 375 states and 393 transitions. [2018-10-10 14:52:33,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 14:52:33,880 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 393 transitions. [2018-10-10 14:52:33,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-10 14:52:33,880 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:33,881 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:52:33,881 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:52:33,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:33,882 INFO L82 PathProgramCache]: Analyzing trace with hash -861473774, now seen corresponding path program 1 times [2018-10-10 14:52:33,882 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:33,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:33,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:33,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:33,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:33,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:34,604 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:52:34,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:52:34,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-10 14:52:34,605 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 14:52:34,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 14:52:34,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:52:34,606 INFO L87 Difference]: Start difference. First operand 375 states and 393 transitions. Second operand 11 states. [2018-10-10 14:52:35,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:52:35,246 INFO L93 Difference]: Finished difference Result 458 states and 472 transitions. [2018-10-10 14:52:35,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 14:52:35,246 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 73 [2018-10-10 14:52:35,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:52:35,249 INFO L225 Difference]: With dead ends: 458 [2018-10-10 14:52:35,249 INFO L226 Difference]: Without dead ends: 458 [2018-10-10 14:52:35,250 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2018-10-10 14:52:35,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-10-10 14:52:35,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 376. [2018-10-10 14:52:35,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-10-10 14:52:35,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 393 transitions. [2018-10-10 14:52:35,257 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 393 transitions. Word has length 73 [2018-10-10 14:52:35,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:52:35,258 INFO L481 AbstractCegarLoop]: Abstraction has 376 states and 393 transitions. [2018-10-10 14:52:35,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 14:52:35,258 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 393 transitions. [2018-10-10 14:52:35,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-10 14:52:35,258 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:52:35,259 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:52:35,259 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:52:35,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:52:35,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1822980691, now seen corresponding path program 1 times [2018-10-10 14:52:35,260 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:52:35,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:52:35,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:35,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:35,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:52:35,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:35,878 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:52:35,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:52:35,879 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:52:35,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:52:35,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:52:35,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:52:36,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-10 14:52:36,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-10 14:52:36,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:52:36,367 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:52:36,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-10 14:52:36,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-10 14:52:36,388 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 14:52:36,390 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:52:36,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:52:36,402 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:24 [2018-10-10 14:52:36,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-10 14:52:36,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-10 14:52:36,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:52:36,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:52:36,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-10 14:52:36,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-10 14:52:36,611 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 14:52:36,612 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:52:36,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:52:36,617 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-10-10 14:52:36,682 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:52:36,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:52:36,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 15 [2018-10-10 14:52:36,740 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~short2's outvar occurs in several conjuncts [(let ((.cse0 (< v_ULTIMATE.start_main_~i~0_3 30))) (or (and (not .cse0) (not |v_ULTIMATE.start_main_#t~short2_2|)) (and |v_ULTIMATE.start_main_#t~short2_2| .cse0)))] at de.uni_freiburg.informatik.ultimate.modelcheckerutils.cfg.transitions.SimultaneousUpdate.(SimultaneousUpdate.java:107) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumper.addStatementsAndVariables(PathProgramDumper.java:634) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumper.constructTransitionStatements(PathProgramDumper.java:560) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumper.processTransition(PathProgramDumper.java:521) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumper.constructProcedureStatements(PathProgramDumper.java: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:52:36,744 INFO L168 Benchmark]: Toolchain (without parser) took 17735.66 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 866.1 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -154.3 MB). Peak memory consumption was 711.9 MB. Max. memory is 7.1 GB. [2018-10-10 14:52:36,747 INFO L168 Benchmark]: CDTParser took 0.16 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:52:36,748 INFO L168 Benchmark]: CACSL2BoogieTranslator took 485.74 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:52:36,748 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.43 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:52:36,750 INFO L168 Benchmark]: Boogie Preprocessor took 111.11 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 729.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -809.4 MB). Peak memory consumption was 16.9 MB. Max. memory is 7.1 GB. [2018-10-10 14:52:36,751 INFO L168 Benchmark]: RCFGBuilder took 1128.02 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: 54.8 MB). Peak memory consumption was 54.8 MB. Max. memory is 7.1 GB. [2018-10-10 14:52:36,751 INFO L168 Benchmark]: TraceAbstraction took 15944.68 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 136.8 MB). Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 579.2 MB). Peak memory consumption was 716.0 MB. Max. memory is 7.1 GB. [2018-10-10 14:52:36,761 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.16 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 485.74 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 60.43 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 111.11 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 729.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -809.4 MB). Peak memory consumption was 16.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1128.02 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: 54.8 MB). Peak memory consumption was 54.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15944.68 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 136.8 MB). Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 579.2 MB). Peak memory consumption was 716.0 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~short2's outvar occurs in several conjuncts [(let ((.cse0 (< v_ULTIMATE.start_main_~i~0_3 30))) (or (and (not .cse0) (not |v_ULTIMATE.start_main_#t~short2_2|)) (and |v_ULTIMATE.start_main_#t~short2_2| .cse0)))] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: cannot bring into simultaneous update form ULTIMATE.start_main_#t~short2's outvar occurs in several conjuncts [(let ((.cse0 (< v_ULTIMATE.start_main_~i~0_3 30))) (or (and (not .cse0) (not |v_ULTIMATE.start_main_#t~short2_2|)) (and |v_ULTIMATE.start_main_#t~short2_2| .cse0)))]: de.uni_freiburg.informatik.ultimate.modelcheckerutils.cfg.transitions.SimultaneousUpdate.(SimultaneousUpdate.java:107) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...