java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --traceabstraction.dump.automata.to.the.following.directory dump --rcfgbuilder.size.of.a.code.block SingleStatement --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c5b1954-m [2018-10-10 14:42:11,137 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 14:42:11,138 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 14:42:11,157 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 14:42:11,157 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 14:42:11,158 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 14:42:11,159 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 14:42:11,161 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 14:42:11,163 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 14:42:11,164 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 14:42:11,165 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 14:42:11,165 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 14:42:11,166 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 14:42:11,167 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 14:42:11,169 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 14:42:11,169 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 14:42:11,170 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 14:42:11,172 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 14:42:11,177 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 14:42:11,182 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 14:42:11,184 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 14:42:11,187 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 14:42:11,192 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 14:42:11,192 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 14:42:11,192 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 14:42:11,196 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 14:42:11,197 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 14:42:11,200 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 14:42:11,200 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 14:42:11,201 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 14:42:11,203 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 14:42:11,204 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 14:42:11,204 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 14:42:11,204 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 14:42:11,207 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 14:42:11,208 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 14:42:11,209 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-10-10 14:42:11,234 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 14:42:11,235 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 14:42:11,236 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-10 14:42:11,236 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-10 14:42:11,236 INFO L133 SettingsManager]: * Use SBE=true [2018-10-10 14:42:11,236 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-10 14:42:11,237 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-10 14:42:11,237 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-10 14:42:11,237 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-10 14:42:11,237 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-10 14:42:11,238 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-10 14:42:11,238 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-10 14:42:11,238 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-10 14:42:11,238 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-10 14:42:11,238 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-10 14:42:11,239 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-10 14:42:11,239 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 14:42:11,239 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-10 14:42:11,239 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-10 14:42:11,240 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-10 14:42:11,240 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:42:11,240 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 14:42:11,240 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-10 14:42:11,241 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-10 14:42:11,241 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-10 14:42:11,241 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Dump automata to the following directory -> dump Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> SingleStatement Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-10-10 14:42:11,288 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 14:42:11,301 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 14:42:11,304 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 14:42:11,306 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-10 14:42:11,306 INFO L276 PluginConnector]: CDTParser initialized [2018-10-10 14:42:11,307 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:42:11,596 INFO L217 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27dba66d2/52ea820e9b394b359dbe0f6339cd6b35/FLAG973f12f7b [2018-10-10 14:42:11,877 INFO L289 CDTParser]: Found 1 translation units. [2018-10-10 14:42:11,878 INFO L157 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-memsafety/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:42:11,891 INFO L337 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27dba66d2/52ea820e9b394b359dbe0f6339cd6b35/FLAG973f12f7b [2018-10-10 14:42:11,907 INFO L345 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27dba66d2/52ea820e9b394b359dbe0f6339cd6b35 [2018-10-10 14:42:11,916 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 14:42:11,918 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-10 14:42:11,919 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-10 14:42:11,919 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-10 14:42:11,923 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-10 14:42:11,924 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:42:11" (1/1) ... [2018-10-10 14:42:11,927 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18497835 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:11, skipping insertion in model container [2018-10-10 14:42:11,928 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:42:11" (1/1) ... [2018-10-10 14:42:11,939 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-10 14:42:12,005 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-10 14:42:12,265 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:42:12,279 INFO L189 MainTranslator]: Completed pre-run [2018-10-10 14:42:12,360 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:42:12,432 INFO L193 MainTranslator]: Completed translation [2018-10-10 14:42:12,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:12 WrapperNode [2018-10-10 14:42:12,433 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-10 14:42:12,434 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-10 14:42:12,434 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-10 14:42:12,434 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-10 14:42:12,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:12" (1/1) ... [2018-10-10 14:42:12,469 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:12" (1/1) ... [2018-10-10 14:42:12,513 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-10 14:42:12,514 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 14:42:12,514 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 14:42:12,515 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 14:42:12,525 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:12" (1/1) ... [2018-10-10 14:42:12,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:12" (1/1) ... [2018-10-10 14:42:12,535 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:12" (1/1) ... [2018-10-10 14:42:12,536 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:12" (1/1) ... [2018-10-10 14:42:12,552 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:12" (1/1) ... [2018-10-10 14:42:12,563 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:12" (1/1) ... [2018-10-10 14:42:12,567 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:12" (1/1) ... [2018-10-10 14:42:12,647 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 14:42:12,648 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 14:42:12,648 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 14:42:12,648 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 14:42:12,649 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:42:12,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 14:42:12,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 14:42:13,585 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 14:42:13,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:42:13 BoogieIcfgContainer [2018-10-10 14:42:13,586 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 14:42:13,587 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 14:42:13,587 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 14:42:13,590 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 14:42:13,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 02:42:11" (1/3) ... [2018-10-10 14:42:13,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430b4a7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:42:13, skipping insertion in model container [2018-10-10 14:42:13,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:12" (2/3) ... [2018-10-10 14:42:13,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@430b4a7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:42:13, skipping insertion in model container [2018-10-10 14:42:13,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:42:13" (3/3) ... [2018-10-10 14:42:13,594 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:42:13,603 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-10 14:42:13,611 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-10-10 14:42:13,628 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2018-10-10 14:42:13,655 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 14:42:13,656 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 14:42:13,656 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 14:42:13,657 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-10 14:42:13,657 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 14:42:13,658 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 14:42:13,658 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 14:42:13,658 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 14:42:13,658 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 14:42:13,682 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states. [2018-10-10 14:42:13,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-10 14:42:13,698 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:13,702 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:13,707 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:13,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:13,715 INFO L82 PathProgramCache]: Analyzing trace with hash 989039711, now seen corresponding path program 1 times [2018-10-10 14:42:13,716 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:13,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:13,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:13,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:13,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:13,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:14,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:14,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:14,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:42:14,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:42:14,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:42:14,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:42:14,240 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 8 states. [2018-10-10 14:42:15,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:15,146 INFO L93 Difference]: Finished difference Result 146 states and 149 transitions. [2018-10-10 14:42:15,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:42:15,148 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-10-10 14:42:15,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:15,162 INFO L225 Difference]: With dead ends: 146 [2018-10-10 14:42:15,162 INFO L226 Difference]: Without dead ends: 141 [2018-10-10 14:42:15,164 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:42:15,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-10-10 14:42:15,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-10-10 14:42:15,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-10-10 14:42:15,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 144 transitions. [2018-10-10 14:42:15,211 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 144 transitions. Word has length 46 [2018-10-10 14:42:15,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:15,212 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 144 transitions. [2018-10-10 14:42:15,212 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:42:15,213 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 144 transitions. [2018-10-10 14:42:15,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-10 14:42:15,214 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:15,214 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:15,215 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:15,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:15,215 INFO L82 PathProgramCache]: Analyzing trace with hash 595460060, now seen corresponding path program 1 times [2018-10-10 14:42:15,216 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:15,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:15,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:15,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:15,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:15,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:15,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:15,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:15,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-10 14:42:15,676 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 14:42:15,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 14:42:15,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:42:15,677 INFO L87 Difference]: Start difference. First operand 141 states and 144 transitions. Second operand 13 states. [2018-10-10 14:42:17,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:17,161 INFO L93 Difference]: Finished difference Result 140 states and 143 transitions. [2018-10-10 14:42:17,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 14:42:17,161 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2018-10-10 14:42:17,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:17,165 INFO L225 Difference]: With dead ends: 140 [2018-10-10 14:42:17,165 INFO L226 Difference]: Without dead ends: 140 [2018-10-10 14:42:17,167 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2018-10-10 14:42:17,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-10-10 14:42:17,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-10-10 14:42:17,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-10 14:42:17,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 143 transitions. [2018-10-10 14:42:17,178 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 143 transitions. Word has length 47 [2018-10-10 14:42:17,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:17,179 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 143 transitions. [2018-10-10 14:42:17,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 14:42:17,179 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 143 transitions. [2018-10-10 14:42:17,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-10 14:42:17,181 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:17,181 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:17,182 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:17,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:17,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1452289403, now seen corresponding path program 1 times [2018-10-10 14:42:17,182 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:17,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:17,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:17,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:17,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:17,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:17,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:17,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:17,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:42:17,281 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:42:17,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:42:17,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:42:17,282 INFO L87 Difference]: Start difference. First operand 140 states and 143 transitions. Second operand 6 states. [2018-10-10 14:42:17,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:17,489 INFO L93 Difference]: Finished difference Result 139 states and 142 transitions. [2018-10-10 14:42:17,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 14:42:17,490 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-10-10 14:42:17,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:17,492 INFO L225 Difference]: With dead ends: 139 [2018-10-10 14:42:17,493 INFO L226 Difference]: Without dead ends: 139 [2018-10-10 14:42:17,493 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:42:17,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-10 14:42:17,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-10-10 14:42:17,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-10-10 14:42:17,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 142 transitions. [2018-10-10 14:42:17,503 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 142 transitions. Word has length 56 [2018-10-10 14:42:17,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:17,504 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 142 transitions. [2018-10-10 14:42:17,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:42:17,504 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 142 transitions. [2018-10-10 14:42:17,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-10 14:42:17,506 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:17,506 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:17,507 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:17,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:17,507 INFO L82 PathProgramCache]: Analyzing trace with hash -2071298430, now seen corresponding path program 1 times [2018-10-10 14:42:17,508 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:17,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:17,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:17,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:17,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:17,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:17,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:17,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:17,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:42:17,727 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:42:17,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:42:17,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:42:17,727 INFO L87 Difference]: Start difference. First operand 139 states and 142 transitions. Second operand 9 states. [2018-10-10 14:42:18,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:18,147 INFO L93 Difference]: Finished difference Result 138 states and 141 transitions. [2018-10-10 14:42:18,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:42:18,148 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2018-10-10 14:42:18,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:18,150 INFO L225 Difference]: With dead ends: 138 [2018-10-10 14:42:18,150 INFO L226 Difference]: Without dead ends: 138 [2018-10-10 14:42:18,151 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:42:18,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-10-10 14:42:18,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-10-10 14:42:18,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-10-10 14:42:18,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 141 transitions. [2018-10-10 14:42:18,159 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 141 transitions. Word has length 57 [2018-10-10 14:42:18,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:18,160 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 141 transitions. [2018-10-10 14:42:18,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:42:18,160 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 141 transitions. [2018-10-10 14:42:18,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-10 14:42:18,162 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:18,162 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:18,163 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:18,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:18,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1134783883, now seen corresponding path program 1 times [2018-10-10 14:42:18,163 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:18,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:18,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:18,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:18,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:18,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:18,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:18,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:18,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-10 14:42:18,305 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 14:42:18,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 14:42:18,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-10 14:42:18,306 INFO L87 Difference]: Start difference. First operand 138 states and 141 transitions. Second operand 10 states. [2018-10-10 14:42:18,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:18,794 INFO L93 Difference]: Finished difference Result 143 states and 146 transitions. [2018-10-10 14:42:18,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 14:42:18,795 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 80 [2018-10-10 14:42:18,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:18,797 INFO L225 Difference]: With dead ends: 143 [2018-10-10 14:42:18,797 INFO L226 Difference]: Without dead ends: 143 [2018-10-10 14:42:18,798 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-10-10 14:42:18,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-10-10 14:42:18,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 137. [2018-10-10 14:42:18,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-10-10 14:42:18,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 140 transitions. [2018-10-10 14:42:18,806 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 140 transitions. Word has length 80 [2018-10-10 14:42:18,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:18,806 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 140 transitions. [2018-10-10 14:42:18,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 14:42:18,807 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 140 transitions. [2018-10-10 14:42:18,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-10 14:42:18,808 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:18,808 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:18,809 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:18,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:18,809 INFO L82 PathProgramCache]: Analyzing trace with hash -818561869, now seen corresponding path program 1 times [2018-10-10 14:42:18,810 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:18,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:18,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:18,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:18,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:18,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:19,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:19,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:19,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-10 14:42:19,136 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 14:42:19,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 14:42:19,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:42:19,138 INFO L87 Difference]: Start difference. First operand 137 states and 140 transitions. Second operand 13 states. [2018-10-10 14:42:20,174 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-10-10 14:42:20,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:20,362 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2018-10-10 14:42:20,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-10 14:42:20,363 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 81 [2018-10-10 14:42:20,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:20,365 INFO L225 Difference]: With dead ends: 160 [2018-10-10 14:42:20,365 INFO L226 Difference]: Without dead ends: 160 [2018-10-10 14:42:20,366 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=191, Invalid=511, Unknown=0, NotChecked=0, Total=702 [2018-10-10 14:42:20,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-10 14:42:20,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 145. [2018-10-10 14:42:20,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-10-10 14:42:20,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 148 transitions. [2018-10-10 14:42:20,373 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 148 transitions. Word has length 81 [2018-10-10 14:42:20,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:20,374 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 148 transitions. [2018-10-10 14:42:20,374 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 14:42:20,374 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 148 transitions. [2018-10-10 14:42:20,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-10 14:42:20,376 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:20,376 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:20,377 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:20,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:20,377 INFO L82 PathProgramCache]: Analyzing trace with hash -552777508, now seen corresponding path program 1 times [2018-10-10 14:42:20,378 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:20,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:20,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:20,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:20,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:20,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:20,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:20,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:20,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-10 14:42:20,513 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 14:42:20,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 14:42:20,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-10-10 14:42:20,514 INFO L87 Difference]: Start difference. First operand 145 states and 148 transitions. Second operand 10 states. [2018-10-10 14:42:20,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:20,943 INFO L93 Difference]: Finished difference Result 154 states and 157 transitions. [2018-10-10 14:42:20,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 14:42:20,944 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2018-10-10 14:42:20,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:20,946 INFO L225 Difference]: With dead ends: 154 [2018-10-10 14:42:20,947 INFO L226 Difference]: Without dead ends: 154 [2018-10-10 14:42:20,947 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2018-10-10 14:42:20,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-10-10 14:42:20,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 144. [2018-10-10 14:42:20,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-10-10 14:42:20,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 147 transitions. [2018-10-10 14:42:20,953 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 147 transitions. Word has length 97 [2018-10-10 14:42:20,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:20,954 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 147 transitions. [2018-10-10 14:42:20,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 14:42:20,954 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 147 transitions. [2018-10-10 14:42:20,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-10 14:42:20,956 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:20,956 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:20,956 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:20,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:20,957 INFO L82 PathProgramCache]: Analyzing trace with hash 43766594, now seen corresponding path program 1 times [2018-10-10 14:42:20,957 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:20,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:20,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:20,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:20,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:20,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:21,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:21,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:21,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-10 14:42:21,254 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 14:42:21,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 14:42:21,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:42:21,255 INFO L87 Difference]: Start difference. First operand 144 states and 147 transitions. Second operand 13 states. [2018-10-10 14:42:22,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:22,001 INFO L93 Difference]: Finished difference Result 196 states and 200 transitions. [2018-10-10 14:42:22,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-10 14:42:22,001 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 98 [2018-10-10 14:42:22,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:22,004 INFO L225 Difference]: With dead ends: 196 [2018-10-10 14:42:22,004 INFO L226 Difference]: Without dead ends: 196 [2018-10-10 14:42:22,005 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=224, Invalid=478, Unknown=0, NotChecked=0, Total=702 [2018-10-10 14:42:22,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-10-10 14:42:22,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 151. [2018-10-10 14:42:22,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-10-10 14:42:22,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 154 transitions. [2018-10-10 14:42:22,012 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 154 transitions. Word has length 98 [2018-10-10 14:42:22,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:22,014 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 154 transitions. [2018-10-10 14:42:22,015 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 14:42:22,015 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 154 transitions. [2018-10-10 14:42:22,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-10 14:42:22,017 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:22,017 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:22,017 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:22,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:22,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1896480723, now seen corresponding path program 1 times [2018-10-10 14:42:22,018 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:22,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:22,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:22,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:22,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:22,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:23,330 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:23,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:23,331 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:42:23,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:23,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:23,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:23,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 14:42:23,478 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:23,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:23,583 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-10 14:42:24,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-10 14:42:24,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-10 14:42:24,043 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:24,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:24,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:42:24,064 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-10-10 14:42:25,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-10 14:42:25,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-10-10 14:42:25,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-10 14:42:25,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:42:25,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:42:25,069 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-10-10 14:42:25,529 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:25,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:42:25,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 36 [2018-10-10 14:42:25,604 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i_9.bpl [2018-10-10 14:42:25,609 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-10 14:42:25,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-10 14:42:25,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1230, Unknown=0, NotChecked=0, Total=1332 [2018-10-10 14:42:25,610 INFO L87 Difference]: Start difference. First operand 151 states and 154 transitions. Second operand 37 states. [2018-10-10 14:42:27,654 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 80 [2018-10-10 14:42:27,937 WARN L178 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2018-10-10 14:42:28,226 WARN L178 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 89 [2018-10-10 14:42:28,558 WARN L178 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 92 [2018-10-10 14:42:28,867 WARN L178 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 89 [2018-10-10 14:42:29,198 WARN L178 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 86 [2018-10-10 14:42:29,407 WARN L178 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 78 [2018-10-10 14:42:29,640 WARN L178 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 83 [2018-10-10 14:42:30,069 WARN L178 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2018-10-10 14:42:30,298 WARN L178 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 74 [2018-10-10 14:42:30,817 WARN L178 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2018-10-10 14:42:31,045 WARN L178 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 81 [2018-10-10 14:42:31,235 WARN L178 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2018-10-10 14:42:31,672 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2018-10-10 14:42:31,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:31,737 INFO L93 Difference]: Finished difference Result 266 states and 271 transitions. [2018-10-10 14:42:31,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-10 14:42:31,737 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 116 [2018-10-10 14:42:31,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:31,739 INFO L225 Difference]: With dead ends: 266 [2018-10-10 14:42:31,739 INFO L226 Difference]: Without dead ends: 266 [2018-10-10 14:42:31,741 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=893, Invalid=3397, Unknown=0, NotChecked=0, Total=4290 [2018-10-10 14:42:31,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-10-10 14:42:31,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 169. [2018-10-10 14:42:31,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-10-10 14:42:31,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 174 transitions. [2018-10-10 14:42:31,747 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 174 transitions. Word has length 116 [2018-10-10 14:42:31,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:31,747 INFO L481 AbstractCegarLoop]: Abstraction has 169 states and 174 transitions. [2018-10-10 14:42:31,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-10 14:42:31,747 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 174 transitions. [2018-10-10 14:42:31,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-10-10 14:42:31,749 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:31,749 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:31,750 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:31,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:31,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1448105394, now seen corresponding path program 1 times [2018-10-10 14:42:31,750 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:31,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:31,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:31,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:31,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:31,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:32,796 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:32,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:32,797 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:42:32,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:32,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:32,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 14:42:32,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:32,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:32,892 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-10 14:42:33,034 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:33,053 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:33,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-10 14:42:33,054 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:33,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:33,064 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-10-10 14:42:33,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-10 14:42:33,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-10 14:42:33,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:33,203 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:33,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:42:33,213 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-10-10 14:42:33,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-10-10 14:42:33,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-10 14:42:33,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:33,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:33,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:42:33,423 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:36, output treesize:21 [2018-10-10 14:42:33,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-10 14:42:34,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-10-10 14:42:34,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-10 14:42:34,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:42:34,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:42:34,123 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-10-10 14:42:34,525 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:34,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:42:34,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 47 [2018-10-10 14:42:34,569 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/openbsd_cstrcspn-alloca_true-valid-memsafety_true-termination.i_10.bpl [2018-10-10 14:42:34,570 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-10 14:42:34,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-10 14:42:34,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=2123, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 14:42:34,572 INFO L87 Difference]: Start difference. First operand 169 states and 174 transitions. Second operand 48 states. [2018-10-10 14:42:37,066 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 88 [2018-10-10 14:42:37,385 WARN L178 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 94 [2018-10-10 14:42:37,667 WARN L178 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 97 [2018-10-10 14:42:37,940 WARN L178 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 101 [2018-10-10 14:42:38,349 WARN L178 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 98 [2018-10-10 14:42:38,600 WARN L178 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 95 [2018-10-10 14:42:38,789 WARN L178 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 84 [2018-10-10 14:42:39,207 WARN L178 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 85 [2018-10-10 14:42:39,747 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2018-10-10 14:42:40,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:40,816 INFO L93 Difference]: Finished difference Result 269 states and 277 transitions. [2018-10-10 14:42:40,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-10 14:42:40,816 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 117 [2018-10-10 14:42:40,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:40,818 INFO L225 Difference]: With dead ends: 269 [2018-10-10 14:42:40,819 INFO L226 Difference]: Without dead ends: 269 [2018-10-10 14:42:40,822 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1395 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=1199, Invalid=6283, Unknown=0, NotChecked=0, Total=7482 [2018-10-10 14:42:40,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-10-10 14:42:40,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 230. [2018-10-10 14:42:40,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-10-10 14:42:40,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 240 transitions. [2018-10-10 14:42:40,828 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 240 transitions. Word has length 117 [2018-10-10 14:42:40,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:40,828 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 240 transitions. [2018-10-10 14:42:40,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-10 14:42:40,829 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 240 transitions. [2018-10-10 14:42:40,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-10 14:42:40,830 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:40,830 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:40,832 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:40,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:40,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1858421435, now seen corresponding path program 1 times [2018-10-10 14:42:40,833 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:40,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:40,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:40,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:40,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:40,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:41,541 WARN L178 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-10-10 14:42:41,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:41,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:41,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-10-10 14:42:41,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 14:42:41,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 14:42:41,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-10-10 14:42:41,902 INFO L87 Difference]: Start difference. First operand 230 states and 240 transitions. Second operand 16 states. [2018-10-10 14:42:42,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:42,692 INFO L93 Difference]: Finished difference Result 229 states and 239 transitions. [2018-10-10 14:42:42,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 14:42:42,693 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 128 [2018-10-10 14:42:42,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:42,694 INFO L225 Difference]: With dead ends: 229 [2018-10-10 14:42:42,695 INFO L226 Difference]: Without dead ends: 207 [2018-10-10 14:42:42,695 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=148, Invalid=974, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 14:42:42,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-10-10 14:42:42,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-10-10 14:42:42,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-10-10 14:42:42,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 214 transitions. [2018-10-10 14:42:42,700 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 214 transitions. Word has length 128 [2018-10-10 14:42:42,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:42,701 INFO L481 AbstractCegarLoop]: Abstraction has 207 states and 214 transitions. [2018-10-10 14:42:42,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 14:42:42,701 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 214 transitions. [2018-10-10 14:42:42,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-10 14:42:42,702 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:42,702 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:42,703 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:42,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:42,703 INFO L82 PathProgramCache]: Analyzing trace with hash 642157092, now seen corresponding path program 2 times [2018-10-10 14:42:42,703 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:42,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:42,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:42,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:42,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:43,594 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:43,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:43,594 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:42:43,602 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-10 14:42:43,643 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-10 14:42:43,643 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-10 14:42:43,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:43,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 14:42:43,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:43,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:43,742 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-10 14:42:43,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-10 14:42:43,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-10 14:42:43,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:43,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:43,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:42:43,937 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:27 [2018-10-10 14:42:45,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-10 14:42:45,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-10-10 14:42:45,337 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-10 14:42:45,341 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:42:45,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:42:45,358 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:29 [2018-10-10 14:42:45,682 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:45,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:42:45,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 45 [2018-10-10 14:42:45,703 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-10 14:42:45,707 WARN L205 ceAbstractionStarter]: Timeout [2018-10-10 14:42:45,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 02:42:45 BoogieIcfgContainer [2018-10-10 14:42:45,707 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 14:42:45,708 INFO L168 Benchmark]: Toolchain (without parser) took 33791.18 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -727.1 MB). Peak memory consumption was 351.4 MB. Max. memory is 7.1 GB. [2018-10-10 14:42:45,709 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:42:45,709 INFO L168 Benchmark]: CACSL2BoogieTranslator took 514.86 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-10 14:42:45,710 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.85 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:42:45,710 INFO L168 Benchmark]: Boogie Preprocessor took 133.29 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 757.1 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -848.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 7.1 GB. [2018-10-10 14:42:45,711 INFO L168 Benchmark]: RCFGBuilder took 938.16 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 61.3 MB). Peak memory consumption was 61.3 MB. Max. memory is 7.1 GB. [2018-10-10 14:42:45,712 INFO L168 Benchmark]: TraceAbstraction took 32120.62 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 321.4 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 39.2 MB). Peak memory consumption was 360.6 MB. Max. memory is 7.1 GB. [2018-10-10 14:42:45,716 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 514.86 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 79.85 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 133.29 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 757.1 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -848.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 938.16 ms. Allocated memory is still 2.3 GB. Free memory was 2.3 GB in the beginning and 2.2 GB in the end (delta: 61.3 MB). Peak memory consumption was 61.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 32120.62 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 321.4 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 39.2 MB). Peak memory consumption was 360.6 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: 554]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 554). 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). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 147 locations, 9 error locations. TIMEOUT Result, 32.0s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 19.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1325 SDtfs, 9974 SDslu, 8627 SDs, 0 SdLazy, 4371 SolverSat, 144 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 526 GetRequests, 210 SyntacticMatches, 4 SemanticMatches, 312 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2462 ImplicationChecksByTransitivity, 18.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=230occurred in iteration=10, 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, 212 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 1156 NumberOfCodeBlocks, 1156 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1143 ConstructedInterpolants, 75 QuantifiedInterpolants, 1108526 SizeOfPredicates, 72 NumberOfNonLiveVariables, 470 ConjunctsInSsa, 133 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 0/30 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Received shutdown request...