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/cstrcmp-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c5b1954-m [2018-10-10 14:41:32,731 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 14:41:32,738 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 14:41:32,754 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 14:41:32,755 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 14:41:32,756 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 14:41:32,757 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 14:41:32,759 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 14:41:32,761 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 14:41:32,762 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 14:41:32,763 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 14:41:32,763 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 14:41:32,764 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 14:41:32,765 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 14:41:32,766 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 14:41:32,767 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 14:41:32,768 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 14:41:32,770 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 14:41:32,775 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 14:41:32,777 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 14:41:32,781 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 14:41:32,782 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 14:41:32,787 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 14:41:32,787 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 14:41:32,791 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 14:41:32,792 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 14:41:32,795 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 14:41:32,798 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 14:41:32,799 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 14:41:32,803 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 14:41:32,803 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 14:41:32,804 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 14:41:32,804 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 14:41:32,804 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 14:41:32,805 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 14:41:32,806 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 14:41:32,807 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:32,822 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 14:41:32,822 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 14:41:32,823 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-10 14:41:32,824 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-10 14:41:32,824 INFO L133 SettingsManager]: * Use SBE=true [2018-10-10 14:41:32,824 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-10 14:41:32,824 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-10 14:41:32,824 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-10 14:41:32,825 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-10 14:41:32,825 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-10 14:41:32,825 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-10 14:41:32,825 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-10 14:41:32,825 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-10 14:41:32,826 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-10 14:41:32,826 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-10 14:41:32,826 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-10 14:41:32,826 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 14:41:32,826 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-10 14:41:32,827 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-10 14:41:32,827 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-10 14:41:32,827 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:41:32,827 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 14:41:32,827 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-10 14:41:32,828 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-10 14:41:32,828 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-10 14:41:32,828 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:32,873 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 14:41:32,886 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 14:41:32,890 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 14:41:32,892 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-10 14:41:32,892 INFO L276 PluginConnector]: CDTParser initialized [2018-10-10 14:41:32,893 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:41:33,211 INFO L217 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7ec5fc96/839e8c5f151448e8a229c2807a580f56/FLAG80d74cd0c [2018-10-10 14:41:33,463 INFO L289 CDTParser]: Found 1 translation units. [2018-10-10 14:41:33,464 INFO L157 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-memsafety/cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:41:33,479 INFO L337 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7ec5fc96/839e8c5f151448e8a229c2807a580f56/FLAG80d74cd0c [2018-10-10 14:41:33,499 INFO L345 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7ec5fc96/839e8c5f151448e8a229c2807a580f56 [2018-10-10 14:41:33,509 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 14:41:33,510 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-10 14:41:33,511 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-10 14:41:33,511 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-10 14:41:33,515 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-10 14:41:33,516 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:41:33" (1/1) ... [2018-10-10 14:41:33,519 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16a93b79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:33, skipping insertion in model container [2018-10-10 14:41:33,520 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:41:33" (1/1) ... [2018-10-10 14:41:33,530 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-10 14:41:33,577 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-10 14:41:33,801 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:41:33,812 INFO L189 MainTranslator]: Completed pre-run [2018-10-10 14:41:33,894 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:41:33,964 INFO L193 MainTranslator]: Completed translation [2018-10-10 14:41:33,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:33 WrapperNode [2018-10-10 14:41:33,964 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-10 14:41:33,965 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-10 14:41:33,966 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-10 14:41:33,966 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-10 14:41:33,976 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:33" (1/1) ... [2018-10-10 14:41:33,994 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:33" (1/1) ... [2018-10-10 14:41:34,026 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-10 14:41:34,027 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 14:41:34,027 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 14:41:34,027 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 14:41:34,038 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:33" (1/1) ... [2018-10-10 14:41:34,038 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:33" (1/1) ... [2018-10-10 14:41:34,043 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:33" (1/1) ... [2018-10-10 14:41:34,044 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:33" (1/1) ... [2018-10-10 14:41:34,051 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:33" (1/1) ... [2018-10-10 14:41:34,057 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:33" (1/1) ... [2018-10-10 14:41:34,059 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:33" (1/1) ... [2018-10-10 14:41:34,062 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 14:41:34,066 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 14:41:34,066 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 14:41:34,067 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 14:41:34,071 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:33" (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:34,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 14:41:34,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 14:41:35,218 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 14:41:35,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:41:35 BoogieIcfgContainer [2018-10-10 14:41:35,219 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 14:41:35,220 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 14:41:35,221 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 14:41:35,224 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 14:41:35,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 02:41:33" (1/3) ... [2018-10-10 14:41:35,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b76c1e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:41:35, skipping insertion in model container [2018-10-10 14:41:35,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:33" (2/3) ... [2018-10-10 14:41:35,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b76c1e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:41:35, skipping insertion in model container [2018-10-10 14:41:35,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:41:35" (3/3) ... [2018-10-10 14:41:35,228 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:41:35,238 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-10 14:41:35,247 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-10-10 14:41:35,266 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2018-10-10 14:41:35,296 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 14:41:35,297 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 14:41:35,297 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 14:41:35,297 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-10 14:41:35,297 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 14:41:35,298 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 14:41:35,298 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 14:41:35,298 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 14:41:35,298 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 14:41:35,323 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states. [2018-10-10 14:41:35,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-10 14:41:35,333 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:35,334 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:35,337 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:35,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:35,343 INFO L82 PathProgramCache]: Analyzing trace with hash 989039711, now seen corresponding path program 1 times [2018-10-10 14:41:35,345 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:35,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:35,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:35,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:35,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:35,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:35,899 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:35,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:35,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:41:35,907 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:41:35,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:41:35,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:41:35,927 INFO L87 Difference]: Start difference. First operand 190 states. Second operand 8 states. [2018-10-10 14:41:36,480 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-10 14:41:36,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:36,760 INFO L93 Difference]: Finished difference Result 189 states and 193 transitions. [2018-10-10 14:41:36,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:41:36,761 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-10-10 14:41:36,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:36,774 INFO L225 Difference]: With dead ends: 189 [2018-10-10 14:41:36,775 INFO L226 Difference]: Without dead ends: 184 [2018-10-10 14:41:36,777 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:36,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-10-10 14:41:36,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-10-10 14:41:36,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-10-10 14:41:36,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 188 transitions. [2018-10-10 14:41:36,833 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 188 transitions. Word has length 46 [2018-10-10 14:41:36,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:36,834 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 188 transitions. [2018-10-10 14:41:36,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:41:36,835 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 188 transitions. [2018-10-10 14:41:36,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-10 14:41:36,836 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:36,836 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:36,837 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:36,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:36,838 INFO L82 PathProgramCache]: Analyzing trace with hash 595460060, now seen corresponding path program 1 times [2018-10-10 14:41:36,838 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:36,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:36,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:36,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:36,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:36,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:37,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:41:37,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:37,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-10 14:41:37,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 14:41:37,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 14:41:37,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:41:37,457 INFO L87 Difference]: Start difference. First operand 184 states and 188 transitions. Second operand 13 states. [2018-10-10 14:41:38,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:38,834 INFO L93 Difference]: Finished difference Result 183 states and 187 transitions. [2018-10-10 14:41:38,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 14:41:38,835 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2018-10-10 14:41:38,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:38,837 INFO L225 Difference]: With dead ends: 183 [2018-10-10 14:41:38,838 INFO L226 Difference]: Without dead ends: 183 [2018-10-10 14:41:38,839 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:38,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-10-10 14:41:38,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-10-10 14:41:38,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-10-10 14:41:38,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 187 transitions. [2018-10-10 14:41:38,855 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 187 transitions. Word has length 47 [2018-10-10 14:41:38,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:38,855 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 187 transitions. [2018-10-10 14:41:38,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 14:41:38,855 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 187 transitions. [2018-10-10 14:41:38,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-10 14:41:38,859 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:38,859 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:41:38,860 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:38,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:38,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1452289403, now seen corresponding path program 1 times [2018-10-10 14:41:38,860 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:38,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:38,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:38,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:38,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:38,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:38,962 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:38,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:38,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:41:38,964 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:41:38,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:41:38,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:41:38,965 INFO L87 Difference]: Start difference. First operand 183 states and 187 transitions. Second operand 6 states. [2018-10-10 14:41:39,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:39,223 INFO L93 Difference]: Finished difference Result 182 states and 186 transitions. [2018-10-10 14:41:39,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 14:41:39,228 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-10-10 14:41:39,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:39,230 INFO L225 Difference]: With dead ends: 182 [2018-10-10 14:41:39,231 INFO L226 Difference]: Without dead ends: 182 [2018-10-10 14:41:39,231 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:39,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-10 14:41:39,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-10-10 14:41:39,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-10 14:41:39,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 186 transitions. [2018-10-10 14:41:39,243 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 186 transitions. Word has length 56 [2018-10-10 14:41:39,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:39,243 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 186 transitions. [2018-10-10 14:41:39,243 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:41:39,244 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 186 transitions. [2018-10-10 14:41:39,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-10 14:41:39,245 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:39,245 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:39,246 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:39,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:39,247 INFO L82 PathProgramCache]: Analyzing trace with hash -2071298430, now seen corresponding path program 1 times [2018-10-10 14:41:39,247 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:39,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:39,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:39,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:39,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:39,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:39,457 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:39,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:39,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:41:39,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:41:39,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:41:39,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:41:39,459 INFO L87 Difference]: Start difference. First operand 182 states and 186 transitions. Second operand 9 states. [2018-10-10 14:41:39,758 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-10 14:41:40,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:40,028 INFO L93 Difference]: Finished difference Result 181 states and 185 transitions. [2018-10-10 14:41:40,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:41:40,028 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2018-10-10 14:41:40,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:40,031 INFO L225 Difference]: With dead ends: 181 [2018-10-10 14:41:40,031 INFO L226 Difference]: Without dead ends: 181 [2018-10-10 14:41:40,032 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:41:40,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-10-10 14:41:40,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-10-10 14:41:40,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-10 14:41:40,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 185 transitions. [2018-10-10 14:41:40,041 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 185 transitions. Word has length 57 [2018-10-10 14:41:40,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:40,042 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 185 transitions. [2018-10-10 14:41:40,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:41:40,042 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 185 transitions. [2018-10-10 14:41:40,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-10 14:41:40,044 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:40,044 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] [2018-10-10 14:41:40,045 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:40,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:40,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1144302544, now seen corresponding path program 1 times [2018-10-10 14:41:40,046 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:40,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:40,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:40,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:40,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:40,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:40,163 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:40,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:40,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:41:40,164 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:41:40,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:41:40,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:41:40,165 INFO L87 Difference]: Start difference. First operand 181 states and 185 transitions. Second operand 8 states. [2018-10-10 14:41:40,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:40,640 INFO L93 Difference]: Finished difference Result 271 states and 278 transitions. [2018-10-10 14:41:40,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 14:41:40,641 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 74 [2018-10-10 14:41:40,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:40,643 INFO L225 Difference]: With dead ends: 271 [2018-10-10 14:41:40,643 INFO L226 Difference]: Without dead ends: 271 [2018-10-10 14:41:40,643 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:41:40,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-10-10 14:41:40,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 223. [2018-10-10 14:41:40,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-10-10 14:41:40,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 233 transitions. [2018-10-10 14:41:40,655 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 233 transitions. Word has length 74 [2018-10-10 14:41:40,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:40,656 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 233 transitions. [2018-10-10 14:41:40,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:41:40,656 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 233 transitions. [2018-10-10 14:41:40,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-10 14:41:40,657 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:40,657 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] [2018-10-10 14:41:40,658 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:40,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:40,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1113640623, now seen corresponding path program 1 times [2018-10-10 14:41:40,659 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:40,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:40,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:40,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:40,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:40,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:41,085 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:41,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:41,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-10 14:41:41,086 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 14:41:41,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 14:41:41,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:41:41,086 INFO L87 Difference]: Start difference. First operand 223 states and 233 transitions. Second operand 11 states. [2018-10-10 14:41:41,837 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-10 14:41:41,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:41,956 INFO L93 Difference]: Finished difference Result 300 states and 307 transitions. [2018-10-10 14:41:41,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-10 14:41:41,956 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 75 [2018-10-10 14:41:41,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:41,960 INFO L225 Difference]: With dead ends: 300 [2018-10-10 14:41:41,960 INFO L226 Difference]: Without dead ends: 300 [2018-10-10 14:41:41,961 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=142, Invalid=364, Unknown=0, NotChecked=0, Total=506 [2018-10-10 14:41:41,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-10-10 14:41:41,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 224. [2018-10-10 14:41:41,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-10-10 14:41:41,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 232 transitions. [2018-10-10 14:41:41,969 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 232 transitions. Word has length 75 [2018-10-10 14:41:41,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:41,970 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 232 transitions. [2018-10-10 14:41:41,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 14:41:41,970 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 232 transitions. [2018-10-10 14:41:41,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-10 14:41:41,972 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:41,972 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] [2018-10-10 14:41:41,973 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:41,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:41,974 INFO L82 PathProgramCache]: Analyzing trace with hash -352225219, now seen corresponding path program 1 times [2018-10-10 14:41:41,974 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:41,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:41,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:41,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:41,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:41,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:42,107 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:42,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:42,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:41:42,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:41:42,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:41:42,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:41:42,109 INFO L87 Difference]: Start difference. First operand 224 states and 232 transitions. Second operand 8 states. [2018-10-10 14:41:42,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:42,482 INFO L93 Difference]: Finished difference Result 269 states and 276 transitions. [2018-10-10 14:41:42,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 14:41:42,488 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2018-10-10 14:41:42,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:42,490 INFO L225 Difference]: With dead ends: 269 [2018-10-10 14:41:42,490 INFO L226 Difference]: Without dead ends: 269 [2018-10-10 14:41:42,491 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:41:42,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-10-10 14:41:42,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 235. [2018-10-10 14:41:42,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-10-10 14:41:42,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 242 transitions. [2018-10-10 14:41:42,497 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 242 transitions. Word has length 96 [2018-10-10 14:41:42,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:42,498 INFO L481 AbstractCegarLoop]: Abstraction has 235 states and 242 transitions. [2018-10-10 14:41:42,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:41:42,498 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 242 transitions. [2018-10-10 14:41:42,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-10 14:41:42,500 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:42,500 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] [2018-10-10 14:41:42,501 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:42,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:42,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1965920254, now seen corresponding path program 1 times [2018-10-10 14:41:42,502 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:42,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:42,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:42,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:42,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:42,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:42,876 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:42,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:42,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-10 14:41:42,877 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 14:41:42,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 14:41:42,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:41:42,878 INFO L87 Difference]: Start difference. First operand 235 states and 242 transitions. Second operand 11 states. [2018-10-10 14:41:43,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:43,683 INFO L93 Difference]: Finished difference Result 299 states and 306 transitions. [2018-10-10 14:41:43,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-10 14:41:43,683 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 97 [2018-10-10 14:41:43,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:43,686 INFO L225 Difference]: With dead ends: 299 [2018-10-10 14:41:43,686 INFO L226 Difference]: Without dead ends: 299 [2018-10-10 14:41:43,686 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=155, Invalid=307, Unknown=0, NotChecked=0, Total=462 [2018-10-10 14:41:43,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-10-10 14:41:43,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 236. [2018-10-10 14:41:43,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-10-10 14:41:43,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 242 transitions. [2018-10-10 14:41:43,692 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 242 transitions. Word has length 97 [2018-10-10 14:41:43,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:43,692 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 242 transitions. [2018-10-10 14:41:43,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 14:41:43,692 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 242 transitions. [2018-10-10 14:41:43,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-10 14:41:43,694 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:43,694 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] [2018-10-10 14:41:43,695 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:43,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:43,695 INFO L82 PathProgramCache]: Analyzing trace with hash -100882649, now seen corresponding path program 1 times [2018-10-10 14:41:43,695 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:43,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:43,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:43,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:43,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:43,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:43,776 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:41:43,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:43,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-10 14:41:43,777 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-10 14:41:43,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-10 14:41:43,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 14:41:43,777 INFO L87 Difference]: Start difference. First operand 236 states and 242 transitions. Second operand 3 states. [2018-10-10 14:41:43,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:43,900 INFO L93 Difference]: Finished difference Result 238 states and 244 transitions. [2018-10-10 14:41:43,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-10 14:41:43,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-10-10 14:41:43,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:43,902 INFO L225 Difference]: With dead ends: 238 [2018-10-10 14:41:43,902 INFO L226 Difference]: Without dead ends: 238 [2018-10-10 14:41:43,902 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:41:43,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-10-10 14:41:43,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2018-10-10 14:41:43,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-10-10 14:41:43,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 244 transitions. [2018-10-10 14:41:43,908 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 244 transitions. Word has length 98 [2018-10-10 14:41:43,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:43,910 INFO L481 AbstractCegarLoop]: Abstraction has 238 states and 244 transitions. [2018-10-10 14:41:43,910 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-10 14:41:43,910 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 244 transitions. [2018-10-10 14:41:43,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-10 14:41:43,912 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:43,912 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] [2018-10-10 14:41:43,913 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:43,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:43,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1580617238, now seen corresponding path program 1 times [2018-10-10 14:41:43,914 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:43,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:43,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:43,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:43,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:43,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:44,764 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:41:44,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:41:44,765 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:41:44,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:44,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:44,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:41:45,039 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:41:45,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:41:45,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 8 [2018-10-10 14:41:45,156 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_cstrcmp_#t~short5's outvar occurs in several conjuncts [(let ((.cse0 (= 0 |v_ULTIMATE.start_cstrcmp_#t~mem2_3|))) (or (and (not |v_ULTIMATE.start_cstrcmp_#t~short5_2|) .cse0) (and |v_ULTIMATE.start_cstrcmp_#t~short5_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:41:45,161 INFO L168 Benchmark]: Toolchain (without parser) took 11651.52 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 889.2 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -834.7 MB). Peak memory consumption was 54.5 MB. Max. memory is 7.1 GB. [2018-10-10 14:41:45,162 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:41:45,163 INFO L168 Benchmark]: CACSL2BoogieTranslator took 453.91 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:41:45,164 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.14 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:41:45,164 INFO L168 Benchmark]: Boogie Preprocessor took 38.78 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:41:45,165 INFO L168 Benchmark]: RCFGBuilder took 1152.89 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 755.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -781.9 MB). Peak memory consumption was 17.0 MB. Max. memory is 7.1 GB. [2018-10-10 14:41:45,166 INFO L168 Benchmark]: TraceAbstraction took 9939.63 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 133.7 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -74.0 MB). Peak memory consumption was 59.7 MB. Max. memory is 7.1 GB. [2018-10-10 14:41:45,173 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 453.91 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 61.14 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 38.78 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. * RCFGBuilder took 1152.89 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 755.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -781.9 MB). Peak memory consumption was 17.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9939.63 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 133.7 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -74.0 MB). Peak memory consumption was 59.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalArgumentException: cannot bring into simultaneous update form ULTIMATE.start_cstrcmp_#t~short5's outvar occurs in several conjuncts [(let ((.cse0 (= 0 |v_ULTIMATE.start_cstrcmp_#t~mem2_3|))) (or (and (not |v_ULTIMATE.start_cstrcmp_#t~short5_2|) .cse0) (and |v_ULTIMATE.start_cstrcmp_#t~short5_2| (not .cse0))))] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: cannot bring into simultaneous update form ULTIMATE.start_cstrcmp_#t~short5's outvar occurs in several conjuncts [(let ((.cse0 (= 0 |v_ULTIMATE.start_cstrcmp_#t~mem2_3|))) (or (and (not |v_ULTIMATE.start_cstrcmp_#t~short5_2|) .cse0) (and |v_ULTIMATE.start_cstrcmp_#t~short5_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...