java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --traceabstraction.dump.automata.to.the.following.directory dump --rcfgbuilder.size.of.a.code.block SingleStatement --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c5b1954-m [2018-10-10 14:41:46,614 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 14:41:46,616 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 14:41:46,633 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 14:41:46,633 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 14:41:46,634 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 14:41:46,635 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 14:41:46,637 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 14:41:46,639 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 14:41:46,640 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 14:41:46,641 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 14:41:46,641 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 14:41:46,642 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 14:41:46,645 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 14:41:46,646 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 14:41:46,649 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 14:41:46,650 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 14:41:46,658 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 14:41:46,660 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 14:41:46,665 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 14:41:46,667 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 14:41:46,669 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 14:41:46,672 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 14:41:46,672 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 14:41:46,672 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 14:41:46,673 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 14:41:46,675 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 14:41:46,676 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 14:41:46,676 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 14:41:46,680 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 14:41:46,680 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 14:41:46,681 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 14:41:46,681 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 14:41:46,681 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 14:41:46,683 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 14:41:46,684 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 14:41:46,684 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-10-10 14:41:46,713 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 14:41:46,713 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 14:41:46,715 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-10 14:41:46,715 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-10 14:41:46,715 INFO L133 SettingsManager]: * Use SBE=true [2018-10-10 14:41:46,717 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-10 14:41:46,717 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-10 14:41:46,717 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-10 14:41:46,717 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-10 14:41:46,717 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-10 14:41:46,718 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-10 14:41:46,718 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-10 14:41:46,718 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-10 14:41:46,718 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-10 14:41:46,718 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-10 14:41:46,719 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-10 14:41:46,720 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 14:41:46,720 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-10 14:41:46,720 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-10 14:41:46,721 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-10 14:41:46,721 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:41:46,721 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 14:41:46,722 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-10 14:41:46,722 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-10 14:41:46,722 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-10 14:41:46,722 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Dump automata to the following directory -> dump Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> SingleStatement Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-10-10 14:41:46,795 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 14:41:46,814 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 14:41:46,818 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 14:41:46,820 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-10 14:41:46,820 INFO L276 PluginConnector]: CDTParser initialized [2018-10-10 14:41:46,821 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:41:47,130 INFO L217 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a715ddef8/e2cebd38cabf42e795bea6a666a0bb47/FLAGda7981398 [2018-10-10 14:41:47,399 INFO L289 CDTParser]: Found 1 translation units. [2018-10-10 14:41:47,399 INFO L157 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-memsafety/cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:41:47,414 INFO L337 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a715ddef8/e2cebd38cabf42e795bea6a666a0bb47/FLAGda7981398 [2018-10-10 14:41:47,433 INFO L345 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a715ddef8/e2cebd38cabf42e795bea6a666a0bb47 [2018-10-10 14:41:47,443 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 14:41:47,444 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-10 14:41:47,445 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-10 14:41:47,445 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-10 14:41:47,449 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-10 14:41:47,451 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:41:47" (1/1) ... [2018-10-10 14:41:47,454 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b409d50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:47, skipping insertion in model container [2018-10-10 14:41:47,454 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:41:47" (1/1) ... [2018-10-10 14:41:47,465 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-10 14:41:47,509 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-10 14:41:47,776 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:41:47,787 INFO L189 MainTranslator]: Completed pre-run [2018-10-10 14:41:47,849 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:41:47,918 INFO L193 MainTranslator]: Completed translation [2018-10-10 14:41:47,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:47 WrapperNode [2018-10-10 14:41:47,919 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-10 14:41:47,920 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-10 14:41:47,920 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-10 14:41:47,920 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-10 14:41:47,931 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:47" (1/1) ... [2018-10-10 14:41:47,955 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:47" (1/1) ... [2018-10-10 14:41:47,992 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-10 14:41:47,992 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 14:41:47,992 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 14:41:47,993 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 14:41:48,001 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:47" (1/1) ... [2018-10-10 14:41:48,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:47" (1/1) ... [2018-10-10 14:41:48,007 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:47" (1/1) ... [2018-10-10 14:41:48,007 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:47" (1/1) ... [2018-10-10 14:41:48,016 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:47" (1/1) ... [2018-10-10 14:41:48,099 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:47" (1/1) ... [2018-10-10 14:41:48,105 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:47" (1/1) ... [2018-10-10 14:41:48,113 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 14:41:48,114 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 14:41:48,114 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 14:41:48,114 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 14:41:48,115 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:41:48,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 14:41:48,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 14:41:49,138 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 14:41:49,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:41:49 BoogieIcfgContainer [2018-10-10 14:41:49,139 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 14:41:49,140 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 14:41:49,140 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 14:41:49,143 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 14:41:49,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 02:41:47" (1/3) ... [2018-10-10 14:41:49,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1810c9a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:41:49, skipping insertion in model container [2018-10-10 14:41:49,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:47" (2/3) ... [2018-10-10 14:41:49,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1810c9a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:41:49, skipping insertion in model container [2018-10-10 14:41:49,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:41:49" (3/3) ... [2018-10-10 14:41:49,147 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrspn-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:41:49,157 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-10 14:41:49,166 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-10-10 14:41:49,181 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2018-10-10 14:41:49,207 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 14:41:49,208 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 14:41:49,208 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 14:41:49,208 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-10 14:41:49,208 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 14:41:49,209 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 14:41:49,209 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 14:41:49,209 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 14:41:49,209 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 14:41:49,232 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states. [2018-10-10 14:41:49,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-10 14:41:49,242 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:49,243 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:41:49,245 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:41:49,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:49,252 INFO L82 PathProgramCache]: Analyzing trace with hash 989039711, now seen corresponding path program 1 times [2018-10-10 14:41:49,254 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:49,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:49,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:49,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:49,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:49,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:49,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:49,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:49,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:41:49,746 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:41:49,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:41:49,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:41:49,766 INFO L87 Difference]: Start difference. First operand 193 states. Second operand 8 states. [2018-10-10 14:41:50,379 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-10 14:41:50,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:50,657 INFO L93 Difference]: Finished difference Result 192 states and 197 transitions. [2018-10-10 14:41:50,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:41:50,660 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-10-10 14:41:50,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:50,674 INFO L225 Difference]: With dead ends: 192 [2018-10-10 14:41:50,674 INFO L226 Difference]: Without dead ends: 187 [2018-10-10 14:41:50,676 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:41:50,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-10-10 14:41:50,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-10-10 14:41:50,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-10-10 14:41:50,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 192 transitions. [2018-10-10 14:41:50,732 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 192 transitions. Word has length 46 [2018-10-10 14:41:50,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:50,733 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 192 transitions. [2018-10-10 14:41:50,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:41:50,733 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 192 transitions. [2018-10-10 14:41:50,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-10 14:41:50,736 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:50,736 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:41:50,737 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:41:50,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:50,738 INFO L82 PathProgramCache]: Analyzing trace with hash 595460060, now seen corresponding path program 1 times [2018-10-10 14:41:50,738 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:50,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:50,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:50,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:50,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:51,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:51,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:51,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-10 14:41:51,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 14:41:51,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 14:41:51,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:41:51,363 INFO L87 Difference]: Start difference. First operand 187 states and 192 transitions. Second operand 13 states. [2018-10-10 14:41:52,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:52,521 INFO L93 Difference]: Finished difference Result 186 states and 191 transitions. [2018-10-10 14:41:52,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 14:41:52,523 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2018-10-10 14:41:52,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:52,526 INFO L225 Difference]: With dead ends: 186 [2018-10-10 14:41:52,526 INFO L226 Difference]: Without dead ends: 186 [2018-10-10 14:41:52,528 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2018-10-10 14:41:52,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-10-10 14:41:52,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2018-10-10 14:41:52,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-10-10 14:41:52,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 191 transitions. [2018-10-10 14:41:52,542 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 191 transitions. Word has length 47 [2018-10-10 14:41:52,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:52,543 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 191 transitions. [2018-10-10 14:41:52,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 14:41:52,543 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 191 transitions. [2018-10-10 14:41:52,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-10 14:41:52,545 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:52,545 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:41:52,546 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:41:52,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:52,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1452289403, now seen corresponding path program 1 times [2018-10-10 14:41:52,547 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:52,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:52,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:52,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:52,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:52,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:52,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:52,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:52,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:41:52,671 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:41:52,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:41:52,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:41:52,672 INFO L87 Difference]: Start difference. First operand 186 states and 191 transitions. Second operand 6 states. [2018-10-10 14:41:52,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:52,892 INFO L93 Difference]: Finished difference Result 185 states and 190 transitions. [2018-10-10 14:41:52,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 14:41:52,894 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-10-10 14:41:52,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:52,896 INFO L225 Difference]: With dead ends: 185 [2018-10-10 14:41:52,896 INFO L226 Difference]: Without dead ends: 185 [2018-10-10 14:41:52,897 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:41:52,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-10-10 14:41:52,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-10-10 14:41:52,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-10-10 14:41:52,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 190 transitions. [2018-10-10 14:41:52,909 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 190 transitions. Word has length 56 [2018-10-10 14:41:52,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:52,909 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 190 transitions. [2018-10-10 14:41:52,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:41:52,912 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 190 transitions. [2018-10-10 14:41:52,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-10 14:41:52,914 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:52,914 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:41:52,915 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:41:52,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:52,915 INFO L82 PathProgramCache]: Analyzing trace with hash -2071298430, now seen corresponding path program 1 times [2018-10-10 14:41:52,916 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:52,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:52,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:52,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:52,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:52,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:53,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:53,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:53,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:41:53,122 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:41:53,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:41:53,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:41:53,124 INFO L87 Difference]: Start difference. First operand 185 states and 190 transitions. Second operand 9 states. [2018-10-10 14:41:53,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:53,730 INFO L93 Difference]: Finished difference Result 184 states and 189 transitions. [2018-10-10 14:41:53,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:41:53,730 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2018-10-10 14:41:53,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:53,732 INFO L225 Difference]: With dead ends: 184 [2018-10-10 14:41:53,732 INFO L226 Difference]: Without dead ends: 184 [2018-10-10 14:41:53,732 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:41:53,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-10-10 14:41:53,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-10-10 14:41:53,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-10-10 14:41:53,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 189 transitions. [2018-10-10 14:41:53,742 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 189 transitions. Word has length 57 [2018-10-10 14:41:53,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:53,743 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 189 transitions. [2018-10-10 14:41:53,743 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:41:53,743 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 189 transitions. [2018-10-10 14:41:53,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-10 14:41:53,745 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:53,746 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:41:53,746 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:41:53,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:53,747 INFO L82 PathProgramCache]: Analyzing trace with hash 73507728, now seen corresponding path program 1 times [2018-10-10 14:41:53,747 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:53,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:53,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:53,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:53,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:53,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:53,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:53,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:53,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:41:53,904 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:41:53,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:41:53,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:41:53,905 INFO L87 Difference]: Start difference. First operand 184 states and 189 transitions. Second operand 9 states. [2018-10-10 14:41:54,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:54,614 INFO L93 Difference]: Finished difference Result 279 states and 288 transitions. [2018-10-10 14:41:54,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:41:54,615 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 76 [2018-10-10 14:41:54,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:54,618 INFO L225 Difference]: With dead ends: 279 [2018-10-10 14:41:54,619 INFO L226 Difference]: Without dead ends: 279 [2018-10-10 14:41:54,619 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:41:54,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-10-10 14:41:54,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 201. [2018-10-10 14:41:54,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-10-10 14:41:54,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 208 transitions. [2018-10-10 14:41:54,630 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 208 transitions. Word has length 76 [2018-10-10 14:41:54,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:54,631 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 208 transitions. [2018-10-10 14:41:54,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:41:54,631 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 208 transitions. [2018-10-10 14:41:54,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-10 14:41:54,633 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:54,633 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:41:54,634 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:41:54,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:54,634 INFO L82 PathProgramCache]: Analyzing trace with hash -2016227600, now seen corresponding path program 1 times [2018-10-10 14:41:54,634 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:54,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:54,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:54,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:54,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:54,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:54,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:54,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:54,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-10 14:41:54,905 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 14:41:54,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 14:41:54,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:41:54,906 INFO L87 Difference]: Start difference. First operand 201 states and 208 transitions. Second operand 12 states. [2018-10-10 14:41:55,343 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-10-10 14:41:55,522 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-10-10 14:41:55,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:55,725 INFO L93 Difference]: Finished difference Result 313 states and 320 transitions. [2018-10-10 14:41:55,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 14:41:55,726 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 77 [2018-10-10 14:41:55,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:55,729 INFO L225 Difference]: With dead ends: 313 [2018-10-10 14:41:55,729 INFO L226 Difference]: Without dead ends: 313 [2018-10-10 14:41:55,731 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2018-10-10 14:41:55,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-10-10 14:41:55,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 202. [2018-10-10 14:41:55,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-10-10 14:41:55,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 208 transitions. [2018-10-10 14:41:55,739 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 208 transitions. Word has length 77 [2018-10-10 14:41:55,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:55,740 INFO L481 AbstractCegarLoop]: Abstraction has 202 states and 208 transitions. [2018-10-10 14:41:55,740 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 14:41:55,740 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 208 transitions. [2018-10-10 14:41:55,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-10 14:41:55,742 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:55,742 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:41:55,743 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:41:55,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:55,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1717893829, now seen corresponding path program 1 times [2018-10-10 14:41:55,743 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:55,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:55,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:55,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:55,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:55,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:55,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:55,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:55,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:41:55,904 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:41:55,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:41:55,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:41:55,905 INFO L87 Difference]: Start difference. First operand 202 states and 208 transitions. Second operand 9 states. [2018-10-10 14:41:56,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:56,347 INFO L93 Difference]: Finished difference Result 282 states and 292 transitions. [2018-10-10 14:41:56,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:41:56,352 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2018-10-10 14:41:56,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:56,354 INFO L225 Difference]: With dead ends: 282 [2018-10-10 14:41:56,354 INFO L226 Difference]: Without dead ends: 282 [2018-10-10 14:41:56,354 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2018-10-10 14:41:56,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-10-10 14:41:56,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 233. [2018-10-10 14:41:56,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-10-10 14:41:56,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 243 transitions. [2018-10-10 14:41:56,362 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 243 transitions. Word has length 102 [2018-10-10 14:41:56,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:56,363 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 243 transitions. [2018-10-10 14:41:56,363 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:41:56,363 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 243 transitions. [2018-10-10 14:41:56,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-10 14:41:56,365 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:56,365 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:41:56,366 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:41:56,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:56,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1715101314, now seen corresponding path program 1 times [2018-10-10 14:41:56,367 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:56,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:56,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:56,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:56,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:56,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:56,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:56,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:56,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-10 14:41:56,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 14:41:56,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 14:41:56,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:41:56,731 INFO L87 Difference]: Start difference. First operand 233 states and 243 transitions. Second operand 12 states. [2018-10-10 14:41:57,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:57,677 INFO L93 Difference]: Finished difference Result 316 states and 324 transitions. [2018-10-10 14:41:57,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 14:41:57,677 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 103 [2018-10-10 14:41:57,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:57,679 INFO L225 Difference]: With dead ends: 316 [2018-10-10 14:41:57,679 INFO L226 Difference]: Without dead ends: 316 [2018-10-10 14:41:57,680 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=198, Invalid=402, Unknown=0, NotChecked=0, Total=600 [2018-10-10 14:41:57,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-10-10 14:41:57,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 234. [2018-10-10 14:41:57,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-10-10 14:41:57,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 242 transitions. [2018-10-10 14:41:57,686 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 242 transitions. Word has length 103 [2018-10-10 14:41:57,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:57,686 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 242 transitions. [2018-10-10 14:41:57,686 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 14:41:57,686 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 242 transitions. [2018-10-10 14:41:57,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-10 14:41:57,688 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:57,688 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:41:57,689 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:41:57,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:57,690 INFO L82 PathProgramCache]: Analyzing trace with hash -295031098, now seen corresponding path program 1 times [2018-10-10 14:41:57,690 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:57,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:57,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:57,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:57,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:57,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:58,387 WARN L178 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-10-10 14:41:58,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:58,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:58,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-10-10 14:41:58,787 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 14:41:58,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 14:41:58,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-10-10 14:41:58,788 INFO L87 Difference]: Start difference. First operand 234 states and 242 transitions. Second operand 16 states. [2018-10-10 14:41:59,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:59,947 INFO L93 Difference]: Finished difference Result 233 states and 241 transitions. [2018-10-10 14:41:59,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 14:41:59,949 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 106 [2018-10-10 14:41:59,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:59,951 INFO L225 Difference]: With dead ends: 233 [2018-10-10 14:41:59,951 INFO L226 Difference]: Without dead ends: 209 [2018-10-10 14:41:59,952 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=148, Invalid=974, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 14:41:59,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-10-10 14:41:59,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-10-10 14:41:59,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-10-10 14:41:59,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 215 transitions. [2018-10-10 14:41:59,956 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 215 transitions. Word has length 106 [2018-10-10 14:41:59,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:59,957 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 215 transitions. [2018-10-10 14:41:59,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 14:41:59,957 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 215 transitions. [2018-10-10 14:41:59,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-10 14:41:59,958 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:59,959 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:41:59,959 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:41:59,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:59,960 INFO L82 PathProgramCache]: Analyzing trace with hash 556350137, now seen corresponding path program 1 times [2018-10-10 14:41:59,960 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:59,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:59,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:59,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:59,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:59,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:00,046 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:00,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:00,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-10 14:42:00,047 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-10 14:42:00,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-10 14:42:00,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 14:42:00,047 INFO L87 Difference]: Start difference. First operand 209 states and 215 transitions. Second operand 3 states. [2018-10-10 14:42:00,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:00,155 INFO L93 Difference]: Finished difference Result 211 states and 217 transitions. [2018-10-10 14:42:00,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-10 14:42:00,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2018-10-10 14:42:00,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:00,157 INFO L225 Difference]: With dead ends: 211 [2018-10-10 14:42:00,157 INFO L226 Difference]: Without dead ends: 211 [2018-10-10 14:42:00,158 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 14:42:00,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-10-10 14:42:00,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-10-10 14:42:00,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-10-10 14:42:00,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 217 transitions. [2018-10-10 14:42:00,162 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 217 transitions. Word has length 122 [2018-10-10 14:42:00,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:00,162 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 217 transitions. [2018-10-10 14:42:00,162 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-10 14:42:00,163 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 217 transitions. [2018-10-10 14:42:00,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-10 14:42:00,164 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:00,164 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:00,165 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:42:00,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:00,165 INFO L82 PathProgramCache]: Analyzing trace with hash 583182624, now seen corresponding path program 1 times [2018-10-10 14:42:00,165 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:00,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:00,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:00,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:00,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:00,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:00,376 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-10 14:42:00,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:00,376 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:42:00,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:00,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:00,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:00,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 14:42:00,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:00,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:00,514 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-10 14:42:00,595 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-10 14:42:00,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:42:00,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-10 14:42:00,678 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_cstrspn_#t~short7's outvar occurs in several conjuncts [(let ((.cse0 (= 0 |v_ULTIMATE.start_cstrspn_#t~mem5_3|))) (or (and .cse0 (not |v_ULTIMATE.start_cstrspn_#t~short7_2|)) (and |v_ULTIMATE.start_cstrspn_#t~short7_2| (not .cse0))))] at de.uni_freiburg.informatik.ultimate.modelcheckerutils.cfg.transitions.SimultaneousUpdate.(SimultaneousUpdate.java:107) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumper.addStatementsAndVariables(PathProgramDumper.java:634) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumper.constructTransitionStatements(PathProgramDumper.java:560) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumper.processTransition(PathProgramDumper.java:521) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumper.constructProcedureStatements(PathProgramDumper.java:509) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumper.constructNewImplementation(PathProgramDumper.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumper.(PathProgramDumper.java:194) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumpController.doDump(PathProgramDumpController.java:105) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.PathProgramDumpController.reportPathProgram(PathProgramDumpController.java:69) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:435) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-10-10 14:42:00,682 INFO L168 Benchmark]: Toolchain (without parser) took 13238.46 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 865.6 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -455.7 MB). Peak memory consumption was 409.9 MB. Max. memory is 7.1 GB. [2018-10-10 14:42:00,683 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:42:00,684 INFO L168 Benchmark]: CACSL2BoogieTranslator took 474.27 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-10 14:42:00,685 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.00 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:42:00,685 INFO L168 Benchmark]: Boogie Preprocessor took 121.32 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -817.6 MB). Peak memory consumption was 16.7 MB. Max. memory is 7.1 GB. [2018-10-10 14:42:00,686 INFO L168 Benchmark]: RCFGBuilder took 1025.27 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: 64.3 MB). Peak memory consumption was 64.3 MB. Max. memory is 7.1 GB. [2018-10-10 14:42:00,687 INFO L168 Benchmark]: TraceAbstraction took 11541.39 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 128.5 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 276.5 MB). Peak memory consumption was 404.9 MB. Max. memory is 7.1 GB. [2018-10-10 14:42:00,692 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.19 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 474.27 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.00 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 121.32 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -817.6 MB). Peak memory consumption was 16.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1025.27 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: 64.3 MB). Peak memory consumption was 64.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11541.39 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 128.5 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 276.5 MB). Peak memory consumption was 404.9 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_cstrspn_#t~short7's outvar occurs in several conjuncts [(let ((.cse0 (= 0 |v_ULTIMATE.start_cstrspn_#t~mem5_3|))) (or (and .cse0 (not |v_ULTIMATE.start_cstrspn_#t~short7_2|)) (and |v_ULTIMATE.start_cstrspn_#t~short7_2| (not .cse0))))] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: cannot bring into simultaneous update form ULTIMATE.start_cstrspn_#t~short7's outvar occurs in several conjuncts [(let ((.cse0 (= 0 |v_ULTIMATE.start_cstrspn_#t~mem5_3|))) (or (and .cse0 (not |v_ULTIMATE.start_cstrspn_#t~short7_2|)) (and |v_ULTIMATE.start_cstrspn_#t~short7_2| (not .cse0))))]: de.uni_freiburg.informatik.ultimate.modelcheckerutils.cfg.transitions.SimultaneousUpdate.(SimultaneousUpdate.java:107) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...