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-examples/standard_strcpy_false-valid-deref_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c5b1954-m [2018-10-10 14:43:02,004 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 14:43:02,006 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 14:43:02,018 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 14:43:02,018 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 14:43:02,019 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 14:43:02,021 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 14:43:02,023 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 14:43:02,025 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 14:43:02,026 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 14:43:02,027 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 14:43:02,027 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 14:43:02,028 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 14:43:02,029 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 14:43:02,030 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 14:43:02,031 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 14:43:02,032 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 14:43:02,034 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 14:43:02,036 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 14:43:02,038 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 14:43:02,039 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 14:43:02,041 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 14:43:02,043 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 14:43:02,044 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 14:43:02,044 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 14:43:02,045 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 14:43:02,046 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 14:43:02,047 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 14:43:02,048 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 14:43:02,049 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 14:43:02,050 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 14:43:02,051 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 14:43:02,051 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 14:43:02,051 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 14:43:02,052 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 14:43:02,053 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 14:43:02,054 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:43:02,070 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 14:43:02,070 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 14:43:02,071 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-10 14:43:02,072 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-10 14:43:02,072 INFO L133 SettingsManager]: * Use SBE=true [2018-10-10 14:43:02,072 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-10 14:43:02,072 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-10 14:43:02,073 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-10 14:43:02,073 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-10 14:43:02,073 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-10 14:43:02,073 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-10 14:43:02,074 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-10 14:43:02,074 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-10 14:43:02,074 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-10 14:43:02,074 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-10 14:43:02,075 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-10 14:43:02,075 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 14:43:02,075 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-10 14:43:02,075 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-10 14:43:02,076 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-10 14:43:02,076 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:43:02,076 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 14:43:02,076 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-10 14:43:02,077 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-10 14:43:02,077 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-10 14:43:02,077 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:43:02,135 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 14:43:02,155 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 14:43:02,159 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 14:43:02,161 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-10 14:43:02,161 INFO L276 PluginConnector]: CDTParser initialized [2018-10-10 14:43:02,162 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_strcpy_false-valid-deref_ground.i [2018-10-10 14:43:02,501 INFO L217 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30883845d/7ea98342c567465593a849bb6f65aefb/FLAG6d7dd1221 [2018-10-10 14:43:02,695 INFO L289 CDTParser]: Found 1 translation units. [2018-10-10 14:43:02,695 INFO L157 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_strcpy_false-valid-deref_ground.i [2018-10-10 14:43:02,702 INFO L337 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30883845d/7ea98342c567465593a849bb6f65aefb/FLAG6d7dd1221 [2018-10-10 14:43:02,718 INFO L345 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30883845d/7ea98342c567465593a849bb6f65aefb [2018-10-10 14:43:02,727 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 14:43:02,729 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-10 14:43:02,730 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-10 14:43:02,730 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-10 14:43:02,735 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-10 14:43:02,736 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:43:02" (1/1) ... [2018-10-10 14:43:02,739 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@784e8fa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:02, skipping insertion in model container [2018-10-10 14:43:02,739 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:43:02" (1/1) ... [2018-10-10 14:43:02,749 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-10 14:43:02,768 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-10 14:43:02,965 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:43:02,971 INFO L189 MainTranslator]: Completed pre-run [2018-10-10 14:43:03,002 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:43:03,027 INFO L193 MainTranslator]: Completed translation [2018-10-10 14:43:03,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:03 WrapperNode [2018-10-10 14:43:03,027 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-10 14:43:03,028 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-10 14:43:03,029 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-10 14:43:03,029 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-10 14:43:03,039 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:43:03" (1/1) ... [2018-10-10 14:43:03,049 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:43:03" (1/1) ... [2018-10-10 14:43:03,085 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-10 14:43:03,086 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 14:43:03,086 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 14:43:03,086 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 14:43:03,096 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:03" (1/1) ... [2018-10-10 14:43:03,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:03" (1/1) ... [2018-10-10 14:43:03,099 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:03" (1/1) ... [2018-10-10 14:43:03,099 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:03" (1/1) ... [2018-10-10 14:43:03,105 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:03" (1/1) ... [2018-10-10 14:43:03,112 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:03" (1/1) ... [2018-10-10 14:43:03,119 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:03" (1/1) ... [2018-10-10 14:43:03,122 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 14:43:03,122 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 14:43:03,123 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 14:43:03,123 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 14:43:03,124 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:03" (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:43:03,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 14:43:03,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 14:43:04,108 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 14:43:04,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:43:04 BoogieIcfgContainer [2018-10-10 14:43:04,109 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 14:43:04,110 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 14:43:04,111 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 14:43:04,114 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 14:43:04,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 02:43:02" (1/3) ... [2018-10-10 14:43:04,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26815c4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:43:04, skipping insertion in model container [2018-10-10 14:43:04,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:43:03" (2/3) ... [2018-10-10 14:43:04,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26815c4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:43:04, skipping insertion in model container [2018-10-10 14:43:04,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:43:04" (3/3) ... [2018-10-10 14:43:04,119 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_strcpy_false-valid-deref_ground.i [2018-10-10 14:43:04,130 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-10 14:43:04,145 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-10-10 14:43:04,166 INFO L257 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2018-10-10 14:43:04,198 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 14:43:04,199 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 14:43:04,199 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 14:43:04,199 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-10 14:43:04,199 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 14:43:04,199 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 14:43:04,200 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 14:43:04,200 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 14:43:04,200 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 14:43:04,224 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2018-10-10 14:43:04,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-10 14:43:04,234 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:04,235 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] [2018-10-10 14:43:04,238 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:04,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:04,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1805784654, now seen corresponding path program 1 times [2018-10-10 14:43:04,247 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:04,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:04,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:04,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:04,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:04,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:04,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:04,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:04,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 14:43:04,620 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 14:43:04,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 14:43:04,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:43:04,640 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 7 states. [2018-10-10 14:43:05,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:05,251 INFO L93 Difference]: Finished difference Result 137 states and 138 transitions. [2018-10-10 14:43:05,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:43:05,253 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2018-10-10 14:43:05,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:05,265 INFO L225 Difference]: With dead ends: 137 [2018-10-10 14:43:05,265 INFO L226 Difference]: Without dead ends: 131 [2018-10-10 14:43:05,268 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:43:05,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-10-10 14:43:05,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 128. [2018-10-10 14:43:05,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-10-10 14:43:05,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 129 transitions. [2018-10-10 14:43:05,318 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 129 transitions. Word has length 37 [2018-10-10 14:43:05,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:05,319 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 129 transitions. [2018-10-10 14:43:05,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 14:43:05,319 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 129 transitions. [2018-10-10 14:43:05,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-10 14:43:05,320 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:05,321 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] [2018-10-10 14:43:05,321 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:05,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:05,322 INFO L82 PathProgramCache]: Analyzing trace with hash -144749352, now seen corresponding path program 1 times [2018-10-10 14:43:05,322 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:05,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:05,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:05,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:05,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:05,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:05,729 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-10 14:43:06,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:06,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:06,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-10 14:43:06,107 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 14:43:06,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 14:43:06,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:43:06,108 INFO L87 Difference]: Start difference. First operand 128 states and 129 transitions. Second operand 12 states. [2018-10-10 14:43:07,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:07,464 INFO L93 Difference]: Finished difference Result 236 states and 239 transitions. [2018-10-10 14:43:07,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-10 14:43:07,468 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2018-10-10 14:43:07,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:07,471 INFO L225 Difference]: With dead ends: 236 [2018-10-10 14:43:07,471 INFO L226 Difference]: Without dead ends: 236 [2018-10-10 14:43:07,473 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=198, Invalid=558, Unknown=0, NotChecked=0, Total=756 [2018-10-10 14:43:07,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-10-10 14:43:07,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 145. [2018-10-10 14:43:07,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-10-10 14:43:07,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 147 transitions. [2018-10-10 14:43:07,489 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 147 transitions. Word has length 38 [2018-10-10 14:43:07,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:07,490 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 147 transitions. [2018-10-10 14:43:07,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 14:43:07,490 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 147 transitions. [2018-10-10 14:43:07,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-10 14:43:07,492 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:07,492 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] [2018-10-10 14:43:07,493 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:07,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:07,494 INFO L82 PathProgramCache]: Analyzing trace with hash 92062496, now seen corresponding path program 1 times [2018-10-10 14:43:07,494 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:07,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:07,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:07,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:07,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:07,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:07,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:07,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 14:43:07,586 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 14:43:07,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 14:43:07,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-10 14:43:07,587 INFO L87 Difference]: Start difference. First operand 145 states and 147 transitions. Second operand 5 states. [2018-10-10 14:43:07,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:07,881 INFO L93 Difference]: Finished difference Result 144 states and 146 transitions. [2018-10-10 14:43:07,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-10 14:43:07,884 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-10-10 14:43:07,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:07,889 INFO L225 Difference]: With dead ends: 144 [2018-10-10 14:43:07,890 INFO L226 Difference]: Without dead ends: 144 [2018-10-10 14:43:07,890 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:43:07,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-10-10 14:43:07,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-10-10 14:43:07,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-10-10 14:43:07,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 146 transitions. [2018-10-10 14:43:07,911 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 146 transitions. Word has length 53 [2018-10-10 14:43:07,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:07,911 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 146 transitions. [2018-10-10 14:43:07,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 14:43:07,912 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 146 transitions. [2018-10-10 14:43:07,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-10 14:43:07,915 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:07,915 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] [2018-10-10 14:43:07,916 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:07,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:07,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1441029787, now seen corresponding path program 1 times [2018-10-10 14:43:07,918 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:07,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:07,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:07,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:07,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:07,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:08,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:08,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:08,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 14:43:08,005 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-10 14:43:08,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-10 14:43:08,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-10 14:43:08,006 INFO L87 Difference]: Start difference. First operand 144 states and 146 transitions. Second operand 4 states. [2018-10-10 14:43:08,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:08,075 INFO L93 Difference]: Finished difference Result 186 states and 187 transitions. [2018-10-10 14:43:08,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-10 14:43:08,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-10-10 14:43:08,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:08,078 INFO L225 Difference]: With dead ends: 186 [2018-10-10 14:43:08,079 INFO L226 Difference]: Without dead ends: 186 [2018-10-10 14:43:08,080 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-10 14:43:08,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-10-10 14:43:08,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 149. [2018-10-10 14:43:08,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-10-10 14:43:08,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 151 transitions. [2018-10-10 14:43:08,093 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 151 transitions. Word has length 54 [2018-10-10 14:43:08,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:08,093 INFO L481 AbstractCegarLoop]: Abstraction has 149 states and 151 transitions. [2018-10-10 14:43:08,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-10 14:43:08,094 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 151 transitions. [2018-10-10 14:43:08,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-10 14:43:08,100 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:08,100 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] [2018-10-10 14:43:08,101 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:08,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:08,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1547536165, now seen corresponding path program 1 times [2018-10-10 14:43:08,101 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:08,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:08,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:08,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:08,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:08,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:08,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:08,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:08,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 14:43:08,183 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 14:43:08,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 14:43:08,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-10 14:43:08,183 INFO L87 Difference]: Start difference. First operand 149 states and 151 transitions. Second operand 5 states. [2018-10-10 14:43:08,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:08,355 INFO L93 Difference]: Finished difference Result 162 states and 164 transitions. [2018-10-10 14:43:08,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-10 14:43:08,355 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2018-10-10 14:43:08,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:08,358 INFO L225 Difference]: With dead ends: 162 [2018-10-10 14:43:08,358 INFO L226 Difference]: Without dead ends: 162 [2018-10-10 14:43:08,359 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:43:08,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-10-10 14:43:08,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 148. [2018-10-10 14:43:08,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-10-10 14:43:08,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 150 transitions. [2018-10-10 14:43:08,365 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 150 transitions. Word has length 60 [2018-10-10 14:43:08,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:08,366 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 150 transitions. [2018-10-10 14:43:08,366 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 14:43:08,366 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 150 transitions. [2018-10-10 14:43:08,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-10 14:43:08,368 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:08,368 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] [2018-10-10 14:43:08,369 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:08,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:08,369 INFO L82 PathProgramCache]: Analyzing trace with hash 728980965, now seen corresponding path program 1 times [2018-10-10 14:43:08,369 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:08,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:08,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:08,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:08,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:08,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:08,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:08,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:08,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:43:08,658 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:43:08,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:43:08,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:43:08,659 INFO L87 Difference]: Start difference. First operand 148 states and 150 transitions. Second operand 8 states. [2018-10-10 14:43:09,014 WARN L178 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-10-10 14:43:09,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:09,221 INFO L93 Difference]: Finished difference Result 264 states and 267 transitions. [2018-10-10 14:43:09,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:43:09,223 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2018-10-10 14:43:09,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:09,226 INFO L225 Difference]: With dead ends: 264 [2018-10-10 14:43:09,226 INFO L226 Difference]: Without dead ends: 264 [2018-10-10 14:43:09,227 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:43:09,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-10-10 14:43:09,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 159. [2018-10-10 14:43:09,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-10-10 14:43:09,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 161 transitions. [2018-10-10 14:43:09,234 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 161 transitions. Word has length 61 [2018-10-10 14:43:09,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:09,234 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 161 transitions. [2018-10-10 14:43:09,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:43:09,235 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 161 transitions. [2018-10-10 14:43:09,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-10 14:43:09,236 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:09,236 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] [2018-10-10 14:43:09,237 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:09,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:09,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1781216182, now seen corresponding path program 1 times [2018-10-10 14:43:09,238 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:09,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:09,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:09,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:09,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:09,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:10,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:10,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:10,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-10-10 14:43:10,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 14:43:10,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 14:43:10,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-10-10 14:43:10,008 INFO L87 Difference]: Start difference. First operand 159 states and 161 transitions. Second operand 16 states. [2018-10-10 14:43:11,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:11,334 INFO L93 Difference]: Finished difference Result 158 states and 160 transitions. [2018-10-10 14:43:11,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 14:43:11,334 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2018-10-10 14:43:11,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:11,336 INFO L225 Difference]: With dead ends: 158 [2018-10-10 14:43:11,336 INFO L226 Difference]: Without dead ends: 137 [2018-10-10 14:43:11,337 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=148, Invalid=974, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 14:43:11,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-10-10 14:43:11,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-10-10 14:43:11,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-10-10 14:43:11,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2018-10-10 14:43:11,342 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 66 [2018-10-10 14:43:11,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:11,342 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2018-10-10 14:43:11,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 14:43:11,343 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2018-10-10 14:43:11,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-10 14:43:11,344 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:11,344 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:43:11,345 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:11,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:11,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1072539293, now seen corresponding path program 1 times [2018-10-10 14:43:11,346 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:11,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:11,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:11,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:11,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:11,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:11,764 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:11,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:43:11,765 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:43:11,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:11,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:43:11,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 14:43:11,900 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:11,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:11,928 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-10 14:43:11,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 14:43:11,945 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:11,971 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:11,971 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-10-10 14:43:12,018 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:43:12,019 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:43:12,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-10 14:43:12,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:12,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:12,030 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2018-10-10 14:43:12,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-10-10 14:43:12,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:12,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:12,057 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:9 [2018-10-10 14:43:12,241 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:12,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:43:12,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 16 [2018-10-10 14:43:12,305 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/standard_strcpy_false-valid-deref_ground.i_8.bpl [2018-10-10 14:43:12,310 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-10 14:43:12,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-10 14:43:12,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-10-10 14:43:12,311 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 17 states. [2018-10-10 14:43:12,798 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-10 14:43:13,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:13,563 INFO L93 Difference]: Finished difference Result 225 states and 227 transitions. [2018-10-10 14:43:13,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-10 14:43:13,563 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 73 [2018-10-10 14:43:13,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:13,566 INFO L225 Difference]: With dead ends: 225 [2018-10-10 14:43:13,566 INFO L226 Difference]: Without dead ends: 225 [2018-10-10 14:43:13,567 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=271, Invalid=785, Unknown=0, NotChecked=0, Total=1056 [2018-10-10 14:43:13,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-10-10 14:43:13,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 161. [2018-10-10 14:43:13,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-10 14:43:13,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 163 transitions. [2018-10-10 14:43:13,572 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 163 transitions. Word has length 73 [2018-10-10 14:43:13,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:13,573 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 163 transitions. [2018-10-10 14:43:13,573 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-10 14:43:13,573 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 163 transitions. [2018-10-10 14:43:13,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-10 14:43:13,575 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:13,575 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-10 14:43:13,575 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:13,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:13,576 INFO L82 PathProgramCache]: Analyzing trace with hash 932172074, now seen corresponding path program 1 times [2018-10-10 14:43:13,576 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:13,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:13,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:13,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:13,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:13,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:13,803 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-10 14:43:13,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:43:13,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:43:13,804 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:43:13,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:43:13,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:43:13,805 INFO L87 Difference]: Start difference. First operand 161 states and 163 transitions. Second operand 8 states. [2018-10-10 14:43:14,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:14,057 INFO L93 Difference]: Finished difference Result 194 states and 196 transitions. [2018-10-10 14:43:14,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:43:14,057 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 89 [2018-10-10 14:43:14,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:14,059 INFO L225 Difference]: With dead ends: 194 [2018-10-10 14:43:14,059 INFO L226 Difference]: Without dead ends: 194 [2018-10-10 14:43:14,060 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:43:14,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-10-10 14:43:14,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 167. [2018-10-10 14:43:14,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-10-10 14:43:14,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 169 transitions. [2018-10-10 14:43:14,065 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 169 transitions. Word has length 89 [2018-10-10 14:43:14,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:14,065 INFO L481 AbstractCegarLoop]: Abstraction has 167 states and 169 transitions. [2018-10-10 14:43:14,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:43:14,065 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 169 transitions. [2018-10-10 14:43:14,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-10 14:43:14,067 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:14,067 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:43:14,068 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:14,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:14,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1694247296, now seen corresponding path program 1 times [2018-10-10 14:43:14,068 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:14,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:14,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:14,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:14,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:14,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:14,376 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:14,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:43:14,377 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:43:14,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:14,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:14,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:43:14,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 14:43:14,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:14,478 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:14,478 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-10 14:43:14,621 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:14,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:43:14,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 19 [2018-10-10 14:43:14,662 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/standard_strcpy_false-valid-deref_ground.i_10.bpl [2018-10-10 14:43:14,663 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-10 14:43:14,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-10 14:43:14,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-10-10 14:43:14,664 INFO L87 Difference]: Start difference. First operand 167 states and 169 transitions. Second operand 20 states. [2018-10-10 14:43:15,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:15,379 INFO L93 Difference]: Finished difference Result 301 states and 304 transitions. [2018-10-10 14:43:15,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-10 14:43:15,386 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 96 [2018-10-10 14:43:15,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:15,388 INFO L225 Difference]: With dead ends: 301 [2018-10-10 14:43:15,388 INFO L226 Difference]: Without dead ends: 301 [2018-10-10 14:43:15,389 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=194, Invalid=562, Unknown=0, NotChecked=0, Total=756 [2018-10-10 14:43:15,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-10-10 14:43:15,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 178. [2018-10-10 14:43:15,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-10-10 14:43:15,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 180 transitions. [2018-10-10 14:43:15,394 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 180 transitions. Word has length 96 [2018-10-10 14:43:15,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:15,394 INFO L481 AbstractCegarLoop]: Abstraction has 178 states and 180 transitions. [2018-10-10 14:43:15,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-10 14:43:15,394 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 180 transitions. [2018-10-10 14:43:15,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-10 14:43:15,400 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:15,400 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-10 14:43:15,400 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:15,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:15,401 INFO L82 PathProgramCache]: Analyzing trace with hash -184123248, now seen corresponding path program 1 times [2018-10-10 14:43:15,401 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:15,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:15,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:15,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:15,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:15,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:15,877 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-10-10 14:43:15,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:43:15,878 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:43:15,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:15,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:15,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:43:16,558 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:16,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:43:16,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 20 [2018-10-10 14:43:16,605 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/standard_strcpy_false-valid-deref_ground.i_11.bpl [2018-10-10 14:43:16,607 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-10 14:43:16,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-10 14:43:16,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2018-10-10 14:43:16,608 INFO L87 Difference]: Start difference. First operand 178 states and 180 transitions. Second operand 21 states. [2018-10-10 14:43:17,570 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2018-10-10 14:43:18,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:18,508 INFO L93 Difference]: Finished difference Result 209 states and 211 transitions. [2018-10-10 14:43:18,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 14:43:18,509 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 99 [2018-10-10 14:43:18,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:18,511 INFO L225 Difference]: With dead ends: 209 [2018-10-10 14:43:18,511 INFO L226 Difference]: Without dead ends: 209 [2018-10-10 14:43:18,513 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=441, Invalid=1119, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 14:43:18,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-10-10 14:43:18,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 188. [2018-10-10 14:43:18,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-10-10 14:43:18,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 190 transitions. [2018-10-10 14:43:18,518 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 190 transitions. Word has length 99 [2018-10-10 14:43:18,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:18,518 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 190 transitions. [2018-10-10 14:43:18,519 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-10 14:43:18,519 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 190 transitions. [2018-10-10 14:43:18,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-10 14:43:18,521 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:18,521 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:43:18,522 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:43:18,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:18,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1411445064, now seen corresponding path program 2 times [2018-10-10 14:43:18,522 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:18,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:18,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:18,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:18,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:18,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:19,102 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-10 14:43:19,293 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-10 14:43:19,590 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:19,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:43:19,590 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:43:19,598 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-10 14:43:19,652 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-10 14:43:19,652 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-10 14:43:19,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:43:19,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 14:43:19,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:19,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:19,752 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-10 14:43:19,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 14:43:19,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:19,854 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:19,854 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-10-10 14:43:19,885 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:43:19,886 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:43:19,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-10 14:43:19,887 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:19,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:19,895 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2018-10-10 14:43:19,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-10-10 14:43:19,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:19,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:19,909 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:9 [2018-10-10 14:43:20,114 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:20,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:43:20,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 18 [2018-10-10 14:43:20,137 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-10 14:43:20,144 WARN L205 ceAbstractionStarter]: Timeout [2018-10-10 14:43:20,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 02:43:20 BoogieIcfgContainer [2018-10-10 14:43:20,144 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 14:43:20,145 INFO L168 Benchmark]: Toolchain (without parser) took 17416.97 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -974.0 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:20,147 INFO L168 Benchmark]: CDTParser took 0.18 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:20,147 INFO L168 Benchmark]: CACSL2BoogieTranslator took 298.09 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:20,148 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.27 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:20,148 INFO L168 Benchmark]: Boogie Preprocessor took 36.05 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:20,148 INFO L168 Benchmark]: RCFGBuilder took 986.97 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -772.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:20,149 INFO L168 Benchmark]: TraceAbstraction took 16033.71 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 274.2 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -212.4 MB). Peak memory consumption was 61.8 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:20,154 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.18 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 298.09 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 57.27 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 36.05 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 986.97 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -772.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16033.71 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 274.2 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -212.4 MB). Peak memory consumption was 61.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 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: 3]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 3). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 12). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 137 locations, 11 error locations. TIMEOUT Result, 15.9s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 8.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1171 SDtfs, 9233 SDslu, 3375 SDs, 0 SdLazy, 2352 SolverSat, 220 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 471 GetRequests, 269 SyntacticMatches, 6 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 7.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=188occurred in iteration=11, 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, 11 MinimizatonAttempts, 485 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 994 NumberOfCodeBlocks, 994 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 980 ConstructedInterpolants, 28 QuantifiedInterpolants, 642534 SizeOfPredicates, 31 NumberOfNonLiveVariables, 496 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 14 InterpolantComputations, 8 PerfectInterpolantSequences, 25/102 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Received shutdown request...