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/ldv-memsafety/ArraysOfVariableLength2_true-valid-memsafety.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c5b1954-m [2018-10-10 14:53:03,887 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 14:53:03,891 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 14:53:03,907 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 14:53:03,907 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 14:53:03,908 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 14:53:03,910 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 14:53:03,913 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 14:53:03,916 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 14:53:03,924 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 14:53:03,925 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 14:53:03,925 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 14:53:03,926 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 14:53:03,927 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 14:53:03,928 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 14:53:03,929 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 14:53:03,930 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 14:53:03,931 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 14:53:03,933 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 14:53:03,934 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 14:53:03,936 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 14:53:03,937 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 14:53:03,939 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 14:53:03,939 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 14:53:03,939 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 14:53:03,940 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 14:53:03,941 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 14:53:03,942 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 14:53:03,943 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 14:53:03,944 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 14:53:03,944 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 14:53:03,945 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 14:53:03,945 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 14:53:03,945 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 14:53:03,948 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 14:53:03,948 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 14:53:03,949 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:53:03,977 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 14:53:03,977 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 14:53:03,979 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-10 14:53:03,979 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-10 14:53:03,979 INFO L133 SettingsManager]: * Use SBE=true [2018-10-10 14:53:03,979 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-10 14:53:03,980 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-10 14:53:03,981 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-10 14:53:03,981 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-10 14:53:03,981 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-10 14:53:03,981 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-10 14:53:03,981 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-10 14:53:03,982 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-10 14:53:03,982 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-10 14:53:03,982 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-10 14:53:03,982 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-10 14:53:03,982 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 14:53:03,983 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-10 14:53:03,983 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-10 14:53:03,983 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-10 14:53:03,983 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:53:03,983 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 14:53:03,984 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-10 14:53:03,984 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-10 14:53:03,984 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-10 14:53:03,984 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:53:04,061 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 14:53:04,085 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 14:53:04,090 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 14:53:04,092 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-10 14:53:04,092 INFO L276 PluginConnector]: CDTParser initialized [2018-10-10 14:53:04,093 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength2_true-valid-memsafety.c [2018-10-10 14:53:04,403 INFO L217 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/decb1107e/53c8ae0a30ad45ec90cd8d4d87cb73e1/FLAGa92e4f994 [2018-10-10 14:53:04,594 INFO L289 CDTParser]: Found 1 translation units. [2018-10-10 14:53:04,595 INFO L157 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength2_true-valid-memsafety.c [2018-10-10 14:53:04,601 INFO L337 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/decb1107e/53c8ae0a30ad45ec90cd8d4d87cb73e1/FLAGa92e4f994 [2018-10-10 14:53:04,618 INFO L345 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/decb1107e/53c8ae0a30ad45ec90cd8d4d87cb73e1 [2018-10-10 14:53:04,627 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 14:53:04,629 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-10 14:53:04,630 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-10 14:53:04,630 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-10 14:53:04,633 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-10 14:53:04,634 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:53:04" (1/1) ... [2018-10-10 14:53:04,637 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b8325e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:53:04, skipping insertion in model container [2018-10-10 14:53:04,638 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:53:04" (1/1) ... [2018-10-10 14:53:04,648 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-10 14:53:04,671 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-10 14:53:04,828 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:53:04,838 INFO L189 MainTranslator]: Completed pre-run [2018-10-10 14:53:04,859 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:53:04,875 INFO L193 MainTranslator]: Completed translation [2018-10-10 14:53:04,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:53:04 WrapperNode [2018-10-10 14:53:04,876 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-10 14:53:04,877 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-10 14:53:04,877 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-10 14:53:04,877 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-10 14:53:04,887 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:53:04" (1/1) ... [2018-10-10 14:53:04,897 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:53:04" (1/1) ... [2018-10-10 14:53:04,924 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-10 14:53:04,924 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 14:53:04,925 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 14:53:04,925 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 14:53:04,934 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:53:04" (1/1) ... [2018-10-10 14:53:04,934 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:53:04" (1/1) ... [2018-10-10 14:53:04,938 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:53:04" (1/1) ... [2018-10-10 14:53:04,939 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:53:04" (1/1) ... [2018-10-10 14:53:04,947 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:53:04" (1/1) ... [2018-10-10 14:53:04,953 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:53:04" (1/1) ... [2018-10-10 14:53:04,956 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:53:04" (1/1) ... [2018-10-10 14:53:04,959 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 14:53:04,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 14:53:04,959 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 14:53:04,960 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 14:53:04,961 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:53:04" (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:53:05,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 14:53:05,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 14:53:06,039 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 14:53:06,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:53:06 BoogieIcfgContainer [2018-10-10 14:53:06,039 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 14:53:06,040 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 14:53:06,040 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 14:53:06,044 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 14:53:06,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 02:53:04" (1/3) ... [2018-10-10 14:53:06,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20714fdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:53:06, skipping insertion in model container [2018-10-10 14:53:06,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:53:04" (2/3) ... [2018-10-10 14:53:06,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20714fdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:53:06, skipping insertion in model container [2018-10-10 14:53:06,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:53:06" (3/3) ... [2018-10-10 14:53:06,048 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength2_true-valid-memsafety.c [2018-10-10 14:53:06,058 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-10 14:53:06,068 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-10-10 14:53:06,086 INFO L257 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2018-10-10 14:53:06,113 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 14:53:06,114 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 14:53:06,114 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 14:53:06,115 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-10 14:53:06,115 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 14:53:06,117 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 14:53:06,117 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 14:53:06,117 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 14:53:06,117 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 14:53:06,142 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states. [2018-10-10 14:53:06,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-10 14:53:06,151 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:53:06,153 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] [2018-10-10 14:53:06,155 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:53:06,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:53:06,162 INFO L82 PathProgramCache]: Analyzing trace with hash 823955536, now seen corresponding path program 1 times [2018-10-10 14:53:06,164 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:53:06,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:53:06,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:06,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:53:06,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:06,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:53:06,282 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:53:06,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:53:06,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-10 14:53:06,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-10 14:53:06,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-10 14:53:06,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-10 14:53:06,309 INFO L87 Difference]: Start difference. First operand 186 states. Second operand 2 states. [2018-10-10 14:53:06,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:53:06,335 INFO L93 Difference]: Finished difference Result 186 states and 191 transitions. [2018-10-10 14:53:06,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-10 14:53:06,337 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2018-10-10 14:53:06,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:53:06,351 INFO L225 Difference]: With dead ends: 186 [2018-10-10 14:53:06,351 INFO L226 Difference]: Without dead ends: 181 [2018-10-10 14:53:06,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-10 14:53:06,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-10-10 14:53:06,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-10-10 14:53:06,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-10 14:53:06,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 186 transitions. [2018-10-10 14:53:06,404 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 186 transitions. Word has length 29 [2018-10-10 14:53:06,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:53:06,404 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 186 transitions. [2018-10-10 14:53:06,404 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-10 14:53:06,405 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 186 transitions. [2018-10-10 14:53:06,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-10 14:53:06,406 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:53:06,406 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] [2018-10-10 14:53:06,407 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:53:06,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:53:06,407 INFO L82 PathProgramCache]: Analyzing trace with hash -101283370, now seen corresponding path program 1 times [2018-10-10 14:53:06,407 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:53:06,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:53:06,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:06,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:53:06,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:06,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:53:06,479 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:53:06,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:53:06,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-10 14:53:06,481 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-10 14:53:06,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-10 14:53:06,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 14:53:06,482 INFO L87 Difference]: Start difference. First operand 181 states and 186 transitions. Second operand 3 states. [2018-10-10 14:53:06,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:53:06,611 INFO L93 Difference]: Finished difference Result 295 states and 302 transitions. [2018-10-10 14:53:06,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-10 14:53:06,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-10 14:53:06,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:53:06,615 INFO L225 Difference]: With dead ends: 295 [2018-10-10 14:53:06,615 INFO L226 Difference]: Without dead ends: 295 [2018-10-10 14:53:06,616 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 14:53:06,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-10-10 14:53:06,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 175. [2018-10-10 14:53:06,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-10-10 14:53:06,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 179 transitions. [2018-10-10 14:53:06,631 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 179 transitions. Word has length 30 [2018-10-10 14:53:06,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:53:06,632 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 179 transitions. [2018-10-10 14:53:06,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-10 14:53:06,632 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 179 transitions. [2018-10-10 14:53:06,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-10 14:53:06,634 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:53:06,634 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] [2018-10-10 14:53:06,634 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:53:06,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:53:06,635 INFO L82 PathProgramCache]: Analyzing trace with hash 97953282, now seen corresponding path program 1 times [2018-10-10 14:53:06,635 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:53:06,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:53:06,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:06,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:53:06,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:06,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:53:06,808 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:53:06,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:53:06,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 14:53:06,810 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:53:06,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:53:06,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:53:06,811 INFO L87 Difference]: Start difference. First operand 175 states and 179 transitions. Second operand 6 states. [2018-10-10 14:53:07,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:53:07,194 INFO L93 Difference]: Finished difference Result 302 states and 309 transitions. [2018-10-10 14:53:07,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:53:07,199 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-10-10 14:53:07,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:53:07,202 INFO L225 Difference]: With dead ends: 302 [2018-10-10 14:53:07,204 INFO L226 Difference]: Without dead ends: 302 [2018-10-10 14:53:07,205 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-10-10 14:53:07,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-10-10 14:53:07,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 198. [2018-10-10 14:53:07,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-10-10 14:53:07,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 202 transitions. [2018-10-10 14:53:07,232 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 202 transitions. Word has length 50 [2018-10-10 14:53:07,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:53:07,233 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 202 transitions. [2018-10-10 14:53:07,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:53:07,233 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 202 transitions. [2018-10-10 14:53:07,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-10 14:53:07,239 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:53:07,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:07,240 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:53:07,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:53:07,240 INFO L82 PathProgramCache]: Analyzing trace with hash 331337925, now seen corresponding path program 1 times [2018-10-10 14:53:07,244 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:53:07,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:53:07,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:07,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:53:07,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:07,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:53:07,369 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:53:07,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:53:07,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 14:53:07,370 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 14:53:07,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 14:53:07,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:53:07,371 INFO L87 Difference]: Start difference. First operand 198 states and 202 transitions. Second operand 7 states. [2018-10-10 14:53:08,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:53:08,551 INFO L93 Difference]: Finished difference Result 235 states and 242 transitions. [2018-10-10 14:53:08,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:53:08,554 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2018-10-10 14:53:08,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:53:08,556 INFO L225 Difference]: With dead ends: 235 [2018-10-10 14:53:08,556 INFO L226 Difference]: Without dead ends: 235 [2018-10-10 14:53:08,557 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:53:08,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-10-10 14:53:08,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 197. [2018-10-10 14:53:08,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-10-10 14:53:08,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 201 transitions. [2018-10-10 14:53:08,572 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 201 transitions. Word has length 61 [2018-10-10 14:53:08,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:53:08,572 INFO L481 AbstractCegarLoop]: Abstraction has 197 states and 201 transitions. [2018-10-10 14:53:08,573 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 14:53:08,573 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 201 transitions. [2018-10-10 14:53:08,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-10 14:53:08,575 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:53:08,575 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] [2018-10-10 14:53:08,579 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:53:08,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:53:08,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1681541230, now seen corresponding path program 1 times [2018-10-10 14:53:08,580 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:53:08,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:53:08,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:08,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:53:08,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:08,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:53:08,755 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:53:08,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:53:08,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:53:08,756 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:53:08,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:53:08,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:53:08,757 INFO L87 Difference]: Start difference. First operand 197 states and 201 transitions. Second operand 8 states. [2018-10-10 14:53:09,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:53:09,165 INFO L93 Difference]: Finished difference Result 335 states and 342 transitions. [2018-10-10 14:53:09,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 14:53:09,166 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2018-10-10 14:53:09,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:53:09,168 INFO L225 Difference]: With dead ends: 335 [2018-10-10 14:53:09,168 INFO L226 Difference]: Without dead ends: 335 [2018-10-10 14:53:09,169 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-10-10 14:53:09,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-10-10 14:53:09,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 208. [2018-10-10 14:53:09,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-10-10 14:53:09,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 212 transitions. [2018-10-10 14:53:09,180 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 212 transitions. Word has length 62 [2018-10-10 14:53:09,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:53:09,181 INFO L481 AbstractCegarLoop]: Abstraction has 208 states and 212 transitions. [2018-10-10 14:53:09,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:53:09,181 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 212 transitions. [2018-10-10 14:53:09,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-10 14:53:09,187 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:53:09,188 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:53:09,190 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:53:09,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:53:09,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1718080653, now seen corresponding path program 1 times [2018-10-10 14:53:09,191 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:53:09,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:53:09,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:09,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:53:09,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:09,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:53:09,515 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:53:09,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:53:09,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-10 14:53:09,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 14:53:09,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 14:53:09,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:53:09,517 INFO L87 Difference]: Start difference. First operand 208 states and 212 transitions. Second operand 11 states. [2018-10-10 14:53:10,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:53:10,650 INFO L93 Difference]: Finished difference Result 283 states and 291 transitions. [2018-10-10 14:53:10,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-10 14:53:10,653 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 79 [2018-10-10 14:53:10,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:53:10,655 INFO L225 Difference]: With dead ends: 283 [2018-10-10 14:53:10,655 INFO L226 Difference]: Without dead ends: 283 [2018-10-10 14:53:10,656 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=221, Invalid=591, Unknown=0, NotChecked=0, Total=812 [2018-10-10 14:53:10,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-10-10 14:53:10,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 207. [2018-10-10 14:53:10,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-10-10 14:53:10,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 211 transitions. [2018-10-10 14:53:10,663 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 211 transitions. Word has length 79 [2018-10-10 14:53:10,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:53:10,663 INFO L481 AbstractCegarLoop]: Abstraction has 207 states and 211 transitions. [2018-10-10 14:53:10,664 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 14:53:10,664 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 211 transitions. [2018-10-10 14:53:10,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-10 14:53:10,665 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:53:10,665 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:53:10,666 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:53:10,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:53:10,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1720892490, now seen corresponding path program 1 times [2018-10-10 14:53:10,667 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:53:10,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:53:10,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:10,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:53:10,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:10,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:53:10,956 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:53:10,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:53:10,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-10 14:53:10,957 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 14:53:10,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 14:53:10,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:53:10,958 INFO L87 Difference]: Start difference. First operand 207 states and 211 transitions. Second operand 12 states. [2018-10-10 14:53:11,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:53:11,922 INFO L93 Difference]: Finished difference Result 289 states and 295 transitions. [2018-10-10 14:53:11,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 14:53:11,922 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 80 [2018-10-10 14:53:11,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:53:11,929 INFO L225 Difference]: With dead ends: 289 [2018-10-10 14:53:11,930 INFO L226 Difference]: Without dead ends: 289 [2018-10-10 14:53:11,930 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2018-10-10 14:53:11,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-10-10 14:53:11,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 238. [2018-10-10 14:53:11,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-10-10 14:53:11,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 243 transitions. [2018-10-10 14:53:11,937 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 243 transitions. Word has length 80 [2018-10-10 14:53:11,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:53:11,937 INFO L481 AbstractCegarLoop]: Abstraction has 238 states and 243 transitions. [2018-10-10 14:53:11,937 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 14:53:11,937 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 243 transitions. [2018-10-10 14:53:11,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-10 14:53:11,939 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:53:11,939 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:53:11,940 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:53:11,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:53:11,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1834616291, now seen corresponding path program 1 times [2018-10-10 14:53:11,941 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:53:11,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:53:11,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:11,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:53:11,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:53:12,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:53:12,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:53:12,200 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:53:12,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:53:12,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:53:12,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:53:12,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:53:12,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:53:12,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-10-10 14:53:12,423 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/ArraysOfVariableLength2_true-valid-memsafety.c_8.bpl [2018-10-10 14:53:12,427 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 14:53:12,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 14:53:12,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:53:12,428 INFO L87 Difference]: Start difference. First operand 238 states and 243 transitions. Second operand 7 states. [2018-10-10 14:53:12,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:53:12,556 INFO L93 Difference]: Finished difference Result 367 states and 375 transitions. [2018-10-10 14:53:12,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 14:53:12,558 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2018-10-10 14:53:12,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:53:12,560 INFO L225 Difference]: With dead ends: 367 [2018-10-10 14:53:12,560 INFO L226 Difference]: Without dead ends: 367 [2018-10-10 14:53:12,560 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:53:12,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-10-10 14:53:12,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 249. [2018-10-10 14:53:12,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-10-10 14:53:12,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 254 transitions. [2018-10-10 14:53:12,568 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 254 transitions. Word has length 97 [2018-10-10 14:53:12,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:53:12,569 INFO L481 AbstractCegarLoop]: Abstraction has 249 states and 254 transitions. [2018-10-10 14:53:12,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 14:53:12,569 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 254 transitions. [2018-10-10 14:53:12,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-10-10 14:53:12,571 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:53:12,571 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:12,572 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:53:12,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:53:12,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1536648817, now seen corresponding path program 1 times [2018-10-10 14:53:12,572 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:53:12,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:53:12,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:12,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:53:12,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:12,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:53:12,864 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:53:12,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:53:12,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-10 14:53:12,866 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 14:53:12,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 14:53:12,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-10 14:53:12,866 INFO L87 Difference]: Start difference. First operand 249 states and 254 transitions. Second operand 10 states. [2018-10-10 14:53:13,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:53:13,506 INFO L93 Difference]: Finished difference Result 348 states and 358 transitions. [2018-10-10 14:53:13,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 14:53:13,507 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 117 [2018-10-10 14:53:13,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:53:13,510 INFO L225 Difference]: With dead ends: 348 [2018-10-10 14:53:13,510 INFO L226 Difference]: Without dead ends: 348 [2018-10-10 14:53:13,511 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2018-10-10 14:53:13,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-10-10 14:53:13,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 247. [2018-10-10 14:53:13,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-10-10 14:53:13,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 252 transitions. [2018-10-10 14:53:13,518 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 252 transitions. Word has length 117 [2018-10-10 14:53:13,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:53:13,518 INFO L481 AbstractCegarLoop]: Abstraction has 247 states and 252 transitions. [2018-10-10 14:53:13,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 14:53:13,519 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 252 transitions. [2018-10-10 14:53:13,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-10 14:53:13,520 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:53:13,520 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:13,521 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:53:13,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:53:13,521 INFO L82 PathProgramCache]: Analyzing trace with hash -391472974, now seen corresponding path program 1 times [2018-10-10 14:53:13,521 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:53:13,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:53:13,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:13,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:53:13,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:13,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:53:14,038 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-10 14:53:14,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:53:14,039 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:53:14,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:53:14,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:53:14,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:53:14,159 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:53:14,162 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:53:14,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:53:14,232 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-10 14:53:14,254 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:53:14,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:53:14,376 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:53:14,377 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-10-10 14:53:14,554 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:53:14,577 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:53:14,579 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:53:14,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:53:14,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:53:14,609 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2018-10-10 14:53:14,644 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:53:14,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:53:14,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:53:14,672 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:9 [2018-10-10 14:53:14,849 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:53:14,851 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:53:14,852 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:53:14,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:53:14,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:53:14,887 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2018-10-10 14:53:14,895 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:53:14,896 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:53:14,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:53:14,910 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:9 [2018-10-10 14:53:15,083 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-10 14:53:15,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:53:15,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 19 [2018-10-10 14:53:15,143 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/ArraysOfVariableLength2_true-valid-memsafety.c_10.bpl [2018-10-10 14:53:15,144 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-10 14:53:15,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-10 14:53:15,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2018-10-10 14:53:15,145 INFO L87 Difference]: Start difference. First operand 247 states and 252 transitions. Second operand 20 states. [2018-10-10 14:53:17,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:53:17,459 INFO L93 Difference]: Finished difference Result 453 states and 466 transitions. [2018-10-10 14:53:17,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-10 14:53:17,459 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 118 [2018-10-10 14:53:17,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:53:17,462 INFO L225 Difference]: With dead ends: 453 [2018-10-10 14:53:17,462 INFO L226 Difference]: Without dead ends: 453 [2018-10-10 14:53:17,464 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 113 SyntacticMatches, 7 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=503, Invalid=2149, Unknown=0, NotChecked=0, Total=2652 [2018-10-10 14:53:17,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-10-10 14:53:17,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 253. [2018-10-10 14:53:17,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-10-10 14:53:17,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 259 transitions. [2018-10-10 14:53:17,470 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 259 transitions. Word has length 118 [2018-10-10 14:53:17,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:53:17,470 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 259 transitions. [2018-10-10 14:53:17,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-10 14:53:17,471 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 259 transitions. [2018-10-10 14:53:17,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-10 14:53:17,472 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:53:17,472 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:17,473 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:53:17,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:53:17,473 INFO L82 PathProgramCache]: Analyzing trace with hash -291854472, now seen corresponding path program 1 times [2018-10-10 14:53:17,473 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:53:17,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:53:17,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:17,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:53:17,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:17,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:53:17,731 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-10 14:53:17,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:53:17,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 14:53:17,732 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 14:53:17,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 14:53:17,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-10 14:53:17,732 INFO L87 Difference]: Start difference. First operand 253 states and 259 transitions. Second operand 5 states. [2018-10-10 14:53:18,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:53:18,339 INFO L93 Difference]: Finished difference Result 305 states and 313 transitions. [2018-10-10 14:53:18,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 14:53:18,339 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 128 [2018-10-10 14:53:18,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:53:18,341 INFO L225 Difference]: With dead ends: 305 [2018-10-10 14:53:18,341 INFO L226 Difference]: Without dead ends: 305 [2018-10-10 14:53:18,342 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:53:18,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-10-10 14:53:18,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 252. [2018-10-10 14:53:18,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-10-10 14:53:18,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 258 transitions. [2018-10-10 14:53:18,349 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 258 transitions. Word has length 128 [2018-10-10 14:53:18,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:53:18,350 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 258 transitions. [2018-10-10 14:53:18,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 14:53:18,350 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 258 transitions. [2018-10-10 14:53:18,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-10 14:53:18,351 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:53:18,351 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-10 14:53:18,352 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:53:18,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:53:18,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1856131195, now seen corresponding path program 1 times [2018-10-10 14:53:18,352 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:53:18,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:53:18,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:18,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:53:18,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:18,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:53:18,502 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:53:18,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:53:18,502 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:53:18,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:53:18,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:53:18,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:53:18,684 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:53:18,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:53:18,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-10-10 14:53:18,721 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/ArraysOfVariableLength2_true-valid-memsafety.c_12.bpl [2018-10-10 14:53:18,722 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 14:53:18,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 14:53:18,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:53:18,723 INFO L87 Difference]: Start difference. First operand 252 states and 258 transitions. Second operand 11 states. [2018-10-10 14:53:19,440 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-10 14:53:19,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:53:19,927 INFO L93 Difference]: Finished difference Result 276 states and 281 transitions. [2018-10-10 14:53:19,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 14:53:19,928 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 129 [2018-10-10 14:53:19,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:53:19,929 INFO L225 Difference]: With dead ends: 276 [2018-10-10 14:53:19,929 INFO L226 Difference]: Without dead ends: 276 [2018-10-10 14:53:19,929 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2018-10-10 14:53:19,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-10-10 14:53:19,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 252. [2018-10-10 14:53:19,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-10-10 14:53:19,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 257 transitions. [2018-10-10 14:53:19,934 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 257 transitions. Word has length 129 [2018-10-10 14:53:19,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:53:19,934 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 257 transitions. [2018-10-10 14:53:19,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 14:53:19,935 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 257 transitions. [2018-10-10 14:53:19,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-10 14:53:19,936 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:53:19,936 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:19,937 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:53:19,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:53:19,937 INFO L82 PathProgramCache]: Analyzing trace with hash -457553930, now seen corresponding path program 1 times [2018-10-10 14:53:19,937 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:53:19,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:53:19,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:19,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:53:19,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:19,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:53:20,394 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-10 14:53:20,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:53:20,394 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:53:20,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:53:20,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:53:20,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:53:20,826 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:53:20,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:53:20,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:53:20,836 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:14 [2018-10-10 14:53:21,334 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:53:21,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:53:21,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 26 [2018-10-10 14:53:21,385 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/ArraysOfVariableLength2_true-valid-memsafety.c_13.bpl [2018-10-10 14:53:21,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-10 14:53:21,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-10 14:53:21,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=640, Unknown=0, NotChecked=0, Total=702 [2018-10-10 14:53:21,389 INFO L87 Difference]: Start difference. First operand 252 states and 257 transitions. Second operand 27 states. [2018-10-10 14:53:23,703 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2018-10-10 14:53:23,930 WARN L178 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2018-10-10 14:53:26,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:53:26,176 INFO L93 Difference]: Finished difference Result 354 states and 362 transitions. [2018-10-10 14:53:26,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-10 14:53:26,177 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 129 [2018-10-10 14:53:26,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:53:26,179 INFO L225 Difference]: With dead ends: 354 [2018-10-10 14:53:26,179 INFO L226 Difference]: Without dead ends: 354 [2018-10-10 14:53:26,181 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 973 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1487, Invalid=4213, Unknown=0, NotChecked=0, Total=5700 [2018-10-10 14:53:26,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-10-10 14:53:26,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 251. [2018-10-10 14:53:26,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-10-10 14:53:26,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 256 transitions. [2018-10-10 14:53:26,186 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 256 transitions. Word has length 129 [2018-10-10 14:53:26,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:53:26,187 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 256 transitions. [2018-10-10 14:53:26,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-10 14:53:26,187 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 256 transitions. [2018-10-10 14:53:26,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-10 14:53:26,188 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:53:26,189 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:26,189 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:53:26,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:53:26,189 INFO L82 PathProgramCache]: Analyzing trace with hash 468422406, now seen corresponding path program 1 times [2018-10-10 14:53:26,190 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:53:26,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:53:26,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:26,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:53:26,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:26,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:53:26,825 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:53:26,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:53:26,825 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:53:26,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:53:26,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:53:26,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:53:27,062 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:53:27,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:53:27,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2018-10-10 14:53:27,095 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/ArraysOfVariableLength2_true-valid-memsafety.c_14.bpl [2018-10-10 14:53:27,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 14:53:27,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 14:53:27,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-10-10 14:53:27,097 INFO L87 Difference]: Start difference. First operand 251 states and 256 transitions. Second operand 15 states. [2018-10-10 14:53:27,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:53:27,603 INFO L93 Difference]: Finished difference Result 401 states and 409 transitions. [2018-10-10 14:53:27,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-10 14:53:27,604 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 144 [2018-10-10 14:53:27,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:53:27,606 INFO L225 Difference]: With dead ends: 401 [2018-10-10 14:53:27,607 INFO L226 Difference]: Without dead ends: 401 [2018-10-10 14:53:27,607 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=222, Invalid=708, Unknown=0, NotChecked=0, Total=930 [2018-10-10 14:53:27,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-10-10 14:53:27,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 300. [2018-10-10 14:53:27,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-10-10 14:53:27,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 305 transitions. [2018-10-10 14:53:27,613 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 305 transitions. Word has length 144 [2018-10-10 14:53:27,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:53:27,614 INFO L481 AbstractCegarLoop]: Abstraction has 300 states and 305 transitions. [2018-10-10 14:53:27,614 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 14:53:27,614 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 305 transitions. [2018-10-10 14:53:27,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-10 14:53:27,615 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:53:27,615 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-10 14:53:27,615 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:53:27,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:53:27,616 INFO L82 PathProgramCache]: Analyzing trace with hash -292168281, now seen corresponding path program 1 times [2018-10-10 14:53:27,616 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:53:27,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:53:27,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:27,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:53:27,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:27,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:53:27,936 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-10 14:53:27,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:53:27,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-10-10 14:53:27,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 14:53:27,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 14:53:27,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2018-10-10 14:53:27,937 INFO L87 Difference]: Start difference. First operand 300 states and 305 transitions. Second operand 15 states. [2018-10-10 14:53:28,880 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-10-10 14:53:29,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:53:29,919 INFO L93 Difference]: Finished difference Result 398 states and 406 transitions. [2018-10-10 14:53:29,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-10 14:53:29,920 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 155 [2018-10-10 14:53:29,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:53:29,923 INFO L225 Difference]: With dead ends: 398 [2018-10-10 14:53:29,923 INFO L226 Difference]: Without dead ends: 398 [2018-10-10 14:53:29,925 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=653, Invalid=1797, Unknown=0, NotChecked=0, Total=2450 [2018-10-10 14:53:29,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-10-10 14:53:29,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 306. [2018-10-10 14:53:29,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-10-10 14:53:29,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 312 transitions. [2018-10-10 14:53:29,932 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 312 transitions. Word has length 155 [2018-10-10 14:53:29,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:53:29,932 INFO L481 AbstractCegarLoop]: Abstraction has 306 states and 312 transitions. [2018-10-10 14:53:29,932 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 14:53:29,933 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 312 transitions. [2018-10-10 14:53:29,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-10 14:53:29,934 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:53:29,934 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:53:29,934 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:53:29,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:53:29,935 INFO L82 PathProgramCache]: Analyzing trace with hash -319620997, now seen corresponding path program 1 times [2018-10-10 14:53:29,935 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:53:29,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:53:29,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:29,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:53:29,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:29,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:53:30,711 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-10 14:53:30,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:53:30,711 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:53:30,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:53:30,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:53:30,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:53:30,973 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 40 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-10 14:53:31,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:53:31,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 18 [2018-10-10 14:53:31,029 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl [2018-10-10 14:53:31,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-10 14:53:31,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-10 14:53:31,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-10-10 14:53:31,035 INFO L87 Difference]: Start difference. First operand 306 states and 312 transitions. Second operand 18 states. [2018-10-10 14:53:32,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:53:32,776 INFO L93 Difference]: Finished difference Result 908 states and 929 transitions. [2018-10-10 14:53:32,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-10 14:53:32,776 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 172 [2018-10-10 14:53:32,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:53:32,781 INFO L225 Difference]: With dead ends: 908 [2018-10-10 14:53:32,781 INFO L226 Difference]: Without dead ends: 908 [2018-10-10 14:53:32,783 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1457 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=900, Invalid=3930, Unknown=0, NotChecked=0, Total=4830 [2018-10-10 14:53:32,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2018-10-10 14:53:32,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 356. [2018-10-10 14:53:32,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-10-10 14:53:32,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 364 transitions. [2018-10-10 14:53:32,794 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 364 transitions. Word has length 172 [2018-10-10 14:53:32,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:53:32,794 INFO L481 AbstractCegarLoop]: Abstraction has 356 states and 364 transitions. [2018-10-10 14:53:32,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-10 14:53:32,795 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 364 transitions. [2018-10-10 14:53:32,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-10-10 14:53:32,795 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:53:32,796 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-10 14:53:32,796 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:53:32,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:53:32,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1490902191, now seen corresponding path program 1 times [2018-10-10 14:53:32,797 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:53:32,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:53:32,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:32,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:53:32,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:32,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:53:33,055 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 22 proven. 38 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-10 14:53:33,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:53:33,056 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:53:33,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:53:33,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:53:33,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:53:33,209 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 26 proven. 34 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-10 14:53:33,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:53:33,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2018-10-10 14:53:33,240 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/ArraysOfVariableLength2_true-valid-memsafety.c_17.bpl [2018-10-10 14:53:33,241 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 14:53:33,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 14:53:33,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:53:33,242 INFO L87 Difference]: Start difference. First operand 356 states and 364 transitions. Second operand 13 states. [2018-10-10 14:53:33,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:53:33,523 INFO L93 Difference]: Finished difference Result 370 states and 376 transitions. [2018-10-10 14:53:33,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-10 14:53:33,524 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 173 [2018-10-10 14:53:33,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:53:33,526 INFO L225 Difference]: With dead ends: 370 [2018-10-10 14:53:33,526 INFO L226 Difference]: Without dead ends: 370 [2018-10-10 14:53:33,527 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2018-10-10 14:53:33,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-10-10 14:53:33,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 356. [2018-10-10 14:53:33,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-10-10 14:53:33,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 362 transitions. [2018-10-10 14:53:33,532 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 362 transitions. Word has length 173 [2018-10-10 14:53:33,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:53:33,533 INFO L481 AbstractCegarLoop]: Abstraction has 356 states and 362 transitions. [2018-10-10 14:53:33,533 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 14:53:33,533 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 362 transitions. [2018-10-10 14:53:33,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-10 14:53:33,534 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:53:33,534 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:53:33,535 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:53:33,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:53:33,535 INFO L82 PathProgramCache]: Analyzing trace with hash -117380477, now seen corresponding path program 1 times [2018-10-10 14:53:33,535 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:53:33,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:53:33,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:33,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:53:33,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:33,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:53:33,920 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-10 14:53:34,369 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-10 14:53:34,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:53:34,369 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:53:34,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:53:34,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:53:34,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:53:34,449 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:53:34,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:53:34,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:53:34,461 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-10 14:53:34,464 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:53:34,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:53:34,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:53:34,479 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-10-10 14:53:34,509 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:53:34,510 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:53:34,510 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:53:34,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:53:34,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:53:34,518 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:16 [2018-10-10 14:53:34,524 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:53:34,525 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:53:34,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:53:34,536 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:12 [2018-10-10 14:53:34,682 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:53:34,683 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:53:34,683 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:53:34,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:53:34,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:53:34,692 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:19 [2018-10-10 14:53:34,726 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:53:34,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:53:34,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:53:34,737 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-10-10 14:53:35,257 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-10 14:53:35,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:53:35,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 30 [2018-10-10 14:53:35,297 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/ArraysOfVariableLength2_true-valid-memsafety.c_18.bpl [2018-10-10 14:53:35,298 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-10 14:53:35,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-10 14:53:35,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=824, Unknown=0, NotChecked=0, Total=930 [2018-10-10 14:53:35,299 INFO L87 Difference]: Start difference. First operand 356 states and 362 transitions. Second operand 31 states. [2018-10-10 14:53:37,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:53:37,084 INFO L93 Difference]: Finished difference Result 465 states and 473 transitions. [2018-10-10 14:53:37,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-10 14:53:37,085 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 190 [2018-10-10 14:53:37,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:53:37,087 INFO L225 Difference]: With dead ends: 465 [2018-10-10 14:53:37,087 INFO L226 Difference]: Without dead ends: 465 [2018-10-10 14:53:37,088 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 180 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=324, Invalid=2226, Unknown=0, NotChecked=0, Total=2550 [2018-10-10 14:53:37,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2018-10-10 14:53:37,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 415. [2018-10-10 14:53:37,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-10-10 14:53:37,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 422 transitions. [2018-10-10 14:53:37,095 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 422 transitions. Word has length 190 [2018-10-10 14:53:37,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:53:37,095 INFO L481 AbstractCegarLoop]: Abstraction has 415 states and 422 transitions. [2018-10-10 14:53:37,095 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-10 14:53:37,095 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 422 transitions. [2018-10-10 14:53:37,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-10-10 14:53:37,097 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:53:37,097 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-10 14:53:37,097 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:53:37,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:53:37,098 INFO L82 PathProgramCache]: Analyzing trace with hash 730670320, now seen corresponding path program 1 times [2018-10-10 14:53:37,098 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:53:37,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:53:37,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:37,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:53:37,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:37,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:53:37,591 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-10 14:53:37,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:53:37,591 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:53:37,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:53:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:53:37,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:53:37,731 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-10 14:53:37,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:53:37,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-10-10 14:53:37,761 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl [2018-10-10 14:53:37,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:53:37,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:53:37,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:53:37,763 INFO L87 Difference]: Start difference. First operand 415 states and 422 transitions. Second operand 9 states. [2018-10-10 14:53:37,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:53:37,917 INFO L93 Difference]: Finished difference Result 603 states and 614 transitions. [2018-10-10 14:53:37,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 14:53:37,917 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 208 [2018-10-10 14:53:37,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:53:37,920 INFO L225 Difference]: With dead ends: 603 [2018-10-10 14:53:37,920 INFO L226 Difference]: Without dead ends: 603 [2018-10-10 14:53:37,921 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:53:37,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2018-10-10 14:53:37,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 426. [2018-10-10 14:53:37,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2018-10-10 14:53:37,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 433 transitions. [2018-10-10 14:53:37,927 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 433 transitions. Word has length 208 [2018-10-10 14:53:37,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:53:37,927 INFO L481 AbstractCegarLoop]: Abstraction has 426 states and 433 transitions. [2018-10-10 14:53:37,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:53:37,928 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 433 transitions. [2018-10-10 14:53:37,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-10-10 14:53:37,929 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:53:37,929 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-10 14:53:37,930 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:53:37,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:53:37,930 INFO L82 PathProgramCache]: Analyzing trace with hash -845001261, now seen corresponding path program 1 times [2018-10-10 14:53:37,930 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:53:37,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:53:37,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:37,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:53:37,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:37,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:53:38,744 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-10 14:53:38,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:53:38,744 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:53:38,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:53:38,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:53:38,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:53:40,187 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:53:40,187 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:53:40,188 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:53:40,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:53:40,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:53:40,197 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:21 [2018-10-10 14:53:40,319 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 17 treesize of output 20 [2018-10-10 14:53:40,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:53:40,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:53:40,335 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:27, output treesize:17 [2018-10-10 14:53:40,813 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 60 proven. 105 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-10 14:53:40,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:53:40,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20] total 42 [2018-10-10 14:53:40,844 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl [2018-10-10 14:53:40,845 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-10 14:53:40,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-10 14:53:40,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1644, Unknown=0, NotChecked=0, Total=1806 [2018-10-10 14:53:40,846 INFO L87 Difference]: Start difference. First operand 426 states and 433 transitions. Second operand 43 states. [2018-10-10 14:53:42,330 WARN L178 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 36 [2018-10-10 14:53:46,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:53:46,362 INFO L93 Difference]: Finished difference Result 545 states and 555 transitions. [2018-10-10 14:53:46,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-10 14:53:46,362 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 254 [2018-10-10 14:53:46,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:53:46,366 INFO L225 Difference]: With dead ends: 545 [2018-10-10 14:53:46,366 INFO L226 Difference]: Without dead ends: 545 [2018-10-10 14:53:46,369 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 236 SyntacticMatches, 2 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1960 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=1607, Invalid=6765, Unknown=0, NotChecked=0, Total=8372 [2018-10-10 14:53:46,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2018-10-10 14:53:46,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 430. [2018-10-10 14:53:46,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-10-10 14:53:46,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 437 transitions. [2018-10-10 14:53:46,375 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 437 transitions. Word has length 254 [2018-10-10 14:53:46,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:53:46,376 INFO L481 AbstractCegarLoop]: Abstraction has 430 states and 437 transitions. [2018-10-10 14:53:46,376 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-10 14:53:46,376 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 437 transitions. [2018-10-10 14:53:46,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-10-10 14:53:46,378 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:53:46,378 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-10 14:53:46,379 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:53:46,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:53:46,379 INFO L82 PathProgramCache]: Analyzing trace with hash -563204889, now seen corresponding path program 2 times [2018-10-10 14:53:46,379 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:53:46,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:53:46,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:46,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:53:46,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:53:46,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:53:46,849 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 15 proven. 210 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-10 14:53:46,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:53:46,849 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:53:46,857 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-10 14:53:46,929 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-10 14:53:46,929 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-10 14:53:46,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:53:47,224 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 42 proven. 183 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-10 14:53:47,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:53:47,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 21 [2018-10-10 14:53:47,247 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-10 14:53:47,251 WARN L205 ceAbstractionStarter]: Timeout [2018-10-10 14:53:47,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 02:53:47 BoogieIcfgContainer [2018-10-10 14:53:47,251 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 14:53:47,252 INFO L168 Benchmark]: Toolchain (without parser) took 42624.63 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -985.4 MB). Peak memory consumption was 221.5 MB. Max. memory is 7.1 GB. [2018-10-10 14:53:47,253 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:53:47,253 INFO L168 Benchmark]: CACSL2BoogieTranslator took 246.86 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-10-10 14:53:47,254 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.29 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:53:47,255 INFO L168 Benchmark]: Boogie Preprocessor took 34.42 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:53:47,255 INFO L168 Benchmark]: RCFGBuilder took 1080.35 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -762.3 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. [2018-10-10 14:53:47,256 INFO L168 Benchmark]: TraceAbstraction took 41210.99 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 456.1 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -233.7 MB). Peak memory consumption was 222.5 MB. Max. memory is 7.1 GB. [2018-10-10 14:53:47,260 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 246.86 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 47.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.42 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 1080.35 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 750.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -762.3 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 41210.99 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 456.1 MB). Free memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: -233.7 MB). Peak memory consumption was 222.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 21). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 21). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 21). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 21). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 21). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 21). - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 31). Cancelled while PathProgramDumpController was trying to verify (iteration 21). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 21). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 21). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 21). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 21). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 186 locations, 11 error locations. TIMEOUT Result, 41.1s OverallTime, 21 OverallIterations, 6 TraceHistogramMax, 26.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4190 SDtfs, 25089 SDslu, 23084 SDs, 0 SdLazy, 7292 SolverSat, 442 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2189 GetRequests, 1604 SyntacticMatches, 18 SemanticMatches, 567 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6704 ImplicationChecksByTransitivity, 23.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=430occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 2216 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 11.8s InterpolantComputationTime, 4019 NumberOfCodeBlocks, 4019 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 3989 ConstructedInterpolants, 94 QuantifiedInterpolants, 3817406 SizeOfPredicates, 129 NumberOfNonLiveVariables, 2918 ConjunctsInSsa, 192 ConjunctsInUnsatCore, 30 InterpolantComputations, 10 PerfectInterpolantSequences, 322/1176 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Received shutdown request...