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_cstrcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c5b1954-m [2018-10-10 14:42:10,899 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 14:42:10,901 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 14:42:10,915 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 14:42:10,915 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 14:42:10,916 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 14:42:10,918 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 14:42:10,920 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 14:42:10,921 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 14:42:10,922 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 14:42:10,923 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 14:42:10,923 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 14:42:10,924 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 14:42:10,925 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 14:42:10,926 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 14:42:10,927 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 14:42:10,928 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 14:42:10,929 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 14:42:10,934 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 14:42:10,938 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 14:42:10,939 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 14:42:10,940 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 14:42:10,942 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 14:42:10,942 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 14:42:10,943 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 14:42:10,943 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 14:42:10,944 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 14:42:10,945 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 14:42:10,946 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 14:42:10,947 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 14:42:10,947 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 14:42:10,948 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 14:42:10,948 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 14:42:10,948 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 14:42:10,949 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 14:42:10,950 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 14:42:10,950 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:10,964 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 14:42:10,965 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 14:42:10,966 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-10 14:42:10,966 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-10 14:42:10,966 INFO L133 SettingsManager]: * Use SBE=true [2018-10-10 14:42:10,967 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-10 14:42:10,967 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-10 14:42:10,967 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-10 14:42:10,967 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-10 14:42:10,967 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-10 14:42:10,968 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-10 14:42:10,968 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-10 14:42:10,968 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-10 14:42:10,968 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-10 14:42:10,968 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-10 14:42:10,969 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-10 14:42:10,969 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 14:42:10,969 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-10 14:42:10,969 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-10 14:42:10,969 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-10 14:42:10,970 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:42:10,970 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 14:42:10,970 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-10 14:42:10,970 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-10 14:42:10,970 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-10 14:42:10,971 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Dump automata to the following directory -> dump Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> SingleStatement Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-10-10 14:42:11,021 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 14:42:11,033 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 14:42:11,039 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 14:42:11,041 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-10 14:42:11,041 INFO L276 PluginConnector]: CDTParser initialized [2018-10-10 14:42:11,042 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:42:11,385 INFO L217 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d879955c/7f4efef2347a4c57a65394349c9b2cb4/FLAG9eb77ba48 [2018-10-10 14:42:11,615 INFO L289 CDTParser]: Found 1 translation units. [2018-10-10 14:42:11,615 INFO L157 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-memsafety/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:42:11,629 INFO L337 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d879955c/7f4efef2347a4c57a65394349c9b2cb4/FLAG9eb77ba48 [2018-10-10 14:42:11,645 INFO L345 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d879955c/7f4efef2347a4c57a65394349c9b2cb4 [2018-10-10 14:42:11,655 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 14:42:11,657 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-10 14:42:11,658 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-10 14:42:11,658 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-10 14:42:11,662 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-10 14:42:11,663 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:42:11" (1/1) ... [2018-10-10 14:42:11,666 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c4a0f63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:11, skipping insertion in model container [2018-10-10 14:42:11,666 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:42:11" (1/1) ... [2018-10-10 14:42:11,677 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-10 14:42:11,722 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-10 14:42:11,941 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:42:11,952 INFO L189 MainTranslator]: Completed pre-run [2018-10-10 14:42:12,003 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:42:12,076 INFO L193 MainTranslator]: Completed translation [2018-10-10 14:42:12,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:12 WrapperNode [2018-10-10 14:42:12,077 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-10 14:42:12,078 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-10 14:42:12,078 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-10 14:42:12,078 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-10 14:42:12,089 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:12" (1/1) ... [2018-10-10 14:42:12,113 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:12" (1/1) ... [2018-10-10 14:42:12,141 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-10 14:42:12,142 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 14:42:12,142 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 14:42:12,142 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 14:42:12,154 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:12" (1/1) ... [2018-10-10 14:42:12,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:12" (1/1) ... [2018-10-10 14:42:12,158 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:12" (1/1) ... [2018-10-10 14:42:12,159 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:12" (1/1) ... [2018-10-10 14:42:12,165 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:12" (1/1) ... [2018-10-10 14:42:12,170 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:12" (1/1) ... [2018-10-10 14:42:12,172 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:12" (1/1) ... [2018-10-10 14:42:12,175 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 14:42:12,176 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 14:42:12,176 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 14:42:12,176 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 14:42:12,177 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:42:12,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 14:42:12,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 14:42:13,132 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 14:42:13,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:42:13 BoogieIcfgContainer [2018-10-10 14:42:13,133 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 14:42:13,134 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 14:42:13,134 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 14:42:13,137 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 14:42:13,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 02:42:11" (1/3) ... [2018-10-10 14:42:13,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea6e813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:42:13, skipping insertion in model container [2018-10-10 14:42:13,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:12" (2/3) ... [2018-10-10 14:42:13,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea6e813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:42:13, skipping insertion in model container [2018-10-10 14:42:13,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:42:13" (3/3) ... [2018-10-10 14:42:13,141 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:42:13,151 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-10 14:42:13,160 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-10-10 14:42:13,177 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2018-10-10 14:42:13,201 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 14:42:13,202 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 14:42:13,202 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 14:42:13,202 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-10 14:42:13,202 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 14:42:13,203 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 14:42:13,203 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 14:42:13,203 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 14:42:13,203 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 14:42:13,226 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states. [2018-10-10 14:42:13,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-10 14:42:13,235 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:13,239 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:13,242 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:13,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:13,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1888490721, now seen corresponding path program 1 times [2018-10-10 14:42:13,250 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:13,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:13,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:13,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:13,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:13,432 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:13,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:13,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-10 14:42:13,441 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-10 14:42:13,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-10 14:42:13,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 14:42:13,461 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 3 states. [2018-10-10 14:42:13,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:13,777 INFO L93 Difference]: Finished difference Result 126 states and 129 transitions. [2018-10-10 14:42:13,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-10 14:42:13,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-10-10 14:42:13,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:13,790 INFO L225 Difference]: With dead ends: 126 [2018-10-10 14:42:13,790 INFO L226 Difference]: Without dead ends: 119 [2018-10-10 14:42:13,792 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:13,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-10-10 14:42:13,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-10-10 14:42:13,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-10-10 14:42:13,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 121 transitions. [2018-10-10 14:42:13,834 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 121 transitions. Word has length 19 [2018-10-10 14:42:13,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:13,834 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 121 transitions. [2018-10-10 14:42:13,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-10 14:42:13,835 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2018-10-10 14:42:13,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-10 14:42:13,836 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:13,836 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:13,837 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:13,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:13,837 INFO L82 PathProgramCache]: Analyzing trace with hash 260442721, now seen corresponding path program 1 times [2018-10-10 14:42:13,837 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:13,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:13,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:13,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:13,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:14,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:14,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:14,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:42:14,007 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:42:14,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:42:14,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:42:14,008 INFO L87 Difference]: Start difference. First operand 119 states and 121 transitions. Second operand 6 states. [2018-10-10 14:42:14,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:14,456 INFO L93 Difference]: Finished difference Result 118 states and 120 transitions. [2018-10-10 14:42:14,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 14:42:14,462 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-10-10 14:42:14,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:14,464 INFO L225 Difference]: With dead ends: 118 [2018-10-10 14:42:14,464 INFO L226 Difference]: Without dead ends: 118 [2018-10-10 14:42:14,466 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:14,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-10-10 14:42:14,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-10-10 14:42:14,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-10-10 14:42:14,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 120 transitions. [2018-10-10 14:42:14,482 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 120 transitions. Word has length 47 [2018-10-10 14:42:14,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:14,485 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 120 transitions. [2018-10-10 14:42:14,485 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:42:14,485 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 120 transitions. [2018-10-10 14:42:14,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-10 14:42:14,487 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:14,487 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:14,488 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:14,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:14,488 INFO L82 PathProgramCache]: Analyzing trace with hash -516210144, now seen corresponding path program 1 times [2018-10-10 14:42:14,488 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:14,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:14,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:14,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:14,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:14,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:15,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:15,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:15,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:42:15,145 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:42:15,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:42:15,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:42:15,146 INFO L87 Difference]: Start difference. First operand 118 states and 120 transitions. Second operand 9 states. [2018-10-10 14:42:15,823 WARN L178 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-10 14:42:15,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:15,826 INFO L93 Difference]: Finished difference Result 133 states and 135 transitions. [2018-10-10 14:42:15,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:42:15,827 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2018-10-10 14:42:15,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:15,831 INFO L225 Difference]: With dead ends: 133 [2018-10-10 14:42:15,831 INFO L226 Difference]: Without dead ends: 133 [2018-10-10 14:42:15,832 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:42:15,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-10-10 14:42:15,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 117. [2018-10-10 14:42:15,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-10-10 14:42:15,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 119 transitions. [2018-10-10 14:42:15,847 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 119 transitions. Word has length 48 [2018-10-10 14:42:15,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:15,847 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 119 transitions. [2018-10-10 14:42:15,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:42:15,848 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 119 transitions. [2018-10-10 14:42:15,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-10 14:42:15,852 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:15,852 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:15,853 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:15,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:15,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1046707433, now seen corresponding path program 1 times [2018-10-10 14:42:15,853 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:15,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:15,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:15,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:15,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:15,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:16,038 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,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:16,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:42:16,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:42:16,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:42:16,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:42:16,040 INFO L87 Difference]: Start difference. First operand 117 states and 119 transitions. Second operand 8 states. [2018-10-10 14:42:16,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:16,413 INFO L93 Difference]: Finished difference Result 119 states and 121 transitions. [2018-10-10 14:42:16,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:42:16,414 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2018-10-10 14:42:16,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:16,416 INFO L225 Difference]: With dead ends: 119 [2018-10-10 14:42:16,417 INFO L226 Difference]: Without dead ends: 119 [2018-10-10 14:42:16,417 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:42:16,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-10-10 14:42:16,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2018-10-10 14:42:16,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-10-10 14:42:16,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 118 transitions. [2018-10-10 14:42:16,426 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 118 transitions. Word has length 64 [2018-10-10 14:42:16,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:16,426 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 118 transitions. [2018-10-10 14:42:16,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:42:16,427 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2018-10-10 14:42:16,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-10 14:42:16,428 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:16,428 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] [2018-10-10 14:42:16,429 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:16,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:16,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1911807826, now seen corresponding path program 1 times [2018-10-10 14:42:16,429 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:16,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:16,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:16,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:16,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:16,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:16,648 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,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:16,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-10 14:42:16,649 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 14:42:16,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 14:42:16,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:42:16,650 INFO L87 Difference]: Start difference. First operand 116 states and 118 transitions. Second operand 11 states. [2018-10-10 14:42:17,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:17,251 INFO L93 Difference]: Finished difference Result 172 states and 174 transitions. [2018-10-10 14:42:17,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-10 14:42:17,251 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2018-10-10 14:42:17,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:17,254 INFO L225 Difference]: With dead ends: 172 [2018-10-10 14:42:17,254 INFO L226 Difference]: Without dead ends: 172 [2018-10-10 14:42:17,255 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:17,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-10-10 14:42:17,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 121. [2018-10-10 14:42:17,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-10 14:42:17,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 123 transitions. [2018-10-10 14:42:17,264 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 123 transitions. Word has length 65 [2018-10-10 14:42:17,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:17,264 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 123 transitions. [2018-10-10 14:42:17,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 14:42:17,265 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 123 transitions. [2018-10-10 14:42:17,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-10 14:42:17,266 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:17,266 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:17,267 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:17,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:17,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1774284236, now seen corresponding path program 1 times [2018-10-10 14:42:17,267 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:17,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:17,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:17,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:17,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:17,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:17,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:17,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:17,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-10 14:42:17,647 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 14:42:17,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 14:42:17,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-10-10 14:42:17,647 INFO L87 Difference]: Start difference. First operand 121 states and 123 transitions. Second operand 10 states. [2018-10-10 14:42:18,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:18,025 INFO L93 Difference]: Finished difference Result 120 states and 122 transitions. [2018-10-10 14:42:18,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 14:42:18,028 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 75 [2018-10-10 14:42:18,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:18,030 INFO L225 Difference]: With dead ends: 120 [2018-10-10 14:42:18,030 INFO L226 Difference]: Without dead ends: 120 [2018-10-10 14:42:18,030 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2018-10-10 14:42:18,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-10-10 14:42:18,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-10-10 14:42:18,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-10-10 14:42:18,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 122 transitions. [2018-10-10 14:42:18,036 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 122 transitions. Word has length 75 [2018-10-10 14:42:18,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:18,037 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 122 transitions. [2018-10-10 14:42:18,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 14:42:18,037 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 122 transitions. [2018-10-10 14:42:18,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-10 14:42:18,042 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:18,042 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:18,043 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:18,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:18,043 INFO L82 PathProgramCache]: Analyzing trace with hash 831763664, now seen corresponding path program 1 times [2018-10-10 14:42:18,043 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:18,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:18,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:18,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:18,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:18,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:18,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:18,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:18,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-10-10 14:42:18,487 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 14:42:18,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 14:42:18,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-10-10 14:42:18,488 INFO L87 Difference]: Start difference. First operand 120 states and 122 transitions. Second operand 15 states. [2018-10-10 14:42:19,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:19,969 INFO L93 Difference]: Finished difference Result 181 states and 183 transitions. [2018-10-10 14:42:19,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-10 14:42:19,976 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 76 [2018-10-10 14:42:19,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:19,977 INFO L225 Difference]: With dead ends: 181 [2018-10-10 14:42:19,978 INFO L226 Difference]: Without dead ends: 181 [2018-10-10 14:42:19,979 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:19,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-10-10 14:42:19,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 131. [2018-10-10 14:42:19,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-10 14:42:19,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 133 transitions. [2018-10-10 14:42:19,987 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 133 transitions. Word has length 76 [2018-10-10 14:42:19,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:19,987 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 133 transitions. [2018-10-10 14:42:19,987 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 14:42:19,987 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 133 transitions. [2018-10-10 14:42:19,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-10 14:42:19,989 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:19,990 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:19,990 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:19,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:19,990 INFO L82 PathProgramCache]: Analyzing trace with hash -684232743, now seen corresponding path program 1 times [2018-10-10 14:42:19,991 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:19,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:19,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:19,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:19,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:20,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:20,566 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:20,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:20,566 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:20,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:20,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:20,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:20,698 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:20,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:20,734 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:20,735 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-10 14:42:20,983 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:20,988 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:20,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:20,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:21,010 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:21,010 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-10-10 14:42:21,420 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:21,462 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:21,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-10 14:42:21,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:42:21,512 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:21,513 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:40 [2018-10-10 14:42:21,655 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2018-10-10 14:42:21,936 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:21,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:42:21,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 27 [2018-10-10 14:42:21,997 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i_8.bpl [2018-10-10 14:42:22,003 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-10 14:42:22,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-10 14:42:22,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=682, Unknown=0, NotChecked=0, Total=756 [2018-10-10 14:42:22,004 INFO L87 Difference]: Start difference. First operand 131 states and 133 transitions. Second operand 28 states. [2018-10-10 14:42:23,233 WARN L178 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2018-10-10 14:42:23,580 WARN L178 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2018-10-10 14:42:23,742 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2018-10-10 14:42:24,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:24,823 INFO L93 Difference]: Finished difference Result 221 states and 223 transitions. [2018-10-10 14:42:24,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-10 14:42:24,824 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 94 [2018-10-10 14:42:24,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:24,826 INFO L225 Difference]: With dead ends: 221 [2018-10-10 14:42:24,826 INFO L226 Difference]: Without dead ends: 221 [2018-10-10 14:42:24,828 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 82 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=441, Invalid=1911, Unknown=0, NotChecked=0, Total=2352 [2018-10-10 14:42:24,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-10-10 14:42:24,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 149. [2018-10-10 14:42:24,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-10-10 14:42:24,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 152 transitions. [2018-10-10 14:42:24,833 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 152 transitions. Word has length 94 [2018-10-10 14:42:24,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:24,834 INFO L481 AbstractCegarLoop]: Abstraction has 149 states and 152 transitions. [2018-10-10 14:42:24,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-10 14:42:24,834 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 152 transitions. [2018-10-10 14:42:24,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-10 14:42:24,836 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:24,836 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:24,836 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:24,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:24,837 INFO L82 PathProgramCache]: Analyzing trace with hash -139719387, now seen corresponding path program 1 times [2018-10-10 14:42:24,837 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:24,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:24,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:24,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:24,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:24,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:25,458 WARN L178 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-10-10 14:42:26,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:26,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:26,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-10-10 14:42:26,176 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 14:42:26,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 14:42:26,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-10-10 14:42:26,177 INFO L87 Difference]: Start difference. First operand 149 states and 152 transitions. Second operand 16 states. [2018-10-10 14:42:27,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:27,035 INFO L93 Difference]: Finished difference Result 148 states and 151 transitions. [2018-10-10 14:42:27,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 14:42:27,035 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 103 [2018-10-10 14:42:27,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:27,037 INFO L225 Difference]: With dead ends: 148 [2018-10-10 14:42:27,037 INFO L226 Difference]: Without dead ends: 127 [2018-10-10 14:42:27,038 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=148, Invalid=974, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 14:42:27,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-10 14:42:27,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-10-10 14:42:27,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-10-10 14:42:27,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 129 transitions. [2018-10-10 14:42:27,041 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 129 transitions. Word has length 103 [2018-10-10 14:42:27,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:27,041 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 129 transitions. [2018-10-10 14:42:27,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 14:42:27,042 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 129 transitions. [2018-10-10 14:42:27,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-10-10 14:42:27,043 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:27,043 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, 1] [2018-10-10 14:42:27,044 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:27,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:27,044 INFO L82 PathProgramCache]: Analyzing trace with hash 745000133, now seen corresponding path program 1 times [2018-10-10 14:42:27,044 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:27,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:27,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:27,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:27,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:27,753 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-10 14:42:28,513 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:28,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:28,514 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:28,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:28,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:28,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:28,591 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:28,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:28,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:28,636 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-10 14:42:28,646 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:28,646 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:28,659 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:28,660 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-10-10 14:42:28,722 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:28,724 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:28,725 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:28,725 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:28,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:28,755 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2018-10-10 14:42:28,799 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:28,800 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:28,810 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:28,811 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2018-10-10 14:42:30,002 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:30,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:42:30,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 36 [2018-10-10 14:42:30,055 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/openbsd_cstrcpy-alloca_true-valid-memsafety_true-termination.i_10.bpl [2018-10-10 14:42:30,057 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-10 14:42:30,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-10 14:42:30,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1250, Unknown=0, NotChecked=0, Total=1332 [2018-10-10 14:42:30,058 INFO L87 Difference]: Start difference. First operand 127 states and 129 transitions. Second operand 37 states. [2018-10-10 14:42:32,085 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2018-10-10 14:42:32,284 WARN L178 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2018-10-10 14:42:32,522 WARN L178 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 69 [2018-10-10 14:42:32,826 WARN L178 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2018-10-10 14:42:33,125 WARN L178 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2018-10-10 14:42:33,457 WARN L178 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2018-10-10 14:42:33,689 WARN L178 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2018-10-10 14:42:33,974 WARN L178 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2018-10-10 14:42:34,370 WARN L178 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 90 [2018-10-10 14:42:34,669 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2018-10-10 14:42:34,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:34,799 INFO L93 Difference]: Finished difference Result 166 states and 168 transitions. [2018-10-10 14:42:34,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-10 14:42:34,806 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 105 [2018-10-10 14:42:34,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:34,807 INFO L225 Difference]: With dead ends: 166 [2018-10-10 14:42:34,808 INFO L226 Difference]: Without dead ends: 166 [2018-10-10 14:42:34,809 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=670, Invalid=3236, Unknown=0, NotChecked=0, Total=3906 [2018-10-10 14:42:34,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-10-10 14:42:34,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 138. [2018-10-10 14:42:34,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-10-10 14:42:34,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 140 transitions. [2018-10-10 14:42:34,814 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 140 transitions. Word has length 105 [2018-10-10 14:42:34,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:34,815 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 140 transitions. [2018-10-10 14:42:34,815 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-10 14:42:34,815 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 140 transitions. [2018-10-10 14:42:34,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-10 14:42:34,816 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:34,820 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, 1] [2018-10-10 14:42:34,820 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:34,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:34,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1742951566, now seen corresponding path program 2 times [2018-10-10 14:42:34,821 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:34,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:34,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:34,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:34,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:34,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:35,914 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:35,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:35,915 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:35,935 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-10 14:42:35,977 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-10 14:42:35,977 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-10 14:42:35,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:35,996 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:35,996 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:36,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:36,000 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-10 14:42:36,099 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:36,100 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:36,101 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:36,101 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:36,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:36,106 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-10-10 14:42:36,173 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:36,174 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:36,180 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:36,180 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:13 [2018-10-10 14:42:36,430 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:36,435 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:36,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:36,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:36,447 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:36,448 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-10-10 14:42:36,976 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:36,992 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:36,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:36,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:37,012 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:37,012 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:29 [2018-10-10 14:42:37,349 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:37,356 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:37,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-10 14:42:37,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:42:37,379 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:37,380 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:33 [2018-10-10 14:42:37,636 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:37,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:42:37,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 48 [2018-10-10 14:42:37,658 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-10 14:42:37,661 WARN L205 ceAbstractionStarter]: Timeout [2018-10-10 14:42:37,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 02:42:37 BoogieIcfgContainer [2018-10-10 14:42:37,662 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 14:42:37,663 INFO L168 Benchmark]: Toolchain (without parser) took 26007.32 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.3 GB in the end (delta: -847.1 MB). Peak memory consumption was 227.7 MB. Max. memory is 7.1 GB. [2018-10-10 14:42:37,664 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:42:37,664 INFO L168 Benchmark]: CACSL2BoogieTranslator took 419.65 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:37,665 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.87 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:37,665 INFO L168 Benchmark]: Boogie Preprocessor took 33.64 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:37,666 INFO L168 Benchmark]: RCFGBuilder took 957.07 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 760.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -803.9 MB). Peak memory consumption was 16.6 MB. Max. memory is 7.1 GB. [2018-10-10 14:42:37,667 INFO L168 Benchmark]: TraceAbstraction took 24528.27 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 314.0 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -64.4 MB). Peak memory consumption was 249.7 MB. Max. memory is 7.1 GB. [2018-10-10 14:42:37,671 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 419.65 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 63.87 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 33.64 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 957.07 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 760.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -803.9 MB). Peak memory consumption was 16.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 24528.27 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 314.0 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -64.4 MB). Peak memory consumption was 249.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: 547]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 547). 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). - 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, 125 locations, 7 error locations. TIMEOUT Result, 24.4s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 12.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 997 SDtfs, 7114 SDslu, 5947 SDs, 0 SdLazy, 3262 SolverSat, 169 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 429 GetRequests, 189 SyntacticMatches, 4 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1148 ImplicationChecksByTransitivity, 13.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=149occurred 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.8s InterpolantComputationTime, 895 NumberOfCodeBlocks, 895 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 883 ConstructedInterpolants, 28 QuantifiedInterpolants, 682459 SizeOfPredicates, 56 NumberOfNonLiveVariables, 404 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...