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_cstrlcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c5b1954-m [2018-10-10 14:42:12,745 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 14:42:12,747 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 14:42:12,760 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 14:42:12,760 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 14:42:12,761 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 14:42:12,763 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 14:42:12,765 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 14:42:12,766 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 14:42:12,767 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 14:42:12,768 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 14:42:12,769 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 14:42:12,770 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 14:42:12,771 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 14:42:12,772 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 14:42:12,773 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 14:42:12,774 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 14:42:12,776 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 14:42:12,778 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 14:42:12,780 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 14:42:12,781 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 14:42:12,782 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 14:42:12,785 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 14:42:12,785 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 14:42:12,786 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 14:42:12,790 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 14:42:12,791 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 14:42:12,794 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 14:42:12,795 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 14:42:12,796 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 14:42:12,796 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 14:42:12,799 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 14:42:12,799 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 14:42:12,799 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 14:42:12,802 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 14:42:12,803 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 14:42:12,805 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:12,834 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 14:42:12,835 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 14:42:12,837 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-10 14:42:12,837 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-10 14:42:12,837 INFO L133 SettingsManager]: * Use SBE=true [2018-10-10 14:42:12,837 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-10 14:42:12,838 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-10 14:42:12,840 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-10 14:42:12,841 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-10 14:42:12,841 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-10 14:42:12,841 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-10 14:42:12,841 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-10 14:42:12,841 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-10 14:42:12,842 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-10 14:42:12,842 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-10 14:42:12,842 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-10 14:42:12,843 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 14:42:12,843 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-10 14:42:12,843 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-10 14:42:12,843 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-10 14:42:12,843 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:42:12,844 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 14:42:12,844 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-10 14:42:12,844 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-10 14:42:12,844 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-10 14:42:12,844 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:12,915 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 14:42:12,933 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 14:42:12,937 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 14:42:12,938 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-10 14:42:12,939 INFO L276 PluginConnector]: CDTParser initialized [2018-10-10 14:42:12,939 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:42:13,264 INFO L217 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb491ad74/89dcc25c2aa040909690aec74ada64f1/FLAG7df7697c8 [2018-10-10 14:42:13,496 INFO L289 CDTParser]: Found 1 translation units. [2018-10-10 14:42:13,497 INFO L157 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:42:13,517 INFO L337 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb491ad74/89dcc25c2aa040909690aec74ada64f1/FLAG7df7697c8 [2018-10-10 14:42:13,537 INFO L345 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb491ad74/89dcc25c2aa040909690aec74ada64f1 [2018-10-10 14:42:13,547 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 14:42:13,549 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-10 14:42:13,550 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-10 14:42:13,550 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-10 14:42:13,554 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-10 14:42:13,555 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:42:13" (1/1) ... [2018-10-10 14:42:13,558 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d7bbae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:13, skipping insertion in model container [2018-10-10 14:42:13,558 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:42:13" (1/1) ... [2018-10-10 14:42:13,569 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-10 14:42:13,634 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-10 14:42:13,889 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:42:13,899 INFO L189 MainTranslator]: Completed pre-run [2018-10-10 14:42:13,954 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:42:14,015 INFO L193 MainTranslator]: Completed translation [2018-10-10 14:42:14,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:14 WrapperNode [2018-10-10 14:42:14,016 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-10 14:42:14,017 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-10 14:42:14,017 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-10 14:42:14,017 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-10 14:42:14,028 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:14" (1/1) ... [2018-10-10 14:42:14,047 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:14" (1/1) ... [2018-10-10 14:42:14,079 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-10 14:42:14,080 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 14:42:14,080 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 14:42:14,080 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 14:42:14,089 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:14" (1/1) ... [2018-10-10 14:42:14,089 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:14" (1/1) ... [2018-10-10 14:42:14,094 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:14" (1/1) ... [2018-10-10 14:42:14,094 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:14" (1/1) ... [2018-10-10 14:42:14,103 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:14" (1/1) ... [2018-10-10 14:42:14,109 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:14" (1/1) ... [2018-10-10 14:42:14,111 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:14" (1/1) ... [2018-10-10 14:42:14,115 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 14:42:14,115 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 14:42:14,115 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 14:42:14,116 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 14:42:14,117 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:14" (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:14,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 14:42:14,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 14:42:15,236 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 14:42:15,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:42:15 BoogieIcfgContainer [2018-10-10 14:42:15,237 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 14:42:15,239 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 14:42:15,239 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 14:42:15,242 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 14:42:15,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 02:42:13" (1/3) ... [2018-10-10 14:42:15,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ed11cc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:42:15, skipping insertion in model container [2018-10-10 14:42:15,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:14" (2/3) ... [2018-10-10 14:42:15,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ed11cc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:42:15, skipping insertion in model container [2018-10-10 14:42:15,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:42:15" (3/3) ... [2018-10-10 14:42:15,247 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:42:15,257 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-10 14:42:15,266 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-10-10 14:42:15,284 INFO L257 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2018-10-10 14:42:15,313 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 14:42:15,314 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 14:42:15,314 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 14:42:15,314 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-10 14:42:15,314 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 14:42:15,315 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 14:42:15,315 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 14:42:15,315 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 14:42:15,315 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 14:42:15,343 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states. [2018-10-10 14:42:15,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-10 14:42:15,352 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:15,353 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:15,356 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:15,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:15,363 INFO L82 PathProgramCache]: Analyzing trace with hash 989039711, now seen corresponding path program 1 times [2018-10-10 14:42:15,365 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:15,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:15,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:15,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:15,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:15,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:15,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:15,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:15,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:42:15,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:42:15,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:42:15,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:42:15,920 INFO L87 Difference]: Start difference. First operand 180 states. Second operand 8 states. [2018-10-10 14:42:16,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:16,814 INFO L93 Difference]: Finished difference Result 179 states and 186 transitions. [2018-10-10 14:42:16,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:42:16,816 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-10-10 14:42:16,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:16,830 INFO L225 Difference]: With dead ends: 179 [2018-10-10 14:42:16,830 INFO L226 Difference]: Without dead ends: 174 [2018-10-10 14:42:16,832 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:16,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-10-10 14:42:16,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-10-10 14:42:16,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-10-10 14:42:16,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 181 transitions. [2018-10-10 14:42:16,879 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 181 transitions. Word has length 46 [2018-10-10 14:42:16,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:16,880 INFO L481 AbstractCegarLoop]: Abstraction has 174 states and 181 transitions. [2018-10-10 14:42:16,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:42:16,880 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 181 transitions. [2018-10-10 14:42:16,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-10 14:42:16,882 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:16,882 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:16,883 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:16,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:16,883 INFO L82 PathProgramCache]: Analyzing trace with hash 595460060, now seen corresponding path program 1 times [2018-10-10 14:42:16,883 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:16,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:16,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:16,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:16,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:16,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:17,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:17,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:17,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-10 14:42:17,362 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 14:42:17,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 14:42:17,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:42:17,363 INFO L87 Difference]: Start difference. First operand 174 states and 181 transitions. Second operand 13 states. [2018-10-10 14:42:18,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:18,455 INFO L93 Difference]: Finished difference Result 173 states and 180 transitions. [2018-10-10 14:42:18,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 14:42:18,456 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2018-10-10 14:42:18,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:18,458 INFO L225 Difference]: With dead ends: 173 [2018-10-10 14:42:18,458 INFO L226 Difference]: Without dead ends: 173 [2018-10-10 14:42:18,459 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2018-10-10 14:42:18,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-10-10 14:42:18,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-10-10 14:42:18,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-10-10 14:42:18,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 180 transitions. [2018-10-10 14:42:18,472 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 180 transitions. Word has length 47 [2018-10-10 14:42:18,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:18,473 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 180 transitions. [2018-10-10 14:42:18,473 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 14:42:18,473 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 180 transitions. [2018-10-10 14:42:18,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-10 14:42:18,475 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:18,475 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:18,476 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:18,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:18,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1452289403, now seen corresponding path program 1 times [2018-10-10 14:42:18,477 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:18,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:18,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:18,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:18,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:18,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:18,582 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:18,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:18,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:42:18,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:42:18,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:42:18,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:42:18,585 INFO L87 Difference]: Start difference. First operand 173 states and 180 transitions. Second operand 6 states. [2018-10-10 14:42:18,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:18,855 INFO L93 Difference]: Finished difference Result 172 states and 179 transitions. [2018-10-10 14:42:18,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 14:42:18,856 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-10-10 14:42:18,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:18,859 INFO L225 Difference]: With dead ends: 172 [2018-10-10 14:42:18,860 INFO L226 Difference]: Without dead ends: 172 [2018-10-10 14:42:18,860 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:42:18,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-10-10 14:42:18,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-10-10 14:42:18,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-10-10 14:42:18,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 179 transitions. [2018-10-10 14:42:18,872 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 179 transitions. Word has length 56 [2018-10-10 14:42:18,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:18,872 INFO L481 AbstractCegarLoop]: Abstraction has 172 states and 179 transitions. [2018-10-10 14:42:18,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:42:18,873 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 179 transitions. [2018-10-10 14:42:18,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-10 14:42:18,874 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:18,875 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:18,875 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:18,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:18,876 INFO L82 PathProgramCache]: Analyzing trace with hash -2071298430, now seen corresponding path program 1 times [2018-10-10 14:42:18,876 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:18,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:18,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:18,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:18,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:18,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:19,079 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:19,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:19,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:42:19,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:42:19,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:42:19,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:42:19,081 INFO L87 Difference]: Start difference. First operand 172 states and 179 transitions. Second operand 9 states. [2018-10-10 14:42:19,765 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-10-10 14:42:19,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:19,820 INFO L93 Difference]: Finished difference Result 242 states and 252 transitions. [2018-10-10 14:42:19,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 14:42:19,827 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2018-10-10 14:42:19,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:19,829 INFO L225 Difference]: With dead ends: 242 [2018-10-10 14:42:19,829 INFO L226 Difference]: Without dead ends: 242 [2018-10-10 14:42:19,830 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2018-10-10 14:42:19,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-10-10 14:42:19,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 171. [2018-10-10 14:42:19,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-10 14:42:19,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 178 transitions. [2018-10-10 14:42:19,840 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 178 transitions. Word has length 57 [2018-10-10 14:42:19,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:19,841 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 178 transitions. [2018-10-10 14:42:19,841 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:42:19,841 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 178 transitions. [2018-10-10 14:42:19,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-10 14:42:19,844 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:19,844 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] [2018-10-10 14:42:19,845 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:19,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:19,845 INFO L82 PathProgramCache]: Analyzing trace with hash 260517484, now seen corresponding path program 1 times [2018-10-10 14:42:19,845 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:19,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:19,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:19,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:19,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:19,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:20,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:20,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:20,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:42:20,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:42:20,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:42:20,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:42:20,049 INFO L87 Difference]: Start difference. First operand 171 states and 178 transitions. Second operand 9 states. [2018-10-10 14:42:20,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:20,377 INFO L93 Difference]: Finished difference Result 221 states and 232 transitions. [2018-10-10 14:42:20,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:42:20,378 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2018-10-10 14:42:20,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:20,381 INFO L225 Difference]: With dead ends: 221 [2018-10-10 14:42:20,381 INFO L226 Difference]: Without dead ends: 221 [2018-10-10 14:42:20,382 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:42:20,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-10-10 14:42:20,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 182. [2018-10-10 14:42:20,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-10 14:42:20,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 192 transitions. [2018-10-10 14:42:20,391 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 192 transitions. Word has length 79 [2018-10-10 14:42:20,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:20,392 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 192 transitions. [2018-10-10 14:42:20,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:42:20,392 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 192 transitions. [2018-10-10 14:42:20,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-10 14:42:20,394 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:20,394 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] [2018-10-10 14:42:20,394 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:20,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:20,395 INFO L82 PathProgramCache]: Analyzing trace with hash -513892395, now seen corresponding path program 1 times [2018-10-10 14:42:20,395 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:20,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:20,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:20,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:20,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:20,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:20,684 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:20,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:20,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-10 14:42:20,685 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 14:42:20,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 14:42:20,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:42:20,686 INFO L87 Difference]: Start difference. First operand 182 states and 192 transitions. Second operand 12 states. [2018-10-10 14:42:21,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:21,447 INFO L93 Difference]: Finished difference Result 273 states and 283 transitions. [2018-10-10 14:42:21,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 14:42:21,448 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 80 [2018-10-10 14:42:21,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:21,450 INFO L225 Difference]: With dead ends: 273 [2018-10-10 14:42:21,450 INFO L226 Difference]: Without dead ends: 273 [2018-10-10 14:42:21,451 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2018-10-10 14:42:21,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-10-10 14:42:21,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 183. [2018-10-10 14:42:21,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-10-10 14:42:21,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 193 transitions. [2018-10-10 14:42:21,458 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 193 transitions. Word has length 80 [2018-10-10 14:42:21,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:21,459 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 193 transitions. [2018-10-10 14:42:21,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 14:42:21,459 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 193 transitions. [2018-10-10 14:42:21,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-10 14:42:21,461 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:21,461 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] [2018-10-10 14:42:21,462 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:21,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:21,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1293226812, now seen corresponding path program 1 times [2018-10-10 14:42:21,462 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:21,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:21,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:21,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:21,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:21,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:21,593 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:21,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:21,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-10 14:42:21,594 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 14:42:21,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 14:42:21,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-10-10 14:42:21,596 INFO L87 Difference]: Start difference. First operand 183 states and 193 transitions. Second operand 10 states. [2018-10-10 14:42:22,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:22,077 INFO L93 Difference]: Finished difference Result 237 states and 248 transitions. [2018-10-10 14:42:22,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 14:42:22,077 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 81 [2018-10-10 14:42:22,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:22,080 INFO L225 Difference]: With dead ends: 237 [2018-10-10 14:42:22,081 INFO L226 Difference]: Without dead ends: 237 [2018-10-10 14:42:22,082 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2018-10-10 14:42:22,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-10-10 14:42:22,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 204. [2018-10-10 14:42:22,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-10-10 14:42:22,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 216 transitions. [2018-10-10 14:42:22,088 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 216 transitions. Word has length 81 [2018-10-10 14:42:22,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:22,088 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 216 transitions. [2018-10-10 14:42:22,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 14:42:22,089 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 216 transitions. [2018-10-10 14:42:22,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-10 14:42:22,090 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:22,090 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] [2018-10-10 14:42:22,091 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:22,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:22,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1435325721, now seen corresponding path program 1 times [2018-10-10 14:42:22,092 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:22,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:22,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:22,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:22,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:22,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:22,449 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:22,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:22,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-10 14:42:22,450 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 14:42:22,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 14:42:22,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:42:22,451 INFO L87 Difference]: Start difference. First operand 204 states and 216 transitions. Second operand 13 states. [2018-10-10 14:42:23,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:23,519 INFO L93 Difference]: Finished difference Result 274 states and 285 transitions. [2018-10-10 14:42:23,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-10 14:42:23,519 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 82 [2018-10-10 14:42:23,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:23,522 INFO L225 Difference]: With dead ends: 274 [2018-10-10 14:42:23,522 INFO L226 Difference]: Without dead ends: 274 [2018-10-10 14:42:23,523 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=240, Invalid=516, Unknown=0, NotChecked=0, Total=756 [2018-10-10 14:42:23,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-10-10 14:42:23,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 211. [2018-10-10 14:42:23,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-10-10 14:42:23,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 223 transitions. [2018-10-10 14:42:23,528 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 223 transitions. Word has length 82 [2018-10-10 14:42:23,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:23,528 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 223 transitions. [2018-10-10 14:42:23,529 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 14:42:23,529 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 223 transitions. [2018-10-10 14:42:23,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-10 14:42:23,530 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:23,531 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:23,531 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:23,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:23,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1128742087, now seen corresponding path program 1 times [2018-10-10 14:42:23,532 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:23,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:23,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:23,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:23,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:23,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:24,331 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:24,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:24,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-10 14:42:24,332 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 14:42:24,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 14:42:24,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-10-10 14:42:24,332 INFO L87 Difference]: Start difference. First operand 211 states and 223 transitions. Second operand 10 states. [2018-10-10 14:42:24,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:24,994 INFO L93 Difference]: Finished difference Result 238 states and 250 transitions. [2018-10-10 14:42:24,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 14:42:24,994 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 85 [2018-10-10 14:42:24,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:24,997 INFO L225 Difference]: With dead ends: 238 [2018-10-10 14:42:24,997 INFO L226 Difference]: Without dead ends: 238 [2018-10-10 14:42:24,997 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2018-10-10 14:42:24,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-10-10 14:42:25,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 210. [2018-10-10 14:42:25,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-10-10 14:42:25,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 222 transitions. [2018-10-10 14:42:25,002 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 222 transitions. Word has length 85 [2018-10-10 14:42:25,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:25,002 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 222 transitions. [2018-10-10 14:42:25,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 14:42:25,003 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 222 transitions. [2018-10-10 14:42:25,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-10 14:42:25,004 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:25,004 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] [2018-10-10 14:42:25,005 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:25,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:25,005 INFO L82 PathProgramCache]: Analyzing trace with hash -631266184, now seen corresponding path program 1 times [2018-10-10 14:42:25,005 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:25,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:25,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:25,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:25,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:25,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:25,592 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:25,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:25,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-10 14:42:25,593 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 14:42:25,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 14:42:25,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:42:25,593 INFO L87 Difference]: Start difference. First operand 210 states and 222 transitions. Second operand 13 states. [2018-10-10 14:42:26,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:26,476 INFO L93 Difference]: Finished difference Result 317 states and 331 transitions. [2018-10-10 14:42:26,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-10 14:42:26,476 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 86 [2018-10-10 14:42:26,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:26,477 INFO L225 Difference]: With dead ends: 317 [2018-10-10 14:42:26,477 INFO L226 Difference]: Without dead ends: 317 [2018-10-10 14:42:26,478 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=240, Invalid=516, Unknown=0, NotChecked=0, Total=756 [2018-10-10 14:42:26,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-10-10 14:42:26,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 219. [2018-10-10 14:42:26,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-10-10 14:42:26,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 231 transitions. [2018-10-10 14:42:26,483 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 231 transitions. Word has length 86 [2018-10-10 14:42:26,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:26,484 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 231 transitions. [2018-10-10 14:42:26,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 14:42:26,484 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 231 transitions. [2018-10-10 14:42:26,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-10 14:42:26,485 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:26,485 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] [2018-10-10 14:42:26,485 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:26,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:26,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1408230384, now seen corresponding path program 1 times [2018-10-10 14:42:26,486 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:26,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:26,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:26,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:26,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:26,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:26,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:42:26,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:26,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-10 14:42:26,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-10 14:42:26,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-10 14:42:26,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 14:42:26,551 INFO L87 Difference]: Start difference. First operand 219 states and 231 transitions. Second operand 3 states. [2018-10-10 14:42:26,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:26,564 INFO L93 Difference]: Finished difference Result 241 states and 252 transitions. [2018-10-10 14:42:26,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-10 14:42:26,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2018-10-10 14:42:26,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:26,570 INFO L225 Difference]: With dead ends: 241 [2018-10-10 14:42:26,570 INFO L226 Difference]: Without dead ends: 241 [2018-10-10 14:42:26,570 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 14:42:26,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-10-10 14:42:26,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 220. [2018-10-10 14:42:26,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-10-10 14:42:26,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 232 transitions. [2018-10-10 14:42:26,575 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 232 transitions. Word has length 94 [2018-10-10 14:42:26,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:26,575 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 232 transitions. [2018-10-10 14:42:26,576 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-10 14:42:26,576 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 232 transitions. [2018-10-10 14:42:26,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-10 14:42:26,577 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:26,577 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:26,577 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:26,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:26,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1396789694, now seen corresponding path program 1 times [2018-10-10 14:42:26,579 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:26,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:26,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:26,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:26,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:26,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:26,943 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:26,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:26,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-10 14:42:26,943 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 14:42:26,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 14:42:26,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-10 14:42:26,944 INFO L87 Difference]: Start difference. First operand 220 states and 232 transitions. Second operand 10 states. [2018-10-10 14:42:27,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:27,220 INFO L93 Difference]: Finished difference Result 218 states and 230 transitions. [2018-10-10 14:42:27,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:42:27,221 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2018-10-10 14:42:27,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:27,222 INFO L225 Difference]: With dead ends: 218 [2018-10-10 14:42:27,222 INFO L226 Difference]: Without dead ends: 218 [2018-10-10 14:42:27,223 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2018-10-10 14:42:27,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-10-10 14:42:27,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2018-10-10 14:42:27,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-10-10 14:42:27,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 230 transitions. [2018-10-10 14:42:27,229 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 230 transitions. Word has length 96 [2018-10-10 14:42:27,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:27,229 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 230 transitions. [2018-10-10 14:42:27,229 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 14:42:27,229 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 230 transitions. [2018-10-10 14:42:27,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-10 14:42:27,230 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:27,231 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:27,231 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:27,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:27,232 INFO L82 PathProgramCache]: Analyzing trace with hash 350807712, now seen corresponding path program 1 times [2018-10-10 14:42:27,232 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:27,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:27,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:27,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:27,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:27,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:27,483 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:27,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:27,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-10 14:42:27,484 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 14:42:27,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 14:42:27,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:42:27,485 INFO L87 Difference]: Start difference. First operand 218 states and 230 transitions. Second operand 13 states. [2018-10-10 14:42:28,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:28,279 INFO L93 Difference]: Finished difference Result 382 states and 396 transitions. [2018-10-10 14:42:28,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-10 14:42:28,284 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 97 [2018-10-10 14:42:28,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:28,286 INFO L225 Difference]: With dead ends: 382 [2018-10-10 14:42:28,286 INFO L226 Difference]: Without dead ends: 382 [2018-10-10 14:42:28,287 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=247, Invalid=683, Unknown=0, NotChecked=0, Total=930 [2018-10-10 14:42:28,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-10-10 14:42:28,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 229. [2018-10-10 14:42:28,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-10-10 14:42:28,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 241 transitions. [2018-10-10 14:42:28,292 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 241 transitions. Word has length 97 [2018-10-10 14:42:28,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:28,292 INFO L481 AbstractCegarLoop]: Abstraction has 229 states and 241 transitions. [2018-10-10 14:42:28,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 14:42:28,293 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 241 transitions. [2018-10-10 14:42:28,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-10 14:42:28,294 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:28,294 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] [2018-10-10 14:42:28,294 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:28,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:28,295 INFO L82 PathProgramCache]: Analyzing trace with hash -805135703, now seen corresponding path program 1 times [2018-10-10 14:42:28,295 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:28,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:28,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:28,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:28,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:28,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:28,577 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-10 14:42:28,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:28,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:42:28,578 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:42:28,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:42:28,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:42:28,579 INFO L87 Difference]: Start difference. First operand 229 states and 241 transitions. Second operand 8 states. [2018-10-10 14:42:28,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:28,692 INFO L93 Difference]: Finished difference Result 228 states and 237 transitions. [2018-10-10 14:42:28,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 14:42:28,693 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 98 [2018-10-10 14:42:28,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:28,694 INFO L225 Difference]: With dead ends: 228 [2018-10-10 14:42:28,694 INFO L226 Difference]: Without dead ends: 228 [2018-10-10 14:42:28,695 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:42:28,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-10-10 14:42:28,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2018-10-10 14:42:28,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-10-10 14:42:28,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 237 transitions. [2018-10-10 14:42:28,699 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 237 transitions. Word has length 98 [2018-10-10 14:42:28,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:28,699 INFO L481 AbstractCegarLoop]: Abstraction has 228 states and 237 transitions. [2018-10-10 14:42:28,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:42:28,700 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 237 transitions. [2018-10-10 14:42:28,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-10 14:42:28,701 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:28,701 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:28,701 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:28,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:28,702 INFO L82 PathProgramCache]: Analyzing trace with hash -126602749, now seen corresponding path program 1 times [2018-10-10 14:42:28,702 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:28,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:28,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:28,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:28,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:28,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:29,592 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:29,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:29,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-10-10 14:42:29,593 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 14:42:29,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 14:42:29,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-10-10 14:42:29,594 INFO L87 Difference]: Start difference. First operand 228 states and 237 transitions. Second operand 16 states. [2018-10-10 14:42:30,870 WARN L178 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2018-10-10 14:42:31,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:31,332 INFO L93 Difference]: Finished difference Result 227 states and 236 transitions. [2018-10-10 14:42:31,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 14:42:31,333 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 99 [2018-10-10 14:42:31,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:31,334 INFO L225 Difference]: With dead ends: 227 [2018-10-10 14:42:31,334 INFO L226 Difference]: Without dead ends: 205 [2018-10-10 14:42:31,335 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=148, Invalid=974, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 14:42:31,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-10-10 14:42:31,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-10-10 14:42:31,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-10-10 14:42:31,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 211 transitions. [2018-10-10 14:42:31,339 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 211 transitions. Word has length 99 [2018-10-10 14:42:31,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:31,340 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 211 transitions. [2018-10-10 14:42:31,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 14:42:31,340 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 211 transitions. [2018-10-10 14:42:31,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-10-10 14:42:31,341 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:31,341 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] [2018-10-10 14:42:31,342 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:31,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:31,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1278453444, now seen corresponding path program 1 times [2018-10-10 14:42:31,342 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:31,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:31,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:31,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:31,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:31,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:32,778 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:42:32,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:32,778 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:32,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:32,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:32,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:32,911 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:32,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:32,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:32,928 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-10 14:42:33,055 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:33,077 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:33,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-10 14:42:33,079 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:33,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:33,108 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-10-10 14:42:33,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 6 treesize of output 5 [2018-10-10 14:42:33,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:33,336 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:33,336 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:13 [2018-10-10 14:42:33,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-10 14:42:33,617 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:33,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:33,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:33,632 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:33,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:27 [2018-10-10 14:42:35,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-10-10 14:42:35,059 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:35,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:35,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:35,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:42:35,082 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:36, output treesize:21 [2018-10-10 14:42:35,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-10 14:42:35,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-10-10 14:42:35,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-10 14:42:35,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:42:35,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:42:35,589 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:47 [2018-10-10 14:42:36,042 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:42:36,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:42:36,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 55 [2018-10-10 14:42:36,105 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i_16.bpl [2018-10-10 14:42:36,111 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-10 14:42:36,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-10 14:42:36,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=2944, Unknown=0, NotChecked=0, Total=3080 [2018-10-10 14:42:36,113 INFO L87 Difference]: Start difference. First operand 205 states and 211 transitions. Second operand 56 states. [2018-10-10 14:42:38,076 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2018-10-10 14:42:38,313 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2018-10-10 14:42:38,666 WARN L178 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2018-10-10 14:42:38,945 WARN L178 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 67 [2018-10-10 14:42:39,241 WARN L178 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 70 [2018-10-10 14:42:39,661 WARN L178 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 82 [2018-10-10 14:42:40,046 WARN L178 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 85 [2018-10-10 14:42:40,416 WARN L178 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 97 [2018-10-10 14:42:40,975 WARN L178 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 95 [2018-10-10 14:42:41,443 WARN L178 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 103 [2018-10-10 14:42:42,503 WARN L178 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 101 [2018-10-10 14:42:42,886 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2018-10-10 14:42:43,147 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 64 [2018-10-10 14:42:43,456 WARN L178 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 77 [2018-10-10 14:42:43,685 WARN L178 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2018-10-10 14:42:44,237 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 63 [2018-10-10 14:42:44,478 WARN L178 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 77 [2018-10-10 14:42:45,098 WARN L178 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 70 [2018-10-10 14:42:45,458 WARN L178 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 74 [2018-10-10 14:42:45,677 WARN L178 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 66 [2018-10-10 14:42:45,842 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2018-10-10 14:42:46,058 WARN L178 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2018-10-10 14:42:46,417 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2018-10-10 14:42:47,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:47,414 INFO L93 Difference]: Finished difference Result 238 states and 244 transitions. [2018-10-10 14:42:47,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-10 14:42:47,414 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 113 [2018-10-10 14:42:47,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:47,416 INFO L225 Difference]: With dead ends: 238 [2018-10-10 14:42:47,416 INFO L226 Difference]: Without dead ends: 238 [2018-10-10 14:42:47,419 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1086 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=1100, Invalid=7272, Unknown=0, NotChecked=0, Total=8372 [2018-10-10 14:42:47,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-10-10 14:42:47,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 221. [2018-10-10 14:42:47,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-10-10 14:42:47,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 227 transitions. [2018-10-10 14:42:47,424 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 227 transitions. Word has length 113 [2018-10-10 14:42:47,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:47,424 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 227 transitions. [2018-10-10 14:42:47,424 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-10 14:42:47,424 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 227 transitions. [2018-10-10 14:42:47,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-10-10 14:42:47,425 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:47,425 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] [2018-10-10 14:42:47,426 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:47,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:47,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1378253944, now seen corresponding path program 1 times [2018-10-10 14:42:47,426 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:47,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:47,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:47,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:47,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:47,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:48,097 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,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:48,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-10-10 14:42:48,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-10 14:42:48,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-10 14:42:48,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2018-10-10 14:42:48,099 INFO L87 Difference]: Start difference. First operand 221 states and 227 transitions. Second operand 21 states. [2018-10-10 14:42:49,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:49,726 INFO L93 Difference]: Finished difference Result 272 states and 279 transitions. [2018-10-10 14:42:49,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 14:42:49,726 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 113 [2018-10-10 14:42:49,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:49,728 INFO L225 Difference]: With dead ends: 272 [2018-10-10 14:42:49,729 INFO L226 Difference]: Without dead ends: 272 [2018-10-10 14:42:49,730 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=375, Invalid=1265, Unknown=0, NotChecked=0, Total=1640 [2018-10-10 14:42:49,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-10-10 14:42:49,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 245. [2018-10-10 14:42:49,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-10-10 14:42:49,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 253 transitions. [2018-10-10 14:42:49,734 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 253 transitions. Word has length 113 [2018-10-10 14:42:49,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:49,735 INFO L481 AbstractCegarLoop]: Abstraction has 245 states and 253 transitions. [2018-10-10 14:42:49,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-10 14:42:49,735 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 253 transitions. [2018-10-10 14:42:49,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-10 14:42:49,736 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:49,736 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:49,737 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:49,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:49,737 INFO L82 PathProgramCache]: Analyzing trace with hash 896702369, now seen corresponding path program 1 times [2018-10-10 14:42:49,737 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:49,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:49,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:49,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:49,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:49,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:50,701 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:50,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:50,702 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:42:50,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:50,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:50,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:50,771 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:50,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:50,809 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:50,810 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-10 14:42:50,948 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:50,950 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:50,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:50,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:50,961 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:50,961 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-10-10 14:42:51,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-10 14:42:51,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-10-10 14:42:51,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-10 14:42:51,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:42:51,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:42:51,385 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-10-10 14:42:51,624 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:51,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:42:51,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 34 [2018-10-10 14:42:51,670 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i_18.bpl [2018-10-10 14:42:51,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-10 14:42:51,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-10 14:42:51,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1096, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 14:42:51,673 INFO L87 Difference]: Start difference. First operand 245 states and 253 transitions. Second operand 35 states. [2018-10-10 14:42:53,454 WARN L178 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 77 [2018-10-10 14:42:53,826 WARN L178 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2018-10-10 14:42:54,192 WARN L178 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 85 [2018-10-10 14:42:54,455 WARN L178 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2018-10-10 14:42:55,176 WARN L178 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 35 [2018-10-10 14:42:56,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:56,008 INFO L93 Difference]: Finished difference Result 331 states and 341 transitions. [2018-10-10 14:42:56,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-10 14:42:56,008 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 119 [2018-10-10 14:42:56,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:56,011 INFO L225 Difference]: With dead ends: 331 [2018-10-10 14:42:56,011 INFO L226 Difference]: Without dead ends: 331 [2018-10-10 14:42:56,013 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=608, Invalid=3052, Unknown=0, NotChecked=0, Total=3660 [2018-10-10 14:42:56,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-10-10 14:42:56,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 254. [2018-10-10 14:42:56,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-10-10 14:42:56,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 262 transitions. [2018-10-10 14:42:56,017 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 262 transitions. Word has length 119 [2018-10-10 14:42:56,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:56,018 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 262 transitions. [2018-10-10 14:42:56,018 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-10 14:42:56,018 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 262 transitions. [2018-10-10 14:42:56,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-10 14:42:56,019 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:56,019 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] [2018-10-10 14:42:56,020 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:56,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:56,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1364019793, now seen corresponding path program 1 times [2018-10-10 14:42:56,020 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:56,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:56,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:56,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:56,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:56,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:56,208 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,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:56,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-10 14:42:56,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 14:42:56,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 14:42:56,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:42:56,210 INFO L87 Difference]: Start difference. First operand 254 states and 262 transitions. Second operand 11 states. [2018-10-10 14:42:56,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:56,607 INFO L93 Difference]: Finished difference Result 253 states and 261 transitions. [2018-10-10 14:42:56,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 14:42:56,608 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 124 [2018-10-10 14:42:56,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:56,609 INFO L225 Difference]: With dead ends: 253 [2018-10-10 14:42:56,610 INFO L226 Difference]: Without dead ends: 253 [2018-10-10 14:42:56,610 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2018-10-10 14:42:56,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-10-10 14:42:56,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 237. [2018-10-10 14:42:56,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-10-10 14:42:56,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 244 transitions. [2018-10-10 14:42:56,615 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 244 transitions. Word has length 124 [2018-10-10 14:42:56,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:56,615 INFO L481 AbstractCegarLoop]: Abstraction has 237 states and 244 transitions. [2018-10-10 14:42:56,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 14:42:56,615 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 244 transitions. [2018-10-10 14:42:56,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-10 14:42:56,616 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:56,616 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] [2018-10-10 14:42:56,617 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:56,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:56,617 INFO L82 PathProgramCache]: Analyzing trace with hash -665059164, now seen corresponding path program 1 times [2018-10-10 14:42:56,617 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:56,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:56,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:56,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:56,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:56,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:57,080 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:57,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:57,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-10 14:42:57,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 14:42:57,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 14:42:57,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:42:57,081 INFO L87 Difference]: Start difference. First operand 237 states and 244 transitions. Second operand 11 states. [2018-10-10 14:42:57,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:57,345 INFO L93 Difference]: Finished difference Result 239 states and 244 transitions. [2018-10-10 14:42:57,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-10 14:42:57,347 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 125 [2018-10-10 14:42:57,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:57,348 INFO L225 Difference]: With dead ends: 239 [2018-10-10 14:42:57,348 INFO L226 Difference]: Without dead ends: 231 [2018-10-10 14:42:57,349 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2018-10-10 14:42:57,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-10-10 14:42:57,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2018-10-10 14:42:57,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-10-10 14:42:57,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 236 transitions. [2018-10-10 14:42:57,351 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 236 transitions. Word has length 125 [2018-10-10 14:42:57,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:57,352 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 236 transitions. [2018-10-10 14:42:57,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 14:42:57,352 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 236 transitions. [2018-10-10 14:42:57,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-10 14:42:57,352 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:57,352 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2018-10-10 14:42:57,353 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:57,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:57,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1532900948, now seen corresponding path program 2 times [2018-10-10 14:42:57,353 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:57,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:57,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:57,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:57,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:59,665 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:59,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:59,665 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:42:59,673 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-10 14:42:59,715 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-10 14:42:59,715 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-10 14:42:59,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:59,730 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:59,731 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:59,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:59,733 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-10 14:42:59,805 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:59,808 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:59,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-10 14:42:59,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:59,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:59,815 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-10-10 14:42:59,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 6 treesize of output 5 [2018-10-10 14:42:59,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:00,001 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:00,002 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:13 [2018-10-10 14:43:00,256 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:00,262 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:00,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:00,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:00,283 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:00,284 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-10-10 14:43:01,127 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:01,130 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:01,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:01,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:01,148 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:01,149 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:40, output treesize:25 [2018-10-10 14:43:01,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-10 14:43:01,845 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:01,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-10 14:43:01,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:43:01,868 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:01,868 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:29 [2018-10-10 14:43:02,167 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:02,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:43:02,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 61 [2018-10-10 14:43:02,189 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-10 14:43:02,193 WARN L205 ceAbstractionStarter]: Timeout [2018-10-10 14:43:02,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 02:43:02 BoogieIcfgContainer [2018-10-10 14:43:02,194 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 14:43:02,195 INFO L168 Benchmark]: Toolchain (without parser) took 48647.06 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.6 GB in the end (delta: -1.1 GB). Peak memory consumption was 53.0 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:02,196 INFO L168 Benchmark]: CDTParser took 0.21 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:02,196 INFO L168 Benchmark]: CACSL2BoogieTranslator took 466.56 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:02,197 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.89 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:02,197 INFO L168 Benchmark]: Boogie Preprocessor took 34.93 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:02,198 INFO L168 Benchmark]: RCFGBuilder took 1122.37 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 764.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -791.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:02,199 INFO L168 Benchmark]: TraceAbstraction took 46955.14 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 427.8 MB). Free memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: -369.0 MB). Peak memory consumption was 58.8 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:02,202 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.21 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 466.56 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 62.89 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 34.93 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1122.37 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 764.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -791.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 46955.14 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 427.8 MB). Free memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: -369.0 MB). Peak memory consumption was 58.8 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 21). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 21). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 21). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 21). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 21). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 21). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 21). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 21). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 21). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 21). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 21). - TimeoutResultAtElement [Line: 560]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 560). Cancelled while PathProgramDumpController was trying to verify (iteration 21). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 21). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 180 locations, 13 error locations. TIMEOUT Result, 46.8s OverallTime, 21 OverallIterations, 3 TraceHistogramMax, 28.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3148 SDtfs, 20019 SDslu, 16767 SDs, 0 SdLazy, 8725 SolverSat, 253 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 706 GetRequests, 219 SyntacticMatches, 4 SemanticMatches, 483 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2582 ImplicationChecksByTransitivity, 25.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=254occurred in iteration=18, 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, 20 MinimizatonAttempts, 733 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 12.5s InterpolantComputationTime, 2009 NumberOfCodeBlocks, 2009 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1987 ConstructedInterpolants, 69 QuantifiedInterpolants, 1451879 SizeOfPredicates, 74 NumberOfNonLiveVariables, 480 ConjunctsInSsa, 127 ConjunctsInUnsatCore, 22 InterpolantComputations, 18 PerfectInterpolantSequences, 7/47 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Received shutdown request...