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_cstpcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c5b1954-m [2018-10-10 14:42:01,924 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 14:42:01,926 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 14:42:01,944 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 14:42:01,944 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 14:42:01,945 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 14:42:01,946 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 14:42:01,948 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 14:42:01,951 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 14:42:01,952 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 14:42:01,954 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 14:42:01,954 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 14:42:01,955 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 14:42:01,956 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 14:42:01,957 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 14:42:01,958 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 14:42:01,966 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 14:42:01,968 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 14:42:01,974 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 14:42:01,975 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 14:42:01,977 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 14:42:01,979 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 14:42:01,985 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 14:42:01,985 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 14:42:01,985 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 14:42:01,986 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 14:42:01,988 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 14:42:01,992 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 14:42:01,992 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 14:42:01,993 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 14:42:01,994 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 14:42:01,994 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 14:42:01,994 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 14:42:01,995 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 14:42:01,997 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 14:42:01,997 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 14:42:01,999 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:02,023 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 14:42:02,024 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 14:42:02,025 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-10 14:42:02,025 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-10 14:42:02,025 INFO L133 SettingsManager]: * Use SBE=true [2018-10-10 14:42:02,025 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-10 14:42:02,026 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-10 14:42:02,026 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-10 14:42:02,026 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-10 14:42:02,026 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-10 14:42:02,026 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-10 14:42:02,026 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-10 14:42:02,027 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-10 14:42:02,027 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-10 14:42:02,027 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-10 14:42:02,027 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-10 14:42:02,027 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 14:42:02,028 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-10 14:42:02,028 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-10 14:42:02,028 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-10 14:42:02,028 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:42:02,028 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 14:42:02,029 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-10 14:42:02,029 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-10 14:42:02,029 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-10 14:42:02,029 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:02,088 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 14:42:02,105 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 14:42:02,109 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 14:42:02,110 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-10 14:42:02,111 INFO L276 PluginConnector]: CDTParser initialized [2018-10-10 14:42:02,111 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:42:02,401 INFO L217 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a1f6fad4/411cdf9d25df4e13a12e3744df2b88d3/FLAG319d73772 [2018-10-10 14:42:02,664 INFO L289 CDTParser]: Found 1 translation units. [2018-10-10 14:42:02,665 INFO L157 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-memsafety/openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:42:02,678 INFO L337 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a1f6fad4/411cdf9d25df4e13a12e3744df2b88d3/FLAG319d73772 [2018-10-10 14:42:02,694 INFO L345 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a1f6fad4/411cdf9d25df4e13a12e3744df2b88d3 [2018-10-10 14:42:02,703 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 14:42:02,705 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-10 14:42:02,706 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-10 14:42:02,706 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-10 14:42:02,710 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-10 14:42:02,711 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:42:02" (1/1) ... [2018-10-10 14:42:02,715 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bc136bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:02, skipping insertion in model container [2018-10-10 14:42:02,715 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:42:02" (1/1) ... [2018-10-10 14:42:02,726 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-10 14:42:02,794 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-10 14:42:03,090 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:42:03,105 INFO L189 MainTranslator]: Completed pre-run [2018-10-10 14:42:03,156 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:42:03,216 INFO L193 MainTranslator]: Completed translation [2018-10-10 14:42:03,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:03 WrapperNode [2018-10-10 14:42:03,217 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-10 14:42:03,218 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-10 14:42:03,218 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-10 14:42:03,218 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-10 14:42:03,228 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:03" (1/1) ... [2018-10-10 14:42:03,254 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:03" (1/1) ... [2018-10-10 14:42:03,285 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-10 14:42:03,285 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 14:42:03,285 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 14:42:03,285 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 14:42:03,294 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:03" (1/1) ... [2018-10-10 14:42:03,294 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:03" (1/1) ... [2018-10-10 14:42:03,298 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:03" (1/1) ... [2018-10-10 14:42:03,299 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:03" (1/1) ... [2018-10-10 14:42:03,305 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:03" (1/1) ... [2018-10-10 14:42:03,311 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:03" (1/1) ... [2018-10-10 14:42:03,312 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:03" (1/1) ... [2018-10-10 14:42:03,315 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 14:42:03,316 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 14:42:03,316 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 14:42:03,316 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 14:42:03,317 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:42:03,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 14:42:03,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 14:42:04,246 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 14:42:04,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:42:04 BoogieIcfgContainer [2018-10-10 14:42:04,247 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 14:42:04,248 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 14:42:04,248 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 14:42:04,251 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 14:42:04,251 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 02:42:02" (1/3) ... [2018-10-10 14:42:04,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c9ffcc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:42:04, skipping insertion in model container [2018-10-10 14:42:04,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:03" (2/3) ... [2018-10-10 14:42:04,253 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c9ffcc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:42:04, skipping insertion in model container [2018-10-10 14:42:04,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:42:04" (3/3) ... [2018-10-10 14:42:04,255 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:42:04,265 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-10 14:42:04,274 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-10-10 14:42:04,292 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2018-10-10 14:42:04,318 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 14:42:04,318 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 14:42:04,319 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 14:42:04,319 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-10 14:42:04,319 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 14:42:04,319 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 14:42:04,319 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 14:42:04,320 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 14:42:04,320 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 14:42:04,344 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2018-10-10 14:42:04,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-10 14:42:04,353 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:04,354 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:04,357 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:04,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:04,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1888490720, now seen corresponding path program 1 times [2018-10-10 14:42:04,366 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:04,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:04,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:04,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:04,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:04,547 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:04,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:04,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-10 14:42:04,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-10 14:42:04,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-10 14:42:04,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 14:42:04,577 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 3 states. [2018-10-10 14:42:04,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:04,873 INFO L93 Difference]: Finished difference Result 125 states and 128 transitions. [2018-10-10 14:42:04,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-10 14:42:04,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-10-10 14:42:04,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:04,887 INFO L225 Difference]: With dead ends: 125 [2018-10-10 14:42:04,888 INFO L226 Difference]: Without dead ends: 118 [2018-10-10 14:42:04,889 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 14:42:04,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-10-10 14:42:04,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-10-10 14:42:04,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-10-10 14:42:04,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 120 transitions. [2018-10-10 14:42:04,931 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 120 transitions. Word has length 19 [2018-10-10 14:42:04,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:04,931 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 120 transitions. [2018-10-10 14:42:04,932 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-10 14:42:04,932 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 120 transitions. [2018-10-10 14:42:04,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-10 14:42:04,933 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:04,933 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:04,934 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:04,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:04,934 INFO L82 PathProgramCache]: Analyzing trace with hash 260442721, now seen corresponding path program 1 times [2018-10-10 14:42:04,935 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:04,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:04,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:04,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:04,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:04,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:05,119 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:05,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:05,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:42:05,121 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:42:05,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:42:05,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:42:05,122 INFO L87 Difference]: Start difference. First operand 118 states and 120 transitions. Second operand 6 states. [2018-10-10 14:42:05,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:05,572 INFO L93 Difference]: Finished difference Result 117 states and 119 transitions. [2018-10-10 14:42:05,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 14:42:05,575 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-10-10 14:42:05,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:05,577 INFO L225 Difference]: With dead ends: 117 [2018-10-10 14:42:05,577 INFO L226 Difference]: Without dead ends: 117 [2018-10-10 14:42:05,580 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:42:05,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-10-10 14:42:05,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-10-10 14:42:05,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-10-10 14:42:05,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 119 transitions. [2018-10-10 14:42:05,592 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 119 transitions. Word has length 47 [2018-10-10 14:42:05,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:05,592 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 119 transitions. [2018-10-10 14:42:05,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:42:05,593 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 119 transitions. [2018-10-10 14:42:05,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-10 14:42:05,594 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:05,594 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] [2018-10-10 14:42:05,595 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:05,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:05,596 INFO L82 PathProgramCache]: Analyzing trace with hash -516210144, now seen corresponding path program 1 times [2018-10-10 14:42:05,596 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:05,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:05,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:05,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:05,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:06,204 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:06,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:06,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:42:06,206 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:42:06,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:42:06,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:42:06,207 INFO L87 Difference]: Start difference. First operand 117 states and 119 transitions. Second operand 9 states. [2018-10-10 14:42:06,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:06,818 INFO L93 Difference]: Finished difference Result 132 states and 134 transitions. [2018-10-10 14:42:06,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:42:06,818 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2018-10-10 14:42:06,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:06,820 INFO L225 Difference]: With dead ends: 132 [2018-10-10 14:42:06,821 INFO L226 Difference]: Without dead ends: 132 [2018-10-10 14:42:06,821 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:42:06,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-10-10 14:42:06,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 116. [2018-10-10 14:42:06,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-10-10 14:42:06,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 118 transitions. [2018-10-10 14:42:06,831 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 118 transitions. Word has length 48 [2018-10-10 14:42:06,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:06,832 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 118 transitions. [2018-10-10 14:42:06,832 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:42:06,832 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2018-10-10 14:42:06,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-10 14:42:06,834 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:06,834 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] [2018-10-10 14:42:06,834 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:06,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:06,835 INFO L82 PathProgramCache]: Analyzing trace with hash -104693206, now seen corresponding path program 1 times [2018-10-10 14:42:06,835 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:06,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:06,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:06,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:06,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:06,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:06,975 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:06,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:06,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:42:06,977 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:42:06,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:42:06,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:42:06,977 INFO L87 Difference]: Start difference. First operand 116 states and 118 transitions. Second operand 8 states. [2018-10-10 14:42:07,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:07,345 INFO L93 Difference]: Finished difference Result 118 states and 120 transitions. [2018-10-10 14:42:07,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:42:07,346 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2018-10-10 14:42:07,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:07,348 INFO L225 Difference]: With dead ends: 118 [2018-10-10 14:42:07,349 INFO L226 Difference]: Without dead ends: 118 [2018-10-10 14:42:07,350 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:42:07,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-10-10 14:42:07,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 115. [2018-10-10 14:42:07,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-10 14:42:07,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2018-10-10 14:42:07,358 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 63 [2018-10-10 14:42:07,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:07,359 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2018-10-10 14:42:07,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:42:07,359 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2018-10-10 14:42:07,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-10 14:42:07,360 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:07,361 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] [2018-10-10 14:42:07,361 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:07,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:07,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1049478028, now seen corresponding path program 1 times [2018-10-10 14:42:07,362 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:07,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:07,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:07,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:07,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:07,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:07,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:07,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:07,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-10 14:42:07,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 14:42:07,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 14:42:07,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:42:07,614 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand 11 states. [2018-10-10 14:42:08,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:08,207 INFO L93 Difference]: Finished difference Result 171 states and 173 transitions. [2018-10-10 14:42:08,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-10 14:42:08,207 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2018-10-10 14:42:08,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:08,210 INFO L225 Difference]: With dead ends: 171 [2018-10-10 14:42:08,211 INFO L226 Difference]: Without dead ends: 171 [2018-10-10 14:42:08,211 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=307, Unknown=0, NotChecked=0, Total=462 [2018-10-10 14:42:08,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-10-10 14:42:08,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 120. [2018-10-10 14:42:08,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-10-10 14:42:08,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 122 transitions. [2018-10-10 14:42:08,221 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 122 transitions. Word has length 64 [2018-10-10 14:42:08,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:08,221 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 122 transitions. [2018-10-10 14:42:08,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 14:42:08,222 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 122 transitions. [2018-10-10 14:42:08,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-10 14:42:08,223 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:08,224 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] [2018-10-10 14:42:08,224 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:08,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:08,225 INFO L82 PathProgramCache]: Analyzing trace with hash 165152498, now seen corresponding path program 1 times [2018-10-10 14:42:08,225 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:08,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:08,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:08,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:08,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:08,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:08,646 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:08,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:08,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-10 14:42:08,647 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 14:42:08,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 14:42:08,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-10-10 14:42:08,648 INFO L87 Difference]: Start difference. First operand 120 states and 122 transitions. Second operand 10 states. [2018-10-10 14:42:09,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:09,045 INFO L93 Difference]: Finished difference Result 119 states and 121 transitions. [2018-10-10 14:42:09,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 14:42:09,049 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 74 [2018-10-10 14:42:09,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:09,051 INFO L225 Difference]: With dead ends: 119 [2018-10-10 14:42:09,051 INFO L226 Difference]: Without dead ends: 119 [2018-10-10 14:42:09,051 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2018-10-10 14:42:09,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-10-10 14:42:09,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-10-10 14:42:09,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-10-10 14:42:09,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 121 transitions. [2018-10-10 14:42:09,061 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 121 transitions. Word has length 74 [2018-10-10 14:42:09,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:09,062 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 121 transitions. [2018-10-10 14:42:09,062 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 14:42:09,062 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2018-10-10 14:42:09,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-10 14:42:09,064 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:09,064 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] [2018-10-10 14:42:09,065 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:09,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:09,066 INFO L82 PathProgramCache]: Analyzing trace with hash 824760273, now seen corresponding path program 1 times [2018-10-10 14:42:09,066 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:09,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:09,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:09,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:09,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:09,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:09,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:09,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:09,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-10-10 14:42:09,509 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 14:42:09,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 14:42:09,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-10-10 14:42:09,510 INFO L87 Difference]: Start difference. First operand 119 states and 121 transitions. Second operand 15 states. [2018-10-10 14:42:10,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:10,853 INFO L93 Difference]: Finished difference Result 180 states and 182 transitions. [2018-10-10 14:42:10,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-10 14:42:10,855 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 75 [2018-10-10 14:42:10,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:10,857 INFO L225 Difference]: With dead ends: 180 [2018-10-10 14:42:10,857 INFO L226 Difference]: Without dead ends: 180 [2018-10-10 14:42:10,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=191, Invalid=739, Unknown=0, NotChecked=0, Total=930 [2018-10-10 14:42:10,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-10-10 14:42:10,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 130. [2018-10-10 14:42:10,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-10-10 14:42:10,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 132 transitions. [2018-10-10 14:42:10,870 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 132 transitions. Word has length 75 [2018-10-10 14:42:10,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:10,871 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 132 transitions. [2018-10-10 14:42:10,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 14:42:10,871 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 132 transitions. [2018-10-10 14:42:10,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-10 14:42:10,873 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:10,873 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:10,874 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:10,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:10,874 INFO L82 PathProgramCache]: Analyzing trace with hash 802902906, now seen corresponding path program 1 times [2018-10-10 14:42:10,875 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:10,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:10,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:10,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:10,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:10,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:11,397 WARN L178 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 24 [2018-10-10 14:42:11,637 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:11,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:11,638 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:11,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:11,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:11,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:11,766 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:11,767 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:11,778 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:11,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-10 14:42:11,980 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:11,983 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:11,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:11,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:11,997 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:11,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-10-10 14:42:12,436 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:12,452 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 12 [2018-10-10 14:42:12,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-10 14:42:12,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:42:12,610 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:12,610 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:40 [2018-10-10 14:42:13,091 WARN L178 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-10 14:42:13,336 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:13,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:42:13,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 27 [2018-10-10 14:42:13,408 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i_8.bpl [2018-10-10 14:42:13,412 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-10 14:42:13,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-10 14:42:13,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=682, Unknown=0, NotChecked=0, Total=756 [2018-10-10 14:42:13,413 INFO L87 Difference]: Start difference. First operand 130 states and 132 transitions. Second operand 28 states. [2018-10-10 14:42:14,666 WARN L178 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 69 [2018-10-10 14:42:15,027 WARN L178 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2018-10-10 14:42:15,210 WARN L178 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2018-10-10 14:42:16,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:16,104 INFO L93 Difference]: Finished difference Result 220 states and 222 transitions. [2018-10-10 14:42:16,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-10 14:42:16,104 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 93 [2018-10-10 14:42:16,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:16,106 INFO L225 Difference]: With dead ends: 220 [2018-10-10 14:42:16,106 INFO L226 Difference]: Without dead ends: 220 [2018-10-10 14:42:16,108 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=441, Invalid=1911, Unknown=0, NotChecked=0, Total=2352 [2018-10-10 14:42:16,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-10-10 14:42:16,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 148. [2018-10-10 14:42:16,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-10-10 14:42:16,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 151 transitions. [2018-10-10 14:42:16,113 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 151 transitions. Word has length 93 [2018-10-10 14:42:16,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:16,114 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 151 transitions. [2018-10-10 14:42:16,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-10 14:42:16,114 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 151 transitions. [2018-10-10 14:42:16,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-10 14:42:16,116 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:16,116 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] [2018-10-10 14:42:16,117 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:16,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:16,117 INFO L82 PathProgramCache]: Analyzing trace with hash 890793763, now seen corresponding path program 1 times [2018-10-10 14:42:16,117 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:16,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:16,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:16,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:16,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:16,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:16,855 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 6 [2018-10-10 14:42:16,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:16,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:16,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-10-10 14:42:16,953 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 14:42:16,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 14:42:16,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-10-10 14:42:16,953 INFO L87 Difference]: Start difference. First operand 148 states and 151 transitions. Second operand 16 states. [2018-10-10 14:42:17,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:17,826 INFO L93 Difference]: Finished difference Result 147 states and 150 transitions. [2018-10-10 14:42:17,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 14:42:17,827 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 102 [2018-10-10 14:42:17,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:17,828 INFO L225 Difference]: With dead ends: 147 [2018-10-10 14:42:17,828 INFO L226 Difference]: Without dead ends: 126 [2018-10-10 14:42:17,829 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=148, Invalid=974, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 14:42:17,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-10 14:42:17,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-10-10 14:42:17,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-10-10 14:42:17,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 128 transitions. [2018-10-10 14:42:17,833 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 128 transitions. Word has length 102 [2018-10-10 14:42:17,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:17,834 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 128 transitions. [2018-10-10 14:42:17,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 14:42:17,834 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 128 transitions. [2018-10-10 14:42:17,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-10 14:42:17,836 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:17,836 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:17,836 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:17,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:17,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1069308125, now seen corresponding path program 1 times [2018-10-10 14:42:17,837 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:17,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:17,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:17,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:17,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:17,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:18,983 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:18,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:18,983 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:18,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:19,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:19,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:19,068 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:19,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:19,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:19,138 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-10 14:42:19,154 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:19,155 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:19,262 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:19,263 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-10-10 14:42:19,326 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:19,329 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:19,330 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:19,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:19,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:19,342 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2018-10-10 14:42:19,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-10-10 14:42:19,466 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:19,480 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:19,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2018-10-10 14:42:20,440 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:20,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:42:20,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 36 [2018-10-10 14:42:20,486 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i_10.bpl [2018-10-10 14:42:20,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-10 14:42:20,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-10 14:42:20,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1250, Unknown=0, NotChecked=0, Total=1332 [2018-10-10 14:42:20,490 INFO L87 Difference]: Start difference. First operand 126 states and 128 transitions. Second operand 37 states. [2018-10-10 14:42:22,104 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2018-10-10 14:42:22,294 WARN L178 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2018-10-10 14:42:22,516 WARN L178 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2018-10-10 14:42:22,788 WARN L178 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2018-10-10 14:42:23,060 WARN L178 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2018-10-10 14:42:23,422 WARN L178 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2018-10-10 14:42:23,654 WARN L178 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2018-10-10 14:42:24,059 WARN L178 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2018-10-10 14:42:24,403 WARN L178 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 90 [2018-10-10 14:42:24,839 WARN L178 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2018-10-10 14:42:24,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:24,949 INFO L93 Difference]: Finished difference Result 165 states and 167 transitions. [2018-10-10 14:42:24,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-10 14:42:24,950 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 104 [2018-10-10 14:42:24,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:24,951 INFO L225 Difference]: With dead ends: 165 [2018-10-10 14:42:24,951 INFO L226 Difference]: Without dead ends: 165 [2018-10-10 14:42:24,952 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=670, Invalid=3236, Unknown=0, NotChecked=0, Total=3906 [2018-10-10 14:42:24,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-10-10 14:42:24,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 137. [2018-10-10 14:42:24,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-10-10 14:42:24,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 139 transitions. [2018-10-10 14:42:24,956 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 139 transitions. Word has length 104 [2018-10-10 14:42:24,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:24,956 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 139 transitions. [2018-10-10 14:42:24,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-10 14:42:24,957 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 139 transitions. [2018-10-10 14:42:24,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-10 14:42:24,958 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:24,959 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24,959 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:24,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:24,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1844202932, now seen corresponding path program 2 times [2018-10-10 14:42:24,960 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:24,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:24,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:24,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:24,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:24,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:26,136 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:26,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:26,137 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:26,146 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-10 14:42:26,189 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-10 14:42:26,189 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-10 14:42:26,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:26,210 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:26,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:26,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:26,218 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-10 14:42:26,295 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:26,296 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:26,297 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:26,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:26,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:26,302 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-10-10 14:42:26,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-10 14:42:26,434 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:26,494 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:26,494 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:13 [2018-10-10 14:42:26,754 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:26,756 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:26,756 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:26,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:26,770 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:26,770 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-10-10 14:42:27,315 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:27,317 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:27,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:27,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:27,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:42:27,338 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:29 [2018-10-10 14:42:27,652 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:27,660 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:27,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-10 14:42:27,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:42:27,684 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:27,684 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:33 [2018-10-10 14:42:27,972 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:27,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:42:27,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 48 [2018-10-10 14:42:27,994 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-10 14:42:27,998 WARN L205 ceAbstractionStarter]: Timeout [2018-10-10 14:42:27,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 02:42:27 BoogieIcfgContainer [2018-10-10 14:42:27,998 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 14:42:27,999 INFO L168 Benchmark]: Toolchain (without parser) took 25294.96 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.4 GB in the end (delta: -953.6 MB). Peak memory consumption was 119.6 MB. Max. memory is 7.1 GB. [2018-10-10 14:42:28,000 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:42:28,001 INFO L168 Benchmark]: CACSL2BoogieTranslator took 511.33 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:28,001 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.82 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:28,002 INFO L168 Benchmark]: Boogie Preprocessor took 30.50 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:28,002 INFO L168 Benchmark]: RCFGBuilder took 930.86 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 726.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -768.9 MB). Peak memory consumption was 16.6 MB. Max. memory is 7.1 GB. [2018-10-10 14:42:28,003 INFO L168 Benchmark]: TraceAbstraction took 23750.43 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 346.6 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -205.8 MB). Peak memory consumption was 140.7 MB. Max. memory is 7.1 GB. [2018-10-10 14:42:28,007 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 511.33 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 66.82 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 30.50 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 930.86 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 726.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -768.9 MB). Peak memory consumption was 16.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23750.43 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 346.6 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -205.8 MB). Peak memory consumption was 140.7 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 11). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 11). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 11). - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 545). Cancelled while PathProgramDumpController was trying to verify (iteration 11). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 11). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 11). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 11). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 124 locations, 7 error locations. TIMEOUT Result, 23.6s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 12.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 988 SDtfs, 7045 SDslu, 5649 SDs, 0 SdLazy, 3119 SolverSat, 172 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 426 GetRequests, 185 SyntacticMatches, 5 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1150 ImplicationChecksByTransitivity, 12.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=148occurred in iteration=8, 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.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 220 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 886 NumberOfCodeBlocks, 886 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 874 ConstructedInterpolants, 27 QuantifiedInterpolants, 665148 SizeOfPredicates, 56 NumberOfNonLiveVariables, 396 ConjunctsInSsa, 107 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 0/42 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Received shutdown request...