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_cstrstr-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c5b1954-m [2018-10-10 14:42:38,834 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 14:42:38,836 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 14:42:38,849 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 14:42:38,849 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 14:42:38,851 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 14:42:38,852 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 14:42:38,854 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 14:42:38,855 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 14:42:38,856 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 14:42:38,857 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 14:42:38,857 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 14:42:38,858 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 14:42:38,860 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 14:42:38,861 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 14:42:38,862 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 14:42:38,862 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 14:42:38,864 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 14:42:38,866 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 14:42:38,868 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 14:42:38,869 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 14:42:38,870 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 14:42:38,876 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 14:42:38,876 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 14:42:38,877 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 14:42:38,878 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 14:42:38,881 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 14:42:38,882 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 14:42:38,883 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 14:42:38,887 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 14:42:38,887 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 14:42:38,890 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 14:42:38,890 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 14:42:38,891 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 14:42:38,891 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 14:42:38,892 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 14:42:38,892 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:38,914 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 14:42:38,915 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 14:42:38,916 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-10 14:42:38,916 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-10 14:42:38,917 INFO L133 SettingsManager]: * Use SBE=true [2018-10-10 14:42:38,917 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-10 14:42:38,917 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-10 14:42:38,917 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-10 14:42:38,917 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-10 14:42:38,918 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-10 14:42:38,918 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-10 14:42:38,918 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-10 14:42:38,918 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-10 14:42:38,918 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-10 14:42:38,919 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-10 14:42:38,920 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-10 14:42:38,920 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 14:42:38,920 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-10 14:42:38,921 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-10 14:42:38,921 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-10 14:42:38,921 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:42:38,921 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 14:42:38,921 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-10 14:42:38,922 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-10 14:42:38,923 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-10 14:42:38,923 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:38,975 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 14:42:38,988 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 14:42:38,991 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 14:42:38,993 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-10 14:42:38,993 INFO L276 PluginConnector]: CDTParser initialized [2018-10-10 14:42:38,994 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:42:39,291 INFO L217 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33e9d6b30/79f4b231626045b6aacc18a24a993fc3/FLAGb88fd9bc7 [2018-10-10 14:42:39,568 INFO L289 CDTParser]: Found 1 translation units. [2018-10-10 14:42:39,572 INFO L157 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-memsafety/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:42:39,592 INFO L337 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33e9d6b30/79f4b231626045b6aacc18a24a993fc3/FLAGb88fd9bc7 [2018-10-10 14:42:39,607 INFO L345 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33e9d6b30/79f4b231626045b6aacc18a24a993fc3 [2018-10-10 14:42:39,616 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 14:42:39,618 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-10 14:42:39,618 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-10 14:42:39,619 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-10 14:42:39,623 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-10 14:42:39,624 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:42:39" (1/1) ... [2018-10-10 14:42:39,627 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9d6d202 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:39, skipping insertion in model container [2018-10-10 14:42:39,627 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:42:39" (1/1) ... [2018-10-10 14:42:39,637 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-10 14:42:39,696 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-10 14:42:39,949 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:42:39,960 INFO L189 MainTranslator]: Completed pre-run [2018-10-10 14:42:40,017 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:42:40,074 INFO L193 MainTranslator]: Completed translation [2018-10-10 14:42:40,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:40 WrapperNode [2018-10-10 14:42:40,075 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-10 14:42:40,076 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-10 14:42:40,076 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-10 14:42:40,076 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-10 14:42:40,087 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:40" (1/1) ... [2018-10-10 14:42:40,106 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:40" (1/1) ... [2018-10-10 14:42:40,146 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-10 14:42:40,147 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 14:42:40,147 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 14:42:40,147 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 14:42:40,157 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:40" (1/1) ... [2018-10-10 14:42:40,158 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:40" (1/1) ... [2018-10-10 14:42:40,163 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:40" (1/1) ... [2018-10-10 14:42:40,163 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:40" (1/1) ... [2018-10-10 14:42:40,173 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:40" (1/1) ... [2018-10-10 14:42:40,180 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:40" (1/1) ... [2018-10-10 14:42:40,183 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:40" (1/1) ... [2018-10-10 14:42:40,262 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 14:42:40,263 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 14:42:40,263 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 14:42:40,263 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 14:42:40,264 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:40" (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:40,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 14:42:40,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 14:42:41,592 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 14:42:41,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:42:41 BoogieIcfgContainer [2018-10-10 14:42:41,593 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 14:42:41,594 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 14:42:41,594 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 14:42:41,597 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 14:42:41,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 02:42:39" (1/3) ... [2018-10-10 14:42:41,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75da941d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:42:41, skipping insertion in model container [2018-10-10 14:42:41,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:40" (2/3) ... [2018-10-10 14:42:41,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75da941d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:42:41, skipping insertion in model container [2018-10-10 14:42:41,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:42:41" (3/3) ... [2018-10-10 14:42:41,601 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:42:41,611 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-10 14:42:41,620 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-10-10 14:42:41,637 INFO L257 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2018-10-10 14:42:41,665 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 14:42:41,666 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 14:42:41,666 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 14:42:41,666 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-10 14:42:41,666 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 14:42:41,667 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 14:42:41,667 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 14:42:41,667 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 14:42:41,667 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 14:42:41,692 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states. [2018-10-10 14:42:41,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-10 14:42:41,702 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:41,703 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:41,706 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:41,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:41,712 INFO L82 PathProgramCache]: Analyzing trace with hash 989039711, now seen corresponding path program 1 times [2018-10-10 14:42:41,714 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:41,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:41,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:41,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:41,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:41,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:42,157 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:42,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:42,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:42:42,164 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:42:42,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:42:42,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:42:42,181 INFO L87 Difference]: Start difference. First operand 285 states. Second operand 8 states. [2018-10-10 14:42:43,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:43,319 INFO L93 Difference]: Finished difference Result 284 states and 294 transitions. [2018-10-10 14:42:43,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:42:43,322 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-10-10 14:42:43,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:43,337 INFO L225 Difference]: With dead ends: 284 [2018-10-10 14:42:43,337 INFO L226 Difference]: Without dead ends: 279 [2018-10-10 14:42:43,339 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:42:43,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-10-10 14:42:43,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2018-10-10 14:42:43,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-10-10 14:42:43,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 289 transitions. [2018-10-10 14:42:43,398 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 289 transitions. Word has length 46 [2018-10-10 14:42:43,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:43,399 INFO L481 AbstractCegarLoop]: Abstraction has 279 states and 289 transitions. [2018-10-10 14:42:43,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:42:43,400 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 289 transitions. [2018-10-10 14:42:43,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-10 14:42:43,401 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:43,401 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:43,402 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:43,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:43,403 INFO L82 PathProgramCache]: Analyzing trace with hash 595460060, now seen corresponding path program 1 times [2018-10-10 14:42:43,403 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:43,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:43,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:43,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:43,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:43,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:43,950 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:43,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:43,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-10 14:42:43,952 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 14:42:43,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 14:42:43,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:42:43,954 INFO L87 Difference]: Start difference. First operand 279 states and 289 transitions. Second operand 13 states. [2018-10-10 14:42:45,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:45,283 INFO L93 Difference]: Finished difference Result 278 states and 288 transitions. [2018-10-10 14:42:45,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 14:42:45,289 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2018-10-10 14:42:45,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:45,292 INFO L225 Difference]: With dead ends: 278 [2018-10-10 14:42:45,293 INFO L226 Difference]: Without dead ends: 278 [2018-10-10 14:42:45,297 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:45,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-10-10 14:42:45,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2018-10-10 14:42:45,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-10-10 14:42:45,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 288 transitions. [2018-10-10 14:42:45,329 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 288 transitions. Word has length 47 [2018-10-10 14:42:45,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:45,330 INFO L481 AbstractCegarLoop]: Abstraction has 278 states and 288 transitions. [2018-10-10 14:42:45,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 14:42:45,330 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 288 transitions. [2018-10-10 14:42:45,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-10 14:42:45,333 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:45,333 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:45,334 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:45,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:45,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1452289403, now seen corresponding path program 1 times [2018-10-10 14:42:45,335 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:45,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:45,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:45,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:45,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:45,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:45,442 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:45,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:45,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:42:45,443 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:42:45,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:42:45,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:42:45,444 INFO L87 Difference]: Start difference. First operand 278 states and 288 transitions. Second operand 6 states. [2018-10-10 14:42:45,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:45,732 INFO L93 Difference]: Finished difference Result 277 states and 287 transitions. [2018-10-10 14:42:45,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 14:42:45,733 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-10-10 14:42:45,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:45,735 INFO L225 Difference]: With dead ends: 277 [2018-10-10 14:42:45,736 INFO L226 Difference]: Without dead ends: 277 [2018-10-10 14:42:45,737 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:45,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-10-10 14:42:45,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2018-10-10 14:42:45,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-10-10 14:42:45,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 287 transitions. [2018-10-10 14:42:45,753 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 287 transitions. Word has length 56 [2018-10-10 14:42:45,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:45,754 INFO L481 AbstractCegarLoop]: Abstraction has 277 states and 287 transitions. [2018-10-10 14:42:45,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:42:45,754 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 287 transitions. [2018-10-10 14:42:45,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-10 14:42:45,757 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:45,757 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:45,761 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:45,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:45,761 INFO L82 PathProgramCache]: Analyzing trace with hash -2071298430, now seen corresponding path program 1 times [2018-10-10 14:42:45,762 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:45,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:45,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:45,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:45,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:45,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:46,077 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:46,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:46,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:42:46,078 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:42:46,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:42:46,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:42:46,079 INFO L87 Difference]: Start difference. First operand 277 states and 287 transitions. Second operand 9 states. [2018-10-10 14:42:46,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:46,506 INFO L93 Difference]: Finished difference Result 276 states and 286 transitions. [2018-10-10 14:42:46,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:42:46,506 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2018-10-10 14:42:46,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:46,508 INFO L225 Difference]: With dead ends: 276 [2018-10-10 14:42:46,508 INFO L226 Difference]: Without dead ends: 276 [2018-10-10 14:42:46,509 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:46,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-10-10 14:42:46,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2018-10-10 14:42:46,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-10-10 14:42:46,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 286 transitions. [2018-10-10 14:42:46,519 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 286 transitions. Word has length 57 [2018-10-10 14:42:46,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:46,520 INFO L481 AbstractCegarLoop]: Abstraction has 276 states and 286 transitions. [2018-10-10 14:42:46,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:42:46,520 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 286 transitions. [2018-10-10 14:42:46,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-10 14:42:46,521 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:46,522 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:46,522 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:46,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:46,523 INFO L82 PathProgramCache]: Analyzing trace with hash 73415376, now seen corresponding path program 1 times [2018-10-10 14:42:46,523 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:46,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:46,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:46,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:46,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:46,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:46,671 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:46,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:46,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:42:46,673 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:42:46,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:42:46,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:42:46,673 INFO L87 Difference]: Start difference. First operand 276 states and 286 transitions. Second operand 9 states. [2018-10-10 14:42:47,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:47,133 INFO L93 Difference]: Finished difference Result 275 states and 285 transitions. [2018-10-10 14:42:47,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:42:47,134 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 76 [2018-10-10 14:42:47,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:47,137 INFO L225 Difference]: With dead ends: 275 [2018-10-10 14:42:47,137 INFO L226 Difference]: Without dead ends: 275 [2018-10-10 14:42:47,137 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2018-10-10 14:42:47,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-10-10 14:42:47,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2018-10-10 14:42:47,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-10-10 14:42:47,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 285 transitions. [2018-10-10 14:42:47,145 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 285 transitions. Word has length 76 [2018-10-10 14:42:47,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:47,148 INFO L481 AbstractCegarLoop]: Abstraction has 275 states and 285 transitions. [2018-10-10 14:42:47,148 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:42:47,148 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 285 transitions. [2018-10-10 14:42:47,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-10 14:42:47,150 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:47,150 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:47,151 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:47,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:47,151 INFO L82 PathProgramCache]: Analyzing trace with hash -2019090515, now seen corresponding path program 1 times [2018-10-10 14:42:47,151 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:47,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:47,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:47,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:47,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:47,362 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:47,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:47,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-10 14:42:47,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 14:42:47,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 14:42:47,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:42:47,364 INFO L87 Difference]: Start difference. First operand 275 states and 285 transitions. Second operand 12 states. [2018-10-10 14:42:47,749 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-10-10 14:42:48,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:48,195 INFO L93 Difference]: Finished difference Result 298 states and 307 transitions. [2018-10-10 14:42:48,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 14:42:48,196 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 77 [2018-10-10 14:42:48,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:48,198 INFO L225 Difference]: With dead ends: 298 [2018-10-10 14:42:48,198 INFO L226 Difference]: Without dead ends: 298 [2018-10-10 14:42:48,199 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=194, Invalid=406, Unknown=0, NotChecked=0, Total=600 [2018-10-10 14:42:48,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-10-10 14:42:48,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 274. [2018-10-10 14:42:48,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-10-10 14:42:48,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 284 transitions. [2018-10-10 14:42:48,206 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 284 transitions. Word has length 77 [2018-10-10 14:42:48,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:48,206 INFO L481 AbstractCegarLoop]: Abstraction has 274 states and 284 transitions. [2018-10-10 14:42:48,207 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 14:42:48,207 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 284 transitions. [2018-10-10 14:42:48,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-10 14:42:48,208 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:48,209 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] [2018-10-10 14:42:48,210 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:48,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:48,210 INFO L82 PathProgramCache]: Analyzing trace with hash -534017732, now seen corresponding path program 1 times [2018-10-10 14:42:48,210 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:48,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:48,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:48,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:48,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:48,424 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:48,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:48,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-10 14:42:48,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 14:42:48,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 14:42:48,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:42:48,426 INFO L87 Difference]: Start difference. First operand 274 states and 284 transitions. Second operand 12 states. [2018-10-10 14:42:49,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:49,490 INFO L93 Difference]: Finished difference Result 282 states and 292 transitions. [2018-10-10 14:42:49,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-10 14:42:49,490 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2018-10-10 14:42:49,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:49,492 INFO L225 Difference]: With dead ends: 282 [2018-10-10 14:42:49,493 INFO L226 Difference]: Without dead ends: 282 [2018-10-10 14:42:49,493 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=355, Unknown=0, NotChecked=0, Total=506 [2018-10-10 14:42:49,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-10-10 14:42:49,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 273. [2018-10-10 14:42:49,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-10-10 14:42:49,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 283 transitions. [2018-10-10 14:42:49,499 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 283 transitions. Word has length 98 [2018-10-10 14:42:49,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:49,499 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 283 transitions. [2018-10-10 14:42:49,499 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 14:42:49,499 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 283 transitions. [2018-10-10 14:42:49,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-10 14:42:49,501 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:49,501 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] [2018-10-10 14:42:49,502 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:49,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:49,503 INFO L82 PathProgramCache]: Analyzing trace with hash 625319646, now seen corresponding path program 1 times [2018-10-10 14:42:49,503 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:49,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:49,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:49,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:49,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:49,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:50,610 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:50,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:50,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-10-10 14:42:50,611 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-10 14:42:50,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-10 14:42:50,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=457, Unknown=0, NotChecked=0, Total=506 [2018-10-10 14:42:50,612 INFO L87 Difference]: Start difference. First operand 273 states and 283 transitions. Second operand 23 states. [2018-10-10 14:42:51,265 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-10-10 14:42:52,342 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2018-10-10 14:42:52,525 WARN L178 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2018-10-10 14:42:52,709 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2018-10-10 14:42:54,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:54,363 INFO L93 Difference]: Finished difference Result 477 states and 493 transitions. [2018-10-10 14:42:54,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-10 14:42:54,364 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 99 [2018-10-10 14:42:54,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:54,366 INFO L225 Difference]: With dead ends: 477 [2018-10-10 14:42:54,367 INFO L226 Difference]: Without dead ends: 477 [2018-10-10 14:42:54,368 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=612, Invalid=1740, Unknown=0, NotChecked=0, Total=2352 [2018-10-10 14:42:54,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2018-10-10 14:42:54,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 278. [2018-10-10 14:42:54,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-10-10 14:42:54,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 288 transitions. [2018-10-10 14:42:54,375 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 288 transitions. Word has length 99 [2018-10-10 14:42:54,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:54,376 INFO L481 AbstractCegarLoop]: Abstraction has 278 states and 288 transitions. [2018-10-10 14:42:54,376 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-10 14:42:54,376 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 288 transitions. [2018-10-10 14:42:54,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-10 14:42:54,377 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:54,377 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] [2018-10-10 14:42:54,378 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:54,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:54,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1018631836, now seen corresponding path program 1 times [2018-10-10 14:42:54,379 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:54,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:54,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:54,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:54,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:55,064 WARN L178 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-10-10 14:42:55,343 WARN L178 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 10 [2018-10-10 14:42:55,987 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 6 [2018-10-10 14:42:56,161 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:56,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:56,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-10-10 14:42:56,162 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 14:42:56,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 14:42:56,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-10-10 14:42:56,163 INFO L87 Difference]: Start difference. First operand 278 states and 288 transitions. Second operand 16 states. [2018-10-10 14:42:57,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:57,292 INFO L93 Difference]: Finished difference Result 277 states and 287 transitions. [2018-10-10 14:42:57,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 14:42:57,293 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 107 [2018-10-10 14:42:57,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:57,294 INFO L225 Difference]: With dead ends: 277 [2018-10-10 14:42:57,294 INFO L226 Difference]: Without dead ends: 248 [2018-10-10 14:42:57,295 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:57,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-10-10 14:42:57,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2018-10-10 14:42:57,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-10-10 14:42:57,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 256 transitions. [2018-10-10 14:42:57,300 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 256 transitions. Word has length 107 [2018-10-10 14:42:57,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:57,300 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 256 transitions. [2018-10-10 14:42:57,300 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 14:42:57,300 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 256 transitions. [2018-10-10 14:42:57,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-10 14:42:57,301 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:57,302 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:57,302 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:57,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:57,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1412671601, now seen corresponding path program 1 times [2018-10-10 14:42:57,303 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:57,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:57,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:57,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:57,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:58,366 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:58,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:58,366 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:58,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:58,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:58,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:58,577 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:58,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:58,707 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:58,707 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-10-10 14:42:59,541 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-10 14:42:59,585 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:59,603 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:59,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:59,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:59,649 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:59,650 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:29 [2018-10-10 14:43:00,755 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:43:00,765 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:43:00,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-10 14:43:00,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:43:00,788 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:43:00,788 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:33 [2018-10-10 14:43:01,164 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:43:01,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:43:01,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 39 [2018-10-10 14:43:01,273 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_10.bpl [2018-10-10 14:43:01,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-10 14:43:01,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-10 14:43:01,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1458, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 14:43:01,282 INFO L87 Difference]: Start difference. First operand 248 states and 256 transitions. Second operand 40 states. [2018-10-10 14:43:02,583 WARN L178 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2018-10-10 14:43:02,983 WARN L178 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2018-10-10 14:43:03,263 WARN L178 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 74 [2018-10-10 14:43:03,545 WARN L178 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 82 [2018-10-10 14:43:03,864 WARN L178 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2018-10-10 14:43:04,177 WARN L178 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 85 [2018-10-10 14:43:04,538 WARN L178 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 101 [2018-10-10 14:43:05,148 WARN L178 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 117 [2018-10-10 14:43:05,828 WARN L178 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 132 [2018-10-10 14:43:06,454 WARN L178 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 132 [2018-10-10 14:43:07,165 WARN L178 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 137 [2018-10-10 14:43:07,775 WARN L178 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 140 [2018-10-10 14:43:08,288 WARN L178 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 129 [2018-10-10 14:43:08,738 WARN L178 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 114 [2018-10-10 14:43:09,255 WARN L178 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 121 [2018-10-10 14:43:09,778 WARN L178 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 123 [2018-10-10 14:43:10,311 WARN L178 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 126 [2018-10-10 14:43:10,976 WARN L178 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 131 [2018-10-10 14:43:11,495 WARN L178 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 123 [2018-10-10 14:43:11,914 WARN L178 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 118 [2018-10-10 14:43:12,436 WARN L178 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 122 [2018-10-10 14:43:12,921 WARN L178 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 120 [2018-10-10 14:43:14,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:14,348 INFO L93 Difference]: Finished difference Result 417 states and 431 transitions. [2018-10-10 14:43:14,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-10 14:43:14,348 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 115 [2018-10-10 14:43:14,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:14,351 INFO L225 Difference]: With dead ends: 417 [2018-10-10 14:43:14,351 INFO L226 Difference]: Without dead ends: 417 [2018-10-10 14:43:14,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 96 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=905, Invalid=3517, Unknown=0, NotChecked=0, Total=4422 [2018-10-10 14:43:14,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-10-10 14:43:14,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 242. [2018-10-10 14:43:14,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-10-10 14:43:14,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 250 transitions. [2018-10-10 14:43:14,360 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 250 transitions. Word has length 115 [2018-10-10 14:43:14,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:14,360 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 250 transitions. [2018-10-10 14:43:14,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-10 14:43:14,360 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 250 transitions. [2018-10-10 14:43:14,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-10 14:43:14,362 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:14,362 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] [2018-10-10 14:43:14,362 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:14,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:14,363 INFO L82 PathProgramCache]: Analyzing trace with hash 63509069, now seen corresponding path program 1 times [2018-10-10 14:43:14,363 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:14,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:14,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:14,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:14,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:14,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:14,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:14,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:14,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:43:14,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:43:14,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:43:14,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:43:14,551 INFO L87 Difference]: Start difference. First operand 242 states and 250 transitions. Second operand 9 states. [2018-10-10 14:43:15,386 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-10 14:43:15,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:15,651 INFO L93 Difference]: Finished difference Result 241 states and 249 transitions. [2018-10-10 14:43:15,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 14:43:15,651 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 119 [2018-10-10 14:43:15,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:15,653 INFO L225 Difference]: With dead ends: 241 [2018-10-10 14:43:15,653 INFO L226 Difference]: Without dead ends: 241 [2018-10-10 14:43:15,653 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:43:15,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-10-10 14:43:15,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2018-10-10 14:43:15,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-10-10 14:43:15,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 249 transitions. [2018-10-10 14:43:15,658 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 249 transitions. Word has length 119 [2018-10-10 14:43:15,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:15,659 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 249 transitions. [2018-10-10 14:43:15,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:43:15,659 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 249 transitions. [2018-10-10 14:43:15,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-10 14:43:15,660 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:15,660 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:43:15,661 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:15,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:15,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1968781335, now seen corresponding path program 1 times [2018-10-10 14:43:15,662 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:15,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:15,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:15,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:15,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:16,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:16,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:16,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-10 14:43:16,005 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 14:43:16,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 14:43:16,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:43:16,006 INFO L87 Difference]: Start difference. First operand 241 states and 249 transitions. Second operand 12 states. [2018-10-10 14:43:16,927 WARN L178 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-10-10 14:43:17,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:17,179 INFO L93 Difference]: Finished difference Result 283 states and 293 transitions. [2018-10-10 14:43:17,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-10 14:43:17,179 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 120 [2018-10-10 14:43:17,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:17,181 INFO L225 Difference]: With dead ends: 283 [2018-10-10 14:43:17,181 INFO L226 Difference]: Without dead ends: 283 [2018-10-10 14:43:17,182 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=153, Invalid=399, Unknown=0, NotChecked=0, Total=552 [2018-10-10 14:43:17,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-10-10 14:43:17,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 249. [2018-10-10 14:43:17,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-10-10 14:43:17,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 257 transitions. [2018-10-10 14:43:17,187 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 257 transitions. Word has length 120 [2018-10-10 14:43:17,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:17,187 INFO L481 AbstractCegarLoop]: Abstraction has 249 states and 257 transitions. [2018-10-10 14:43:17,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 14:43:17,187 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 257 transitions. [2018-10-10 14:43:17,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-10 14:43:17,189 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:17,189 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:43:17,190 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:17,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:17,190 INFO L82 PathProgramCache]: Analyzing trace with hash 787162152, now seen corresponding path program 1 times [2018-10-10 14:43:17,190 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:17,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:17,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:17,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:17,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:17,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:18,695 WARN L178 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 24 [2018-10-10 14:43:19,255 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:19,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:43:19,256 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:43:19,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:19,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:19,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:43:19,520 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:43:19,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:19,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:19,524 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-10 14:43:19,703 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:43:19,704 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:43:19,705 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:43:19,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:19,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:19,711 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-10-10 14:43:20,094 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:43:20,096 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:43:20,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:20,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:20,109 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:43:20,110 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-10-10 14:43:20,341 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:43:20,344 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:43:20,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:20,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:20,364 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:43:20,364 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:36, output treesize:21 [2018-10-10 14:43:20,919 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:43:20,933 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:43:20,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-10 14:43:20,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:43:20,960 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:43:20,960 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:27 [2018-10-10 14:43:21,575 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:21,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:43:21,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 54 [2018-10-10 14:43:21,621 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/openbsd_cstrstr-alloca_true-valid-memsafety_true-termination.i_13.bpl [2018-10-10 14:43:21,623 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-10 14:43:21,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-10 14:43:21,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=2804, Unknown=0, NotChecked=0, Total=2970 [2018-10-10 14:43:21,625 INFO L87 Difference]: Start difference. First operand 249 states and 257 transitions. Second operand 55 states. [2018-10-10 14:43:22,804 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2018-10-10 14:43:23,014 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2018-10-10 14:43:23,179 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2018-10-10 14:43:24,188 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 83 [2018-10-10 14:43:24,366 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 78 [2018-10-10 14:43:24,557 WARN L178 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 83 [2018-10-10 14:43:24,868 WARN L178 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 89 [2018-10-10 14:43:25,135 WARN L178 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 92 [2018-10-10 14:43:25,425 WARN L178 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 95 [2018-10-10 14:43:25,638 WARN L178 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 86 [2018-10-10 14:43:25,799 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 80 [2018-10-10 14:43:26,050 WARN L178 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 85 [2018-10-10 14:43:26,242 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 68 [2018-10-10 14:43:26,424 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2018-10-10 14:43:26,874 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2018-10-10 14:43:27,619 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 73 [2018-10-10 14:43:27,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:27,707 INFO L93 Difference]: Finished difference Result 417 states and 432 transitions. [2018-10-10 14:43:27,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-10 14:43:27,708 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 138 [2018-10-10 14:43:27,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:27,711 INFO L225 Difference]: With dead ends: 417 [2018-10-10 14:43:27,711 INFO L226 Difference]: Without dead ends: 417 [2018-10-10 14:43:27,714 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1407 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=1188, Invalid=6122, Unknown=0, NotChecked=0, Total=7310 [2018-10-10 14:43:27,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-10-10 14:43:27,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 361. [2018-10-10 14:43:27,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-10-10 14:43:27,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 384 transitions. [2018-10-10 14:43:27,721 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 384 transitions. Word has length 138 [2018-10-10 14:43:27,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:27,721 INFO L481 AbstractCegarLoop]: Abstraction has 361 states and 384 transitions. [2018-10-10 14:43:27,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-10 14:43:27,721 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 384 transitions. [2018-10-10 14:43:27,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-10 14:43:27,722 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:27,723 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:43:27,723 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:27,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:27,724 INFO L82 PathProgramCache]: Analyzing trace with hash -710434462, now seen corresponding path program 1 times [2018-10-10 14:43:27,724 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:27,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:27,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:27,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:27,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:27,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:27,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:27,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:27,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-10 14:43:27,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 14:43:27,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 14:43:27,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:43:27,964 INFO L87 Difference]: Start difference. First operand 361 states and 384 transitions. Second operand 11 states. [2018-10-10 14:43:28,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:28,563 INFO L93 Difference]: Finished difference Result 553 states and 586 transitions. [2018-10-10 14:43:28,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-10 14:43:28,563 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 143 [2018-10-10 14:43:28,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:28,566 INFO L225 Difference]: With dead ends: 553 [2018-10-10 14:43:28,566 INFO L226 Difference]: Without dead ends: 553 [2018-10-10 14:43:28,567 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2018-10-10 14:43:28,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2018-10-10 14:43:28,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 421. [2018-10-10 14:43:28,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-10-10 14:43:28,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 452 transitions. [2018-10-10 14:43:28,576 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 452 transitions. Word has length 143 [2018-10-10 14:43:28,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:28,577 INFO L481 AbstractCegarLoop]: Abstraction has 421 states and 452 transitions. [2018-10-10 14:43:28,577 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 14:43:28,577 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 452 transitions. [2018-10-10 14:43:28,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-10 14:43:28,578 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:28,578 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:43:28,578 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:28,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:28,579 INFO L82 PathProgramCache]: Analyzing trace with hash -548631597, now seen corresponding path program 1 times [2018-10-10 14:43:28,579 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:28,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:28,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:28,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:28,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:28,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:28,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:28,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:28,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:43:28,747 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:43:28,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:43:28,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:43:28,748 INFO L87 Difference]: Start difference. First operand 421 states and 452 transitions. Second operand 8 states. [2018-10-10 14:43:29,186 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-10 14:43:29,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:29,452 INFO L93 Difference]: Finished difference Result 547 states and 582 transitions. [2018-10-10 14:43:29,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 14:43:29,453 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 144 [2018-10-10 14:43:29,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:29,458 INFO L225 Difference]: With dead ends: 547 [2018-10-10 14:43:29,459 INFO L226 Difference]: Without dead ends: 547 [2018-10-10 14:43:29,459 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:43:29,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2018-10-10 14:43:29,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 513. [2018-10-10 14:43:29,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-10-10 14:43:29,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 548 transitions. [2018-10-10 14:43:29,474 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 548 transitions. Word has length 144 [2018-10-10 14:43:29,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:29,474 INFO L481 AbstractCegarLoop]: Abstraction has 513 states and 548 transitions. [2018-10-10 14:43:29,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:43:29,474 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 548 transitions. [2018-10-10 14:43:29,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-10 14:43:29,475 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:29,476 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:43:29,476 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:29,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:29,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1062564359, now seen corresponding path program 2 times [2018-10-10 14:43:29,477 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:29,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:29,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:29,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:29,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:29,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:30,296 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-10 14:43:30,518 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2018-10-10 14:43:32,198 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:32,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:43:32,199 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:43:32,208 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-10 14:43:32,269 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-10 14:43:32,269 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-10 14:43:32,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:43:32,312 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:43:32,313 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:32,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:32,341 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-10 14:43:32,407 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:43:32,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:32,415 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:43:32,416 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-10-10 14:43:32,601 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:43:32,602 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:43:32,603 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:43:32,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:32,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:32,609 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2018-10-10 14:43:32,661 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:43:32,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:32,684 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:43:32,684 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:13 [2018-10-10 14:43:32,945 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:43:32,947 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:43:32,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:32,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:32,959 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:43:32,959 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-10-10 14:43:33,352 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:43:33,356 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:43:33,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:33,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:33,376 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:43:33,377 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:31 [2018-10-10 14:43:34,766 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-10 14:43:36,119 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:43:36,136 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:43:36,137 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-10 14:43:36,146 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:43:36,166 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:43:36,167 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:29 [2018-10-10 14:43:36,701 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:36,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:43:36,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 35] total 64 [2018-10-10 14:43:36,724 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-10 14:43:36,730 WARN L205 ceAbstractionStarter]: Timeout [2018-10-10 14:43:36,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 02:43:36 BoogieIcfgContainer [2018-10-10 14:43:36,730 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 14:43:36,731 INFO L168 Benchmark]: Toolchain (without parser) took 57114.35 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -587.8 MB). Peak memory consumption was 606.0 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:36,732 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:43:36,733 INFO L168 Benchmark]: CACSL2BoogieTranslator took 457.17 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:36,733 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.60 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:43:36,734 INFO L168 Benchmark]: Boogie Preprocessor took 115.29 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 746.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -840.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:36,734 INFO L168 Benchmark]: RCFGBuilder took 1330.22 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 81.0 MB). Peak memory consumption was 81.0 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:36,735 INFO L168 Benchmark]: TraceAbstraction took 55136.59 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 447.2 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 150.2 MB). Peak memory consumption was 597.4 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:36,739 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 457.17 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.60 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 115.29 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 746.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -840.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1330.22 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 81.0 MB). Peak memory consumption was 81.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 55136.59 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 447.2 MB). Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 150.2 MB). Peak memory consumption was 597.4 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 16). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 16). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 16). - TimeoutResultAtElement [Line: 578]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 578). Cancelled while PathProgramDumpController was trying to verify (iteration 16). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 16). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 16). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 16). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 16). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 16). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 16). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 16). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 16). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 16). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 16). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 16). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 16). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 16). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 16). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 16). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 16). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 16). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 285 locations, 21 error locations. TIMEOUT Result, 55.0s OverallTime, 16 OverallIterations, 3 TraceHistogramMax, 33.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3484 SDtfs, 35019 SDslu, 18491 SDs, 0 SdLazy, 7928 SolverSat, 287 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 633 GetRequests, 229 SyntacticMatches, 3 SemanticMatches, 401 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2467 ImplicationChecksByTransitivity, 31.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=513occurred in iteration=15, 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, 15 MinimizatonAttempts, 663 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 13.2s InterpolantComputationTime, 1695 NumberOfCodeBlocks, 1695 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1678 ConstructedInterpolants, 115 QuantifiedInterpolants, 1644895 SizeOfPredicates, 72 NumberOfNonLiveVariables, 503 ConjunctsInSsa, 129 ConjunctsInUnsatCore, 17 InterpolantComputations, 13 PerfectInterpolantSequences, 0/24 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Received shutdown request...