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/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c5b1954-m [2018-10-10 14:42:04,353 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 14:42:04,356 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 14:42:04,372 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 14:42:04,373 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 14:42:04,375 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 14:42:04,376 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 14:42:04,378 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 14:42:04,381 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 14:42:04,382 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 14:42:04,384 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 14:42:04,384 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 14:42:04,385 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 14:42:04,387 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 14:42:04,395 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 14:42:04,395 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 14:42:04,399 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 14:42:04,400 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 14:42:04,403 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 14:42:04,405 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 14:42:04,406 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 14:42:04,409 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 14:42:04,411 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 14:42:04,411 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 14:42:04,411 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 14:42:04,412 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 14:42:04,413 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 14:42:04,414 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 14:42:04,415 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 14:42:04,416 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 14:42:04,416 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 14:42:04,416 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 14:42:04,417 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 14:42:04,417 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 14:42:04,418 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 14:42:04,419 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 14:42:04,419 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:42:04,433 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 14:42:04,433 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 14:42:04,434 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-10 14:42:04,434 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-10 14:42:04,434 INFO L133 SettingsManager]: * Use SBE=true [2018-10-10 14:42:04,435 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-10 14:42:04,435 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-10 14:42:04,435 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-10 14:42:04,435 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-10 14:42:04,436 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-10 14:42:04,436 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-10 14:42:04,436 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-10 14:42:04,436 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-10 14:42:04,436 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-10 14:42:04,437 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-10 14:42:04,437 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-10 14:42:04,437 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 14:42:04,437 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-10 14:42:04,437 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-10 14:42:04,438 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-10 14:42:04,438 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:42:04,438 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 14:42:04,438 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-10 14:42:04,438 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-10 14:42:04,439 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-10 14:42:04,439 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:42:04,494 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 14:42:04,514 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 14:42:04,518 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 14:42:04,520 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-10 14:42:04,520 INFO L276 PluginConnector]: CDTParser initialized [2018-10-10 14:42:04,521 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:42:04,833 INFO L217 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0dc5813b/46dd7b9d787f4033b3222f4671ec56eb/FLAG12352df50 [2018-10-10 14:42:05,096 INFO L289 CDTParser]: Found 1 translation units. [2018-10-10 14:42:05,097 INFO L157 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-memsafety/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:42:05,110 INFO L337 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0dc5813b/46dd7b9d787f4033b3222f4671ec56eb/FLAG12352df50 [2018-10-10 14:42:05,125 INFO L345 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0dc5813b/46dd7b9d787f4033b3222f4671ec56eb [2018-10-10 14:42:05,135 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 14:42:05,136 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-10 14:42:05,137 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-10 14:42:05,137 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-10 14:42:05,141 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-10 14:42:05,142 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:42:05" (1/1) ... [2018-10-10 14:42:05,145 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e06d54d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:05, skipping insertion in model container [2018-10-10 14:42:05,146 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:42:05" (1/1) ... [2018-10-10 14:42:05,156 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-10 14:42:05,200 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-10 14:42:05,476 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:42:05,491 INFO L189 MainTranslator]: Completed pre-run [2018-10-10 14:42:05,583 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:42:05,653 INFO L193 MainTranslator]: Completed translation [2018-10-10 14:42:05,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:05 WrapperNode [2018-10-10 14:42:05,654 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-10 14:42:05,655 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-10 14:42:05,655 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-10 14:42:05,655 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-10 14:42:05,667 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:42:05" (1/1) ... [2018-10-10 14:42:05,694 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:42:05" (1/1) ... [2018-10-10 14:42:05,737 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-10 14:42:05,737 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 14:42:05,737 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 14:42:05,737 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 14:42:05,750 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:05" (1/1) ... [2018-10-10 14:42:05,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:05" (1/1) ... [2018-10-10 14:42:05,761 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:05" (1/1) ... [2018-10-10 14:42:05,762 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:05" (1/1) ... [2018-10-10 14:42:05,777 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:05" (1/1) ... [2018-10-10 14:42:05,787 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:05" (1/1) ... [2018-10-10 14:42:05,794 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:05" (1/1) ... [2018-10-10 14:42:05,799 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 14:42:05,800 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 14:42:05,800 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 14:42:05,800 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 14:42:05,803 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:05" (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:42:05,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 14:42:05,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 14:42:06,872 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 14:42:06,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:42:06 BoogieIcfgContainer [2018-10-10 14:42:06,872 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 14:42:06,873 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 14:42:06,874 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 14:42:06,877 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 14:42:06,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 02:42:05" (1/3) ... [2018-10-10 14:42:06,878 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@193dee55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:42:06, skipping insertion in model container [2018-10-10 14:42:06,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:05" (2/3) ... [2018-10-10 14:42:06,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@193dee55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:42:06, skipping insertion in model container [2018-10-10 14:42:06,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:42:06" (3/3) ... [2018-10-10 14:42:06,881 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:42:06,891 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-10 14:42:06,900 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-10-10 14:42:06,918 INFO L257 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2018-10-10 14:42:06,946 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 14:42:06,947 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 14:42:06,947 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 14:42:06,947 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-10 14:42:06,947 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 14:42:06,947 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 14:42:06,947 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 14:42:06,948 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 14:42:06,948 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 14:42:06,969 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states. [2018-10-10 14:42:06,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-10 14:42:06,979 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:06,980 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:42:06,983 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:06,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:06,990 INFO L82 PathProgramCache]: Analyzing trace with hash 989039711, now seen corresponding path program 1 times [2018-10-10 14:42:06,992 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:06,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:07,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:07,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:07,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:07,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:07,513 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:42:07,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:07,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:42:07,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:42:07,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:42:07,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:42:07,543 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 8 states. [2018-10-10 14:42:08,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:08,512 INFO L93 Difference]: Finished difference Result 183 states and 186 transitions. [2018-10-10 14:42:08,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:42:08,515 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-10-10 14:42:08,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:08,528 INFO L225 Difference]: With dead ends: 183 [2018-10-10 14:42:08,529 INFO L226 Difference]: Without dead ends: 178 [2018-10-10 14:42:08,531 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:42:08,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-10-10 14:42:08,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-10-10 14:42:08,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-10-10 14:42:08,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 181 transitions. [2018-10-10 14:42:08,578 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 181 transitions. Word has length 46 [2018-10-10 14:42:08,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:08,578 INFO L481 AbstractCegarLoop]: Abstraction has 178 states and 181 transitions. [2018-10-10 14:42:08,579 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:42:08,579 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 181 transitions. [2018-10-10 14:42:08,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-10 14:42:08,580 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:08,580 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:42:08,581 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:08,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:08,582 INFO L82 PathProgramCache]: Analyzing trace with hash 595460060, now seen corresponding path program 1 times [2018-10-10 14:42:08,582 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:08,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:08,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:08,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:08,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:08,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:09,046 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:42:09,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:09,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-10 14:42:09,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 14:42:09,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 14:42:09,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:42:09,050 INFO L87 Difference]: Start difference. First operand 178 states and 181 transitions. Second operand 13 states. [2018-10-10 14:42:10,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:10,165 INFO L93 Difference]: Finished difference Result 177 states and 180 transitions. [2018-10-10 14:42:10,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 14:42:10,170 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2018-10-10 14:42:10,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:10,172 INFO L225 Difference]: With dead ends: 177 [2018-10-10 14:42:10,173 INFO L226 Difference]: Without dead ends: 177 [2018-10-10 14:42:10,174 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2018-10-10 14:42:10,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-10-10 14:42:10,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-10-10 14:42:10,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-10-10 14:42:10,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 180 transitions. [2018-10-10 14:42:10,190 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 180 transitions. Word has length 47 [2018-10-10 14:42:10,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:10,191 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 180 transitions. [2018-10-10 14:42:10,191 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 14:42:10,191 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 180 transitions. [2018-10-10 14:42:10,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-10 14:42:10,193 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:10,193 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:42:10,194 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:10,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:10,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1452289403, now seen corresponding path program 1 times [2018-10-10 14:42:10,196 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:10,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:10,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:10,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:10,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:10,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:10,305 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:42:10,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:10,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:42:10,307 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:42:10,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:42:10,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:42:10,308 INFO L87 Difference]: Start difference. First operand 177 states and 180 transitions. Second operand 6 states. [2018-10-10 14:42:10,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:10,537 INFO L93 Difference]: Finished difference Result 176 states and 179 transitions. [2018-10-10 14:42:10,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 14:42:10,538 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-10-10 14:42:10,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:10,542 INFO L225 Difference]: With dead ends: 176 [2018-10-10 14:42:10,542 INFO L226 Difference]: Without dead ends: 176 [2018-10-10 14:42:10,543 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:42:10,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-10-10 14:42:10,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-10-10 14:42:10,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-10-10 14:42:10,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 179 transitions. [2018-10-10 14:42:10,554 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 179 transitions. Word has length 56 [2018-10-10 14:42:10,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:10,555 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 179 transitions. [2018-10-10 14:42:10,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:42:10,555 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 179 transitions. [2018-10-10 14:42:10,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-10 14:42:10,557 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:10,557 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:42:10,558 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:10,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:10,558 INFO L82 PathProgramCache]: Analyzing trace with hash -2071298430, now seen corresponding path program 1 times [2018-10-10 14:42:10,558 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:10,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:10,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:10,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:10,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:10,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:10,743 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:42:10,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:10,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:42:10,744 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:42:10,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:42:10,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:42:10,745 INFO L87 Difference]: Start difference. First operand 176 states and 179 transitions. Second operand 9 states. [2018-10-10 14:42:11,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:11,300 INFO L93 Difference]: Finished difference Result 175 states and 178 transitions. [2018-10-10 14:42:11,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:42:11,301 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2018-10-10 14:42:11,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:11,302 INFO L225 Difference]: With dead ends: 175 [2018-10-10 14:42:11,302 INFO L226 Difference]: Without dead ends: 175 [2018-10-10 14:42:11,303 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:42:11,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-10-10 14:42:11,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-10-10 14:42:11,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-10-10 14:42:11,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 178 transitions. [2018-10-10 14:42:11,312 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 178 transitions. Word has length 57 [2018-10-10 14:42:11,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:11,312 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 178 transitions. [2018-10-10 14:42:11,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:42:11,313 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 178 transitions. [2018-10-10 14:42:11,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-10 14:42:11,315 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:11,315 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:11,316 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:11,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:11,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1947317201, now seen corresponding path program 1 times [2018-10-10 14:42:11,317 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:11,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:11,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:11,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:11,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:11,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:11,440 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:42:11,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:11,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:42:11,441 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:42:11,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:42:11,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:42:11,442 INFO L87 Difference]: Start difference. First operand 175 states and 178 transitions. Second operand 8 states. [2018-10-10 14:42:11,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:11,983 INFO L93 Difference]: Finished difference Result 248 states and 252 transitions. [2018-10-10 14:42:11,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 14:42:11,983 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2018-10-10 14:42:11,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:11,985 INFO L225 Difference]: With dead ends: 248 [2018-10-10 14:42:11,986 INFO L226 Difference]: Without dead ends: 248 [2018-10-10 14:42:11,986 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:42:11,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-10-10 14:42:11,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 205. [2018-10-10 14:42:11,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-10-10 14:42:11,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 212 transitions. [2018-10-10 14:42:11,996 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 212 transitions. Word has length 72 [2018-10-10 14:42:11,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:11,997 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 212 transitions. [2018-10-10 14:42:11,997 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:42:11,997 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 212 transitions. [2018-10-10 14:42:11,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-10 14:42:12,000 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:12,000 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:12,001 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:12,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:12,001 INFO L82 PathProgramCache]: Analyzing trace with hash -237290962, now seen corresponding path program 1 times [2018-10-10 14:42:12,001 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:12,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:12,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:12,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:12,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:12,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:12,323 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:42:12,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:12,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-10 14:42:12,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 14:42:12,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 14:42:12,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:42:12,325 INFO L87 Difference]: Start difference. First operand 205 states and 212 transitions. Second operand 11 states. [2018-10-10 14:42:12,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:12,965 INFO L93 Difference]: Finished difference Result 258 states and 261 transitions. [2018-10-10 14:42:12,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-10 14:42:12,966 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 73 [2018-10-10 14:42:12,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:12,969 INFO L225 Difference]: With dead ends: 258 [2018-10-10 14:42:12,969 INFO L226 Difference]: Without dead ends: 258 [2018-10-10 14:42:12,970 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2018-10-10 14:42:12,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-10-10 14:42:12,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 206. [2018-10-10 14:42:12,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-10-10 14:42:12,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 212 transitions. [2018-10-10 14:42:12,977 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 212 transitions. Word has length 73 [2018-10-10 14:42:12,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:12,978 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 212 transitions. [2018-10-10 14:42:12,978 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 14:42:12,978 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 212 transitions. [2018-10-10 14:42:12,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-10 14:42:12,981 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:12,981 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] [2018-10-10 14:42:12,982 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:12,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:12,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1078853494, now seen corresponding path program 1 times [2018-10-10 14:42:12,983 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:12,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:12,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:12,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:12,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:12,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:13,262 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:42:13,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:13,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:42:13,263 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:42:13,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:42:13,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:42:13,264 INFO L87 Difference]: Start difference. First operand 206 states and 212 transitions. Second operand 9 states. [2018-10-10 14:42:13,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:13,639 INFO L93 Difference]: Finished difference Result 205 states and 210 transitions. [2018-10-10 14:42:13,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 14:42:13,640 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2018-10-10 14:42:13,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:13,642 INFO L225 Difference]: With dead ends: 205 [2018-10-10 14:42:13,642 INFO L226 Difference]: Without dead ends: 205 [2018-10-10 14:42:13,643 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-10-10 14:42:13,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-10-10 14:42:13,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-10-10 14:42:13,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-10-10 14:42:13,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 210 transitions. [2018-10-10 14:42:13,649 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 210 transitions. Word has length 84 [2018-10-10 14:42:13,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:13,650 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 210 transitions. [2018-10-10 14:42:13,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:42:13,650 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 210 transitions. [2018-10-10 14:42:13,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-10 14:42:13,652 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:13,652 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] [2018-10-10 14:42:13,653 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:13,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:13,654 INFO L82 PathProgramCache]: Analyzing trace with hash -915279915, now seen corresponding path program 1 times [2018-10-10 14:42:13,654 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:13,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:13,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:13,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:13,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:13,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:13,895 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:42:13,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:13,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-10 14:42:13,896 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 14:42:13,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 14:42:13,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:42:13,897 INFO L87 Difference]: Start difference. First operand 205 states and 210 transitions. Second operand 12 states. [2018-10-10 14:42:14,308 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-10-10 14:42:14,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:14,834 INFO L93 Difference]: Finished difference Result 212 states and 216 transitions. [2018-10-10 14:42:14,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-10 14:42:14,835 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 85 [2018-10-10 14:42:14,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:14,836 INFO L225 Difference]: With dead ends: 212 [2018-10-10 14:42:14,836 INFO L226 Difference]: Without dead ends: 212 [2018-10-10 14:42:14,837 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=179, Invalid=373, Unknown=0, NotChecked=0, Total=552 [2018-10-10 14:42:14,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-10-10 14:42:14,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 205. [2018-10-10 14:42:14,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-10-10 14:42:14,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 209 transitions. [2018-10-10 14:42:14,842 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 209 transitions. Word has length 85 [2018-10-10 14:42:14,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:14,842 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 209 transitions. [2018-10-10 14:42:14,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 14:42:14,842 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 209 transitions. [2018-10-10 14:42:14,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-10 14:42:14,850 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:14,850 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] [2018-10-10 14:42:14,851 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:14,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:14,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1512073990, now seen corresponding path program 1 times [2018-10-10 14:42:14,852 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:14,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:14,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:14,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:14,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:14,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:15,010 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:42:15,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:15,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:42:15,011 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:42:15,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:42:15,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:42:15,012 INFO L87 Difference]: Start difference. First operand 205 states and 209 transitions. Second operand 9 states. [2018-10-10 14:42:15,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:15,297 INFO L93 Difference]: Finished difference Result 202 states and 206 transitions. [2018-10-10 14:42:15,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 14:42:15,299 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 100 [2018-10-10 14:42:15,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:15,300 INFO L225 Difference]: With dead ends: 202 [2018-10-10 14:42:15,300 INFO L226 Difference]: Without dead ends: 202 [2018-10-10 14:42:15,301 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:42:15,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-10-10 14:42:15,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2018-10-10 14:42:15,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-10-10 14:42:15,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 206 transitions. [2018-10-10 14:42:15,305 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 206 transitions. Word has length 100 [2018-10-10 14:42:15,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:15,306 INFO L481 AbstractCegarLoop]: Abstraction has 202 states and 206 transitions. [2018-10-10 14:42:15,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:42:15,306 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 206 transitions. [2018-10-10 14:42:15,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-10-10 14:42:15,307 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:15,307 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] [2018-10-10 14:42:15,308 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:15,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:15,308 INFO L82 PathProgramCache]: Analyzing trace with hash -370346402, now seen corresponding path program 1 times [2018-10-10 14:42:15,308 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:15,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:15,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:15,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:15,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:15,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:15,635 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:42:15,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:15,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-10 14:42:15,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 14:42:15,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 14:42:15,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:42:15,636 INFO L87 Difference]: Start difference. First operand 202 states and 206 transitions. Second operand 13 states. [2018-10-10 14:42:16,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:16,295 INFO L93 Difference]: Finished difference Result 292 states and 295 transitions. [2018-10-10 14:42:16,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-10 14:42:16,296 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 101 [2018-10-10 14:42:16,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:16,298 INFO L225 Difference]: With dead ends: 292 [2018-10-10 14:42:16,298 INFO L226 Difference]: Without dead ends: 292 [2018-10-10 14:42:16,299 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=208, Invalid=604, Unknown=0, NotChecked=0, Total=812 [2018-10-10 14:42:16,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-10-10 14:42:16,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 211. [2018-10-10 14:42:16,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-10-10 14:42:16,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 215 transitions. [2018-10-10 14:42:16,303 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 215 transitions. Word has length 101 [2018-10-10 14:42:16,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:16,304 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 215 transitions. [2018-10-10 14:42:16,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 14:42:16,304 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 215 transitions. [2018-10-10 14:42:16,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-10 14:42:16,305 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:16,305 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, 1, 1, 1, 1] [2018-10-10 14:42:16,306 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:16,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:16,306 INFO L82 PathProgramCache]: Analyzing trace with hash 807224263, now seen corresponding path program 1 times [2018-10-10 14:42:16,306 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:16,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:16,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:16,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:16,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:16,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:16,622 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:42:16,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:16,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-10 14:42:16,623 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 14:42:16,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 14:42:16,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-10-10 14:42:16,624 INFO L87 Difference]: Start difference. First operand 211 states and 215 transitions. Second operand 10 states. [2018-10-10 14:42:17,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:17,007 INFO L93 Difference]: Finished difference Result 210 states and 214 transitions. [2018-10-10 14:42:17,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:42:17,008 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 110 [2018-10-10 14:42:17,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:17,009 INFO L225 Difference]: With dead ends: 210 [2018-10-10 14:42:17,009 INFO L226 Difference]: Without dead ends: 210 [2018-10-10 14:42:17,010 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2018-10-10 14:42:17,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-10-10 14:42:17,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2018-10-10 14:42:17,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-10-10 14:42:17,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 214 transitions. [2018-10-10 14:42:17,015 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 214 transitions. Word has length 110 [2018-10-10 14:42:17,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:17,015 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 214 transitions. [2018-10-10 14:42:17,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 14:42:17,016 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 214 transitions. [2018-10-10 14:42:17,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-10 14:42:17,017 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:17,017 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, 1, 1, 1, 1, 1] [2018-10-10 14:42:17,017 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:17,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:17,018 INFO L82 PathProgramCache]: Analyzing trace with hash -745851420, now seen corresponding path program 1 times [2018-10-10 14:42:17,018 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:17,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:17,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:17,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:17,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:17,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:17,432 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:42:17,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:17,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-10-10 14:42:17,433 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 14:42:17,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 14:42:17,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2018-10-10 14:42:17,434 INFO L87 Difference]: Start difference. First operand 210 states and 214 transitions. Second operand 15 states. [2018-10-10 14:42:18,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:18,603 INFO L93 Difference]: Finished difference Result 300 states and 303 transitions. [2018-10-10 14:42:18,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-10 14:42:18,604 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 111 [2018-10-10 14:42:18,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:18,606 INFO L225 Difference]: With dead ends: 300 [2018-10-10 14:42:18,606 INFO L226 Difference]: Without dead ends: 300 [2018-10-10 14:42:18,607 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 14:42:18,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-10-10 14:42:18,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 222. [2018-10-10 14:42:18,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-10-10 14:42:18,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 226 transitions. [2018-10-10 14:42:18,612 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 226 transitions. Word has length 111 [2018-10-10 14:42:18,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:18,612 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 226 transitions. [2018-10-10 14:42:18,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 14:42:18,613 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 226 transitions. [2018-10-10 14:42:18,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-10 14:42:18,614 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:18,614 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18,615 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:18,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:18,615 INFO L82 PathProgramCache]: Analyzing trace with hash 382886311, now seen corresponding path program 1 times [2018-10-10 14:42:18,615 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:18,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:18,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:18,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:18,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:18,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:19,747 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-10 14:42:20,287 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:20,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:20,287 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:20,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:20,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:20,427 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:20,429 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:20,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:20,440 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-10 14:42:20,541 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:20,544 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:20,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-10 14:42:20,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:20,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:20,554 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-10-10 14:42:20,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-10 14:42:20,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-10 14:42:20,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:20,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:20,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:42:20,717 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-10-10 14:42:21,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-10-10 14:42:21,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-10 14:42:21,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:21,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:21,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:42:21,152 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:36, output treesize:21 [2018-10-10 14:42:21,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-10 14:42:21,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-10-10 14:42:21,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-10 14:42:21,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:42:21,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:42:21,856 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-10-10 14:42:22,165 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:22,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:42:22,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 41 [2018-10-10 14:42:22,236 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i_13.bpl [2018-10-10 14:42:22,246 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-10 14:42:22,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-10 14:42:22,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1608, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 14:42:22,248 INFO L87 Difference]: Start difference. First operand 222 states and 226 transitions. Second operand 42 states. [2018-10-10 14:42:23,364 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 32 [2018-10-10 14:42:23,842 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2018-10-10 14:42:24,458 WARN L178 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 72 [2018-10-10 14:42:25,361 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 79 [2018-10-10 14:42:25,690 WARN L178 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 85 [2018-10-10 14:42:26,078 WARN L178 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 89 [2018-10-10 14:42:26,261 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2018-10-10 14:42:26,419 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2018-10-10 14:42:26,611 WARN L178 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2018-10-10 14:42:26,792 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 82 [2018-10-10 14:42:27,075 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2018-10-10 14:42:27,352 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 75 [2018-10-10 14:42:27,802 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 72 [2018-10-10 14:42:28,400 WARN L178 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2018-10-10 14:42:28,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:28,957 INFO L93 Difference]: Finished difference Result 367 states and 370 transitions. [2018-10-10 14:42:28,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-10 14:42:28,959 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 115 [2018-10-10 14:42:28,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:28,962 INFO L225 Difference]: With dead ends: 367 [2018-10-10 14:42:28,962 INFO L226 Difference]: Without dead ends: 367 [2018-10-10 14:42:28,964 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 98 SyntacticMatches, 3 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1204 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=1091, Invalid=5229, Unknown=0, NotChecked=0, Total=6320 [2018-10-10 14:42:28,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-10-10 14:42:28,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 262. [2018-10-10 14:42:28,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-10-10 14:42:28,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 269 transitions. [2018-10-10 14:42:28,970 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 269 transitions. Word has length 115 [2018-10-10 14:42:28,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:28,971 INFO L481 AbstractCegarLoop]: Abstraction has 262 states and 269 transitions. [2018-10-10 14:42:28,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-10 14:42:28,971 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 269 transitions. [2018-10-10 14:42:28,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-10 14:42:28,972 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:28,972 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,973 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:28,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:28,973 INFO L82 PathProgramCache]: Analyzing trace with hash -439047730, now seen corresponding path program 1 times [2018-10-10 14:42:28,973 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:28,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:28,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:28,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:28,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:28,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:29,761 WARN L178 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2018-10-10 14:42:30,124 WARN L178 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 22 [2018-10-10 14:42:30,819 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:30,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:30,820 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:42:30,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:30,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:30,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:30,934 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:30,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:31,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:31,030 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-10 14:42:31,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-10 14:42:31,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-10 14:42:31,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:31,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:31,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:42:31,367 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-10-10 14:42:32,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2018-10-10 14:42:32,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 20 [2018-10-10 14:42:32,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-10 14:42:32,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 17 [2018-10-10 14:42:32,496 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-10 14:42:32,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2018-10-10 14:42:32,518 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:32,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-10 14:42:32,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:42:32,551 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:27 [2018-10-10 14:42:32,861 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:32,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:42:32,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 48 [2018-10-10 14:42:32,899 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i_14.bpl [2018-10-10 14:42:32,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-10 14:42:32,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-10 14:42:32,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=2198, Unknown=0, NotChecked=0, Total=2352 [2018-10-10 14:42:32,902 INFO L87 Difference]: Start difference. First operand 262 states and 269 transitions. Second operand 49 states. [2018-10-10 14:42:35,331 WARN L178 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2018-10-10 14:42:35,622 WARN L178 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 77 [2018-10-10 14:42:35,885 WARN L178 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 79 [2018-10-10 14:42:36,119 WARN L178 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 80 [2018-10-10 14:42:36,336 WARN L178 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2018-10-10 14:42:36,519 WARN L178 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 71 [2018-10-10 14:42:36,760 WARN L178 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 76 [2018-10-10 14:42:36,986 WARN L178 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 81 [2018-10-10 14:42:37,303 WARN L178 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 76 [2018-10-10 14:42:37,887 WARN L178 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2018-10-10 14:42:38,403 WARN L178 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 74 [2018-10-10 14:42:39,333 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2018-10-10 14:42:39,594 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2018-10-10 14:42:39,821 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2018-10-10 14:42:40,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:40,200 INFO L93 Difference]: Finished difference Result 293 states and 298 transitions. [2018-10-10 14:42:40,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-10 14:42:40,201 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 127 [2018-10-10 14:42:40,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:40,203 INFO L225 Difference]: With dead ends: 293 [2018-10-10 14:42:40,204 INFO L226 Difference]: Without dead ends: 293 [2018-10-10 14:42:40,207 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1446 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=1160, Invalid=5812, Unknown=0, NotChecked=0, Total=6972 [2018-10-10 14:42:40,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-10-10 14:42:40,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 262. [2018-10-10 14:42:40,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-10-10 14:42:40,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 268 transitions. [2018-10-10 14:42:40,212 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 268 transitions. Word has length 127 [2018-10-10 14:42:40,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:40,213 INFO L481 AbstractCegarLoop]: Abstraction has 262 states and 268 transitions. [2018-10-10 14:42:40,213 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-10 14:42:40,213 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 268 transitions. [2018-10-10 14:42:40,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-10 14:42:40,214 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:40,214 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40,215 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:40,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:40,215 INFO L82 PathProgramCache]: Analyzing trace with hash 825135567, now seen corresponding path program 1 times [2018-10-10 14:42:40,216 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:40,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:40,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:40,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:40,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:40,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:40,833 WARN L178 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-10-10 14:42:41,102 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 10 [2018-10-10 14:42:41,404 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:42:41,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:41,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-10-10 14:42:41,405 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 14:42:41,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 14:42:41,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-10-10 14:42:41,406 INFO L87 Difference]: Start difference. First operand 262 states and 268 transitions. Second operand 16 states. [2018-10-10 14:42:42,710 WARN L178 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2018-10-10 14:42:42,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:42,969 INFO L93 Difference]: Finished difference Result 261 states and 267 transitions. [2018-10-10 14:42:42,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 14:42:42,969 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 131 [2018-10-10 14:42:42,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:42,971 INFO L225 Difference]: With dead ends: 261 [2018-10-10 14:42:42,971 INFO L226 Difference]: Without dead ends: 209 [2018-10-10 14:42:42,971 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=148, Invalid=974, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 14:42:42,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-10-10 14:42:42,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-10-10 14:42:42,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-10-10 14:42:42,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 212 transitions. [2018-10-10 14:42:42,976 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 212 transitions. Word has length 131 [2018-10-10 14:42:42,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:42,976 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 212 transitions. [2018-10-10 14:42:42,976 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 14:42:42,976 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 212 transitions. [2018-10-10 14:42:42,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-10 14:42:42,977 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:42,977 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42,978 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:42,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:42,978 INFO L82 PathProgramCache]: Analyzing trace with hash 955686487, now seen corresponding path program 1 times [2018-10-10 14:42:42,979 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:42,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:42,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:42,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:42,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:42,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:43,273 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:43,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:43,274 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:42:43,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:43,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:43,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:43,532 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 29 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:43,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:42:43,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 22 [2018-10-10 14:42:43,577 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/openbsd_cstrcmp-alloca_true-valid-memsafety_true-termination.i_16.bpl [2018-10-10 14:42:43,578 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-10 14:42:43,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-10 14:42:43,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2018-10-10 14:42:43,579 INFO L87 Difference]: Start difference. First operand 209 states and 212 transitions. Second operand 23 states. [2018-10-10 14:42:44,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:44,480 INFO L93 Difference]: Finished difference Result 207 states and 210 transitions. [2018-10-10 14:42:44,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-10 14:42:44,481 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 143 [2018-10-10 14:42:44,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:44,483 INFO L225 Difference]: With dead ends: 207 [2018-10-10 14:42:44,483 INFO L226 Difference]: Without dead ends: 207 [2018-10-10 14:42:44,484 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=333, Invalid=1149, Unknown=0, NotChecked=0, Total=1482 [2018-10-10 14:42:44,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-10-10 14:42:44,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 193. [2018-10-10 14:42:44,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-10-10 14:42:44,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 195 transitions. [2018-10-10 14:42:44,488 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 195 transitions. Word has length 143 [2018-10-10 14:42:44,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:44,489 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 195 transitions. [2018-10-10 14:42:44,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-10 14:42:44,489 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 195 transitions. [2018-10-10 14:42:44,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-10 14:42:44,490 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:44,490 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,491 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:44,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:44,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1369310563, now seen corresponding path program 1 times [2018-10-10 14:42:44,491 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:44,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:44,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:44,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:44,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:44,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:44,745 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:44,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:44,746 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:42:44,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:44,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:44,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:44,982 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:44,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:44,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:44,989 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:10, output treesize:3 [2018-10-10 14:42:45,398 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:45,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-10 14:42:45,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 24 [2018-10-10 14:42:45,420 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-10 14:42:45,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-10 14:42:45,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2018-10-10 14:42:45,423 INFO L87 Difference]: Start difference. First operand 193 states and 195 transitions. Second operand 25 states. [2018-10-10 14:42:46,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:46,265 INFO L93 Difference]: Finished difference Result 192 states and 194 transitions. [2018-10-10 14:42:46,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-10 14:42:46,266 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 153 [2018-10-10 14:42:46,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:46,268 INFO L225 Difference]: With dead ends: 192 [2018-10-10 14:42:46,268 INFO L226 Difference]: Without dead ends: 173 [2018-10-10 14:42:46,269 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=379, Invalid=1343, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 14:42:46,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-10-10 14:42:46,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-10-10 14:42:46,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-10-10 14:42:46,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 175 transitions. [2018-10-10 14:42:46,273 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 175 transitions. Word has length 153 [2018-10-10 14:42:46,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:46,273 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 175 transitions. [2018-10-10 14:42:46,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-10 14:42:46,273 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 175 transitions. [2018-10-10 14:42:46,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-10 14:42:46,274 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:46,274 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,275 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:46,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:46,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1792418272, now seen corresponding path program 2 times [2018-10-10 14:42:46,275 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:46,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:46,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:46,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:46,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:46,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:48,139 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:48,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:48,139 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:42:48,149 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-10 14:42:48,198 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-10 14:42:48,199 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-10 14:42:48,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:48,273 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:48,273 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:48,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:48,277 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-10 14:42:48,399 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:48,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:48,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:48,407 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-10-10 14:42:48,580 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:48,581 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:48,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-10 14:42:48,582 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:48,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:48,588 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2018-10-10 14:42:48,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-10-10 14:42:48,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:48,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:48,658 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:13 [2018-10-10 14:42:48,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-10 14:42:48,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-10 14:42:48,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:48,916 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:48,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:42:48,928 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-10-10 14:42:49,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-10-10 14:42:49,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-10 14:42:49,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:49,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:49,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:42:49,330 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:31 [2018-10-10 14:42:50,577 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-10 14:42:52,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-10 14:42:52,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-10-10 14:42:52,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-10 14:42:52,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:42:52,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:42:52,548 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:29 [2018-10-10 14:42:52,864 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 25 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:52,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:42:52,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31] total 61 [2018-10-10 14:42:52,885 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-10 14:42:52,889 WARN L205 ceAbstractionStarter]: Timeout [2018-10-10 14:42:52,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 02:42:52 BoogieIcfgContainer [2018-10-10 14:42:52,889 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 14:42:52,890 INFO L168 Benchmark]: Toolchain (without parser) took 47754.68 ms. Allocated memory was 1.6 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: -1.1 GB). Peak memory consumption was 85.9 MB. Max. memory is 7.1 GB. [2018-10-10 14:42:52,891 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:42:52,892 INFO L168 Benchmark]: CACSL2BoogieTranslator took 516.88 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 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:52,892 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.26 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:42:52,893 INFO L168 Benchmark]: Boogie Preprocessor took 62.61 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:42:52,893 INFO L168 Benchmark]: RCFGBuilder took 1072.57 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 749.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -774.2 MB). Peak memory consumption was 16.8 MB. Max. memory is 7.1 GB. [2018-10-10 14:42:52,894 INFO L168 Benchmark]: TraceAbstraction took 46015.86 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 433.1 MB). Free memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: -343.8 MB). Peak memory consumption was 89.2 MB. Max. memory is 7.1 GB. [2018-10-10 14:42:52,897 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 516.88 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 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 82.26 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 62.61 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1072.57 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 749.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -774.2 MB). Peak memory consumption was 16.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 46015.86 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 433.1 MB). Free memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: -343.8 MB). Peak memory consumption was 89.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 18). - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 548). Cancelled while PathProgramDumpController was trying to verify (iteration 18). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 18). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 18). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 18). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 18). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 18). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 18). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 18). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 18). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 18). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 18). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 18). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 18). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 18). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 184 locations, 15 error locations. TIMEOUT Result, 45.9s OverallTime, 18 OverallIterations, 3 TraceHistogramMax, 25.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2481 SDtfs, 18577 SDslu, 15071 SDs, 0 SdLazy, 7820 SolverSat, 302 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 980 GetRequests, 506 SyntacticMatches, 4 SemanticMatches, 470 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3660 ImplicationChecksByTransitivity, 24.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=262occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 411 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 12.5s InterpolantComputationTime, 2149 NumberOfCodeBlocks, 2149 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2128 ConstructedInterpolants, 98 QuantifiedInterpolants, 1774752 SizeOfPredicates, 120 NumberOfNonLiveVariables, 1099 ConjunctsInSsa, 215 ConjunctsInUnsatCore, 21 InterpolantComputations, 14 PerfectInterpolantSequences, 62/158 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Received shutdown request...