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 --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call1_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ddc4263 [2018-08-07 10:50:13,682 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-08-07 10:50:13,685 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-08-07 10:50:13,697 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-08-07 10:50:13,697 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-08-07 10:50:13,698 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-08-07 10:50:13,699 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-08-07 10:50:13,702 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-08-07 10:50:13,704 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-08-07 10:50:13,707 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-08-07 10:50:13,708 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-08-07 10:50:13,708 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-08-07 10:50:13,710 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-08-07 10:50:13,712 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-08-07 10:50:13,713 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-08-07 10:50:13,713 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-08-07 10:50:13,714 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-08-07 10:50:13,716 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-08-07 10:50:13,718 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-08-07 10:50:13,720 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-08-07 10:50:13,721 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-08-07 10:50:13,722 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-08-07 10:50:13,724 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-08-07 10:50:13,725 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-08-07 10:50:13,725 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-08-07 10:50:13,726 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-08-07 10:50:13,727 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-08-07 10:50:13,728 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-08-07 10:50:13,729 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-08-07 10:50:13,730 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-08-07 10:50:13,730 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-08-07 10:50:13,731 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-08-07 10:50:13,731 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-08-07 10:50:13,731 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-08-07 10:50:13,732 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-08-07 10:50:13,733 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-08-07 10:50:13,733 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf [2018-08-07 10:50:13,749 INFO L110 SettingsManager]: Loading preferences was successful [2018-08-07 10:50:13,749 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-08-07 10:50:13,750 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-08-07 10:50:13,750 INFO L133 SettingsManager]: * User list type=DISABLED [2018-08-07 10:50:13,750 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-08-07 10:50:13,750 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-08-07 10:50:13,751 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-08-07 10:50:13,751 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-08-07 10:50:13,751 INFO L133 SettingsManager]: * Log string format=TERM [2018-08-07 10:50:13,751 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-08-07 10:50:13,751 INFO L133 SettingsManager]: * Interval Domain=false [2018-08-07 10:50:13,752 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-08-07 10:50:13,752 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-08-07 10:50:13,752 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-08-07 10:50:13,753 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-08-07 10:50:13,753 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-08-07 10:50:13,753 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-08-07 10:50:13,753 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-08-07 10:50:13,753 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-08-07 10:50:13,754 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-08-07 10:50:13,754 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-08-07 10:50:13,754 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-08-07 10:50:13,754 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-08-07 10:50:13,754 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-08-07 10:50:13,755 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-08-07 10:50:13,755 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-08-07 10:50:13,755 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-08-07 10:50:13,755 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-08-07 10:50:13,755 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-08-07 10:50:13,755 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-08-07 10:50:13,756 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-08-07 10:50:13,756 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-08-07 10:50:13,756 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-08-07 10:50:13,799 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-08-07 10:50:13,817 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-08-07 10:50:13,822 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-08-07 10:50:13,824 INFO L271 PluginConnector]: Initializing CDTParser... [2018-08-07 10:50:13,824 INFO L276 PluginConnector]: CDTParser initialized [2018-08-07 10:50:13,825 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call1_true-termination.i [2018-08-07 10:50:14,189 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb15f1f51/131e6ea6d35b4fb6b32259ab4e7869bf/FLAG50a970c89 [2018-08-07 10:50:14,338 INFO L276 CDTParser]: Found 1 translation units. [2018-08-07 10:50:14,339 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call1_true-termination.i [2018-08-07 10:50:14,346 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb15f1f51/131e6ea6d35b4fb6b32259ab4e7869bf/FLAG50a970c89 [2018-08-07 10:50:14,363 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb15f1f51/131e6ea6d35b4fb6b32259ab4e7869bf [2018-08-07 10:50:14,374 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-08-07 10:50:14,376 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-08-07 10:50:14,378 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-08-07 10:50:14,378 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-08-07 10:50:14,385 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-08-07 10:50:14,386 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.08 10:50:14" (1/1) ... [2018-08-07 10:50:14,389 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6111040e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 10:50:14, skipping insertion in model container [2018-08-07 10:50:14,389 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.08 10:50:14" (1/1) ... [2018-08-07 10:50:14,541 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-08-07 10:50:14,578 INFO L175 PostProcessor]: Settings: Checked method=main [2018-08-07 10:50:14,593 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-08-07 10:50:14,599 INFO L175 PostProcessor]: Settings: Checked method=main [2018-08-07 10:50:14,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 10:50:14 WrapperNode [2018-08-07 10:50:14,613 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-08-07 10:50:14,614 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-08-07 10:50:14,614 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-08-07 10:50:14,614 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-08-07 10:50:14,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 10:50:14" (1/1) ... [2018-08-07 10:50:14,636 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 10:50:14" (1/1) ... [2018-08-07 10:50:14,643 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-08-07 10:50:14,643 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-08-07 10:50:14,643 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-08-07 10:50:14,643 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-08-07 10:50:14,654 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 10:50:14" (1/1) ... [2018-08-07 10:50:14,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 10:50:14" (1/1) ... [2018-08-07 10:50:14,655 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 10:50:14" (1/1) ... [2018-08-07 10:50:14,656 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 10:50:14" (1/1) ... [2018-08-07 10:50:14,658 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 10:50:14" (1/1) ... [2018-08-07 10:50:14,666 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 10:50:14" (1/1) ... [2018-08-07 10:50:14,667 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 10:50:14" (1/1) ... [2018-08-07 10:50:14,669 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-08-07 10:50:14,670 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-08-07 10:50:14,670 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-08-07 10:50:14,670 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-08-07 10:50:14,671 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 10:50:14" (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-08-07 10:50:14,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-08-07 10:50:14,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-08-07 10:50:14,740 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_crafted_simple_array_index_value_true_unreach_call__true_termination_i____VERIFIER_assert [2018-08-07 10:50:14,741 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_crafted_simple_array_index_value_true_unreach_call__true_termination_i____VERIFIER_assert [2018-08-07 10:50:14,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-08-07 10:50:14,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-08-07 10:50:14,741 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-08-07 10:50:14,741 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-08-07 10:50:15,101 INFO L273 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-08-07 10:50:15,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.08 10:50:15 BoogieIcfgContainer [2018-08-07 10:50:15,102 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-08-07 10:50:15,103 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-08-07 10:50:15,103 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-08-07 10:50:15,117 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-08-07 10:50:15,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.08 10:50:14" (1/3) ... [2018-08-07 10:50:15,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72c8a0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.08 10:50:15, skipping insertion in model container [2018-08-07 10:50:15,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.08 10:50:14" (2/3) ... [2018-08-07 10:50:15,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72c8a0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.08 10:50:15, skipping insertion in model container [2018-08-07 10:50:15,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.08 10:50:15" (3/3) ... [2018-08-07 10:50:15,124 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_true-unreach-call1_true-termination.i [2018-08-07 10:50:15,143 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-08-07 10:50:15,151 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-08-07 10:50:15,197 INFO L129 ementStrategyFactory]: Using default assertion order modulation [2018-08-07 10:50:15,198 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-08-07 10:50:15,198 INFO L382 AbstractCegarLoop]: Hoare is true [2018-08-07 10:50:15,199 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-08-07 10:50:15,199 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-08-07 10:50:15,199 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-08-07 10:50:15,199 INFO L386 AbstractCegarLoop]: Difference is false [2018-08-07 10:50:15,199 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-08-07 10:50:15,199 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-08-07 10:50:15,219 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-08-07 10:50:15,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-08-07 10:50:15,226 INFO L368 BasicCegarLoop]: Found error trace [2018-08-07 10:50:15,227 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-08-07 10:50:15,228 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_crafted_simple_array_index_value_true_unreach_call__true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-08-07 10:50:15,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1189535701, now seen corresponding path program 1 times [2018-08-07 10:50:15,237 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-08-07 10:50:15,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-08-07 10:50:15,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-08-07 10:50:15,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-08-07 10:50:15,288 INFO L292 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-08-07 10:50:15,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-08-07 10:50:15,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-08-07 10:50:15,350 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-08-07 10:50:15,350 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-08-07 10:50:15,350 INFO L262 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-08-07 10:50:15,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-08-07 10:50:15,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-08-07 10:50:15,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-08-07 10:50:15,370 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-08-07 10:50:15,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-08-07 10:50:15,392 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2018-08-07 10:50:15,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-08-07 10:50:15,394 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-08-07 10:50:15,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-08-07 10:50:15,406 INFO L225 Difference]: With dead ends: 42 [2018-08-07 10:50:15,406 INFO L226 Difference]: Without dead ends: 21 [2018-08-07 10:50:15,410 INFO L603 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-08-07 10:50:15,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-08-07 10:50:15,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-08-07 10:50:15,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-08-07 10:50:15,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2018-08-07 10:50:15,454 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 14 [2018-08-07 10:50:15,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-08-07 10:50:15,454 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-08-07 10:50:15,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-08-07 10:50:15,455 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2018-08-07 10:50:15,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-08-07 10:50:15,456 INFO L368 BasicCegarLoop]: Found error trace [2018-08-07 10:50:15,456 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-08-07 10:50:15,456 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_crafted_simple_array_index_value_true_unreach_call__true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-08-07 10:50:15,457 INFO L82 PathProgramCache]: Analyzing trace with hash -2089413066, now seen corresponding path program 1 times [2018-08-07 10:50:15,457 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-08-07 10:50:15,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-08-07 10:50:15,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-08-07 10:50:15,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-08-07 10:50:15,459 INFO L292 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-08-07 10:50:15,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-08-07 10:50:15,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-08-07 10:50:15,627 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-08-07 10:50:15,627 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-08-07 10:50:15,627 INFO L262 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-08-07 10:50:15,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-08-07 10:50:15,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-08-07 10:50:15,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-08-07 10:50:15,630 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 3 states. [2018-08-07 10:50:15,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-08-07 10:50:15,749 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2018-08-07 10:50:15,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-08-07 10:50:15,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-08-07 10:50:15,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-08-07 10:50:15,752 INFO L225 Difference]: With dead ends: 42 [2018-08-07 10:50:15,752 INFO L226 Difference]: Without dead ends: 29 [2018-08-07 10:50:15,753 INFO L603 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-08-07 10:50:15,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-08-07 10:50:15,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2018-08-07 10:50:15,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-08-07 10:50:15,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-08-07 10:50:15,763 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 15 [2018-08-07 10:50:15,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-08-07 10:50:15,763 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-08-07 10:50:15,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-08-07 10:50:15,764 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-08-07 10:50:15,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-08-07 10:50:15,765 INFO L368 BasicCegarLoop]: Found error trace [2018-08-07 10:50:15,765 INFO L376 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-08-07 10:50:15,767 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_crafted_simple_array_index_value_true_unreach_call__true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-08-07 10:50:15,768 INFO L82 PathProgramCache]: Analyzing trace with hash -2119982969, now seen corresponding path program 1 times [2018-08-07 10:50:15,768 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-08-07 10:50:15,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-08-07 10:50:15,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-08-07 10:50:15,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-08-07 10:50:15,770 INFO L292 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-08-07 10:50:15,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-08-07 10:50:15,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-08-07 10:50:15,866 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-08-07 10:50:15,866 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-08-07 10:50:15,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-08-07 10:50:15,891 INFO L292 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-08-07 10:50:15,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-08-07 10:50:15,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-08-07 10:50:16,001 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 22 treesize of output 21 [2018-08-07 10:50:16,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-08-07 10:50:16,012 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 23 treesize of output 22 [2018-08-07 10:50:16,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-08-07 10:50:16,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-08-07 10:50:16,190 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:76, output treesize:16 [2018-08-07 10:50:16,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-08-07 10:50:16,629 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-08-07 10:50:17,246 WARN L170 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 25 [2018-08-07 10:50:17,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-08-07 10:50:17,261 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-08-07 10:50:17,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-08-07 10:50:17,282 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:5 [2018-08-07 10:50:17,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-08-07 10:50:17,358 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-08-07 10:50:17,358 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-08-07 10:50:17,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-08-07 10:50:17,387 INFO L292 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-08-07 10:50:17,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-08-07 10:50:17,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-08-07 10:50:17,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-08-07 10:50:17,424 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-08-07 10:50:17,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-08-07 10:50:17,684 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-08-07 10:50:17,684 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 8, 4, 4] total 16 [2018-08-07 10:50:17,685 INFO L255 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-08-07 10:50:17,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-08-07 10:50:17,685 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-08-07 10:50:17,686 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-08-07 10:50:17,689 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 8 states. [2018-08-07 10:50:20,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-08-07 10:50:20,097 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2018-08-07 10:50:20,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-08-07 10:50:20,100 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-08-07 10:50:20,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-08-07 10:50:20,101 INFO L225 Difference]: With dead ends: 57 [2018-08-07 10:50:20,102 INFO L226 Difference]: Without dead ends: 41 [2018-08-07 10:50:20,103 INFO L603 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-08-07 10:50:20,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-08-07 10:50:20,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2018-08-07 10:50:20,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-08-07 10:50:20,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-08-07 10:50:20,113 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 18 [2018-08-07 10:50:20,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-08-07 10:50:20,113 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-08-07 10:50:20,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-08-07 10:50:20,114 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-08-07 10:50:20,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-08-07 10:50:20,115 INFO L368 BasicCegarLoop]: Found error trace [2018-08-07 10:50:20,115 INFO L376 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-08-07 10:50:20,115 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_crafted_simple_array_index_value_true_unreach_call__true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-08-07 10:50:20,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1507542460, now seen corresponding path program 1 times [2018-08-07 10:50:20,116 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-08-07 10:50:20,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-08-07 10:50:20,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-08-07 10:50:20,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-08-07 10:50:20,117 INFO L292 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-08-07 10:50:20,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-08-07 10:50:20,282 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-08-07 10:50:20,282 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-08-07 10:50:20,282 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-08-07 10:50:20,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-08-07 10:50:20,301 INFO L292 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-08-07 10:50:20,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-08-07 10:50:20,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-08-07 10:50:20,378 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 23 treesize of output 22 [2018-08-07 10:50:20,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-08-07 10:50:20,395 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-08-07 10:50:20,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-08-07 10:50:20,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-08-07 10:50:20,439 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:76, output treesize:16 [2018-08-07 10:50:20,683 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-08-07 10:50:20,684 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-08-07 10:50:22,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2018-08-07 10:50:22,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-08-07 10:50:22,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-08-07 10:50:22,941 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:73, output treesize:5 [2018-08-07 10:50:23,005 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-08-07 10:50:23,027 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-08-07 10:50:23,027 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-08-07 10:50:23,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-08-07 10:50:23,043 INFO L292 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-08-07 10:50:23,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-08-07 10:50:23,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-08-07 10:50:23,108 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-08-07 10:50:23,108 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-08-07 10:50:23,208 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-08-07 10:50:23,218 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-08-07 10:50:23,218 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 10, 5, 5] total 21 [2018-08-07 10:50:23,218 INFO L255 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-08-07 10:50:23,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-08-07 10:50:23,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-08-07 10:50:23,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=335, Unknown=1, NotChecked=0, Total=420 [2018-08-07 10:50:23,221 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 10 states. [2018-08-07 10:50:23,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-08-07 10:50:23,714 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2018-08-07 10:50:23,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-08-07 10:50:23,715 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-08-07 10:50:23,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-08-07 10:50:23,716 INFO L225 Difference]: With dead ends: 78 [2018-08-07 10:50:23,716 INFO L226 Difference]: Without dead ends: 53 [2018-08-07 10:50:23,717 INFO L603 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 101 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=99, Invalid=406, Unknown=1, NotChecked=0, Total=506 [2018-08-07 10:50:23,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-08-07 10:50:23,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2018-08-07 10:50:23,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-08-07 10:50:23,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-08-07 10:50:23,728 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 30 [2018-08-07 10:50:23,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-08-07 10:50:23,729 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-08-07 10:50:23,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-08-07 10:50:23,729 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-08-07 10:50:23,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-08-07 10:50:23,730 INFO L368 BasicCegarLoop]: Found error trace [2018-08-07 10:50:23,731 INFO L376 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-08-07 10:50:23,731 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_crafted_simple_array_index_value_true_unreach_call__true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-08-07 10:50:23,731 INFO L82 PathProgramCache]: Analyzing trace with hash -642104728, now seen corresponding path program 1 times [2018-08-07 10:50:23,731 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-08-07 10:50:23,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-08-07 10:50:23,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-08-07 10:50:23,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-08-07 10:50:23,733 INFO L292 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-08-07 10:50:23,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-08-07 10:50:23,865 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-08-07 10:50:23,865 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-08-07 10:50:23,866 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-08-07 10:50:23,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-08-07 10:50:23,874 INFO L292 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-08-07 10:50:23,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-08-07 10:50:23,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-08-07 10:50:23,921 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 22 treesize of output 21 [2018-08-07 10:50:23,922 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-08-07 10:50:23,926 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 23 treesize of output 22 [2018-08-07 10:50:23,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-08-07 10:50:23,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-08-07 10:50:23,967 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:76, output treesize:16 [2018-08-07 10:50:24,509 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-08-07 10:50:24,510 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-08-07 10:50:26,655 WARN L1032 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~index~0 1))) (or (< 0 (mod .cse0 2)) (= (mod (select c_main_~array~0 (mod .cse0 4294967296)) 4294967296) 0))) is different from true [2018-08-07 10:50:28,697 WARN L170 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 13 [2018-08-07 10:50:28,832 WARN L170 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 25 [2018-08-07 10:50:28,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2018-08-07 10:50:28,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-08-07 10:50:28,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-08-07 10:50:28,850 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:5 [2018-08-07 10:50:28,976 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 4 trivial. 7 not checked. [2018-08-07 10:50:28,997 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-08-07 10:50:28,997 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-08-07 10:50:29,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-08-07 10:50:29,019 INFO L292 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-08-07 10:50:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-08-07 10:50:29,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-08-07 10:50:29,108 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-08-07 10:50:29,108 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-08-07 10:50:29,507 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-08-07 10:50:29,508 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-08-07 10:50:29,509 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 12, 6, 6] total 26 [2018-08-07 10:50:29,509 INFO L255 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-08-07 10:50:29,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-08-07 10:50:29,510 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-08-07 10:50:29,511 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=484, Unknown=1, NotChecked=46, Total=650 [2018-08-07 10:50:29,511 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 12 states. [2018-08-07 10:50:30,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-08-07 10:50:30,059 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2018-08-07 10:50:30,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-08-07 10:50:30,060 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-08-07 10:50:30,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-08-07 10:50:30,062 INFO L225 Difference]: With dead ends: 99 [2018-08-07 10:50:30,063 INFO L226 Difference]: Without dead ends: 65 [2018-08-07 10:50:30,064 INFO L603 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 145 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=136, Invalid=569, Unknown=1, NotChecked=50, Total=756 [2018-08-07 10:50:30,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-08-07 10:50:30,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2018-08-07 10:50:30,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-08-07 10:50:30,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2018-08-07 10:50:30,077 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 42 [2018-08-07 10:50:30,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-08-07 10:50:30,077 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2018-08-07 10:50:30,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-08-07 10:50:30,078 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2018-08-07 10:50:30,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-08-07 10:50:30,079 INFO L368 BasicCegarLoop]: Found error trace [2018-08-07 10:50:30,080 INFO L376 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-08-07 10:50:30,080 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_crafted_simple_array_index_value_true_unreach_call__true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-08-07 10:50:30,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1952021885, now seen corresponding path program 2 times [2018-08-07 10:50:30,080 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-08-07 10:50:30,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-08-07 10:50:30,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-08-07 10:50:30,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-08-07 10:50:30,082 INFO L292 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-08-07 10:50:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-08-07 10:50:30,304 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-08-07 10:50:30,305 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-08-07 10:50:30,305 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-08-07 10:50:30,313 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-08-07 10:50:30,313 INFO L292 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-08-07 10:50:30,347 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-08-07 10:50:30,347 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-08-07 10:50:30,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-08-07 10:50:30,389 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 23 treesize of output 22 [2018-08-07 10:50:30,390 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-08-07 10:50:30,391 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-08-07 10:50:30,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-08-07 10:50:30,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-08-07 10:50:30,425 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:76, output treesize:16 [2018-08-07 10:50:30,777 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 49 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-08-07 10:50:30,778 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-08-07 10:50:37,106 WARN L170 SmtUtils]: Spent 4.04 s on a formula simplification that was a NOOP. DAG size: 14 [2018-08-07 10:50:37,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2018-08-07 10:50:37,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-08-07 10:50:37,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-08-07 10:50:37,274 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:73, output treesize:5 [2018-08-07 10:50:41,436 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 49 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-08-07 10:50:41,457 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-08-07 10:50:41,457 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-08-07 10:50:41,473 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-08-07 10:50:41,473 INFO L292 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-08-07 10:50:41,564 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-08-07 10:50:41,564 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-08-07 10:50:41,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-08-07 10:50:41,588 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-08-07 10:50:41,589 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-08-07 10:50:49,264 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-08-07 10:50:49,265 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-08-07 10:50:49,266 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 14, 7, 7] total 31 [2018-08-07 10:50:49,266 INFO L255 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-08-07 10:50:49,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-08-07 10:50:49,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-08-07 10:50:49,270 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=748, Unknown=5, NotChecked=0, Total=930 [2018-08-07 10:50:49,270 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 14 states. [2018-08-07 10:50:51,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-08-07 10:50:51,889 INFO L93 Difference]: Finished difference Result 154 states and 173 transitions. [2018-08-07 10:50:51,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-08-07 10:50:51,890 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 54 [2018-08-07 10:50:51,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-08-07 10:50:51,891 INFO L225 Difference]: With dead ends: 154 [2018-08-07 10:50:51,891 INFO L226 Difference]: Without dead ends: 111 [2018-08-07 10:50:51,893 INFO L603 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 189 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=195, Invalid=856, Unknown=5, NotChecked=0, Total=1056 [2018-08-07 10:50:51,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-08-07 10:50:51,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 97. [2018-08-07 10:50:51,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-08-07 10:50:51,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2018-08-07 10:50:51,916 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 54 [2018-08-07 10:50:51,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-08-07 10:50:51,917 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2018-08-07 10:50:51,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-08-07 10:50:51,917 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2018-08-07 10:50:51,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-08-07 10:50:51,919 INFO L368 BasicCegarLoop]: Found error trace [2018-08-07 10:50:51,919 INFO L376 BasicCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-08-07 10:50:51,919 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_crafted_simple_array_index_value_true_unreach_call__true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-08-07 10:50:51,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1635777501, now seen corresponding path program 3 times [2018-08-07 10:50:51,920 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-08-07 10:50:51,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-08-07 10:50:51,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-08-07 10:50:51,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-08-07 10:50:51,921 INFO L292 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-08-07 10:50:51,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-08-07 10:50:52,117 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 6 proven. 57 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-08-07 10:50:52,118 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-08-07 10:50:52,118 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-08-07 10:50:52,125 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-08-07 10:50:52,125 INFO L292 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-08-07 10:50:52,348 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-08-07 10:50:52,348 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-08-07 10:50:52,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-08-07 10:50:52,372 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-08-07 10:50:52,373 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-08-07 10:50:54,263 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 6 proven. 57 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-08-07 10:50:54,283 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-08-07 10:50:54,284 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-08-07 10:50:54,300 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-08-07 10:50:54,300 INFO L292 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-08-07 10:50:55,057 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-08-07 10:50:55,057 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-08-07 10:50:55,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-08-07 10:50:55,077 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-08-07 10:50:55,077 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-08-07 10:50:55,104 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 6 proven. 57 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-08-07 10:50:55,106 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-08-07 10:50:55,106 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 9] total 16 [2018-08-07 10:50:55,106 INFO L255 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-08-07 10:50:55,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-08-07 10:50:55,108 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-08-07 10:50:55,108 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-08-07 10:50:55,109 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand 9 states. [2018-08-07 10:50:55,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-08-07 10:50:55,629 INFO L93 Difference]: Finished difference Result 161 states and 178 transitions. [2018-08-07 10:50:55,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-08-07 10:50:55,630 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2018-08-07 10:50:55,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-08-07 10:50:55,631 INFO L225 Difference]: With dead ends: 161 [2018-08-07 10:50:55,631 INFO L226 Difference]: Without dead ends: 89 [2018-08-07 10:50:55,632 INFO L603 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 231 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-08-07 10:50:55,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-08-07 10:50:55,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2018-08-07 10:50:55,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-08-07 10:50:55,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2018-08-07 10:50:55,651 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 60 [2018-08-07 10:50:55,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-08-07 10:50:55,651 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2018-08-07 10:50:55,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-08-07 10:50:55,652 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2018-08-07 10:50:55,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-08-07 10:50:55,653 INFO L368 BasicCegarLoop]: Found error trace [2018-08-07 10:50:55,653 INFO L376 BasicCegarLoop]: trace histogram [8, 7, 7, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-08-07 10:50:55,653 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_crafted_simple_array_index_value_true_unreach_call__true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-08-07 10:50:55,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1721665906, now seen corresponding path program 4 times [2018-08-07 10:50:55,654 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-08-07 10:50:55,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-08-07 10:50:55,655 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-08-07 10:50:55,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-08-07 10:50:55,655 INFO L292 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-08-07 10:50:55,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-08-07 10:50:55,932 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 6 proven. 77 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-08-07 10:50:55,932 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-08-07 10:50:55,932 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-08-07 10:50:55,941 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-08-07 10:50:55,941 INFO L292 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-08-07 10:50:55,963 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-08-07 10:50:55,963 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-08-07 10:50:55,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-08-07 10:50:55,989 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-08-07 10:50:55,989 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-08-07 10:50:58,866 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 6 proven. 74 refuted. 3 times theorem prover too weak. 35 trivial. 0 not checked. [2018-08-07 10:50:58,890 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-08-07 10:50:58,890 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-08-07 10:50:58,905 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-08-07 10:50:58,906 INFO L292 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-08-07 10:50:59,111 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-08-07 10:50:59,112 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-08-07 10:50:59,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-08-07 10:50:59,188 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-08-07 10:50:59,188 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-08-07 10:50:59,265 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 6 proven. 74 refuted. 3 times theorem prover too weak. 35 trivial. 0 not checked. [2018-08-07 10:50:59,269 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-08-07 10:50:59,269 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10, 10, 10] total 18 [2018-08-07 10:50:59,270 INFO L255 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-08-07 10:50:59,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-08-07 10:50:59,270 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-08-07 10:50:59,272 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=208, Unknown=1, NotChecked=0, Total=306 [2018-08-07 10:50:59,272 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand 10 states. [2018-08-07 10:50:59,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-08-07 10:50:59,719 INFO L93 Difference]: Finished difference Result 155 states and 170 transitions. [2018-08-07 10:50:59,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-08-07 10:50:59,720 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2018-08-07 10:50:59,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-08-07 10:50:59,721 INFO L225 Difference]: With dead ends: 155 [2018-08-07 10:50:59,721 INFO L226 Difference]: Without dead ends: 97 [2018-08-07 10:50:59,722 INFO L603 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 242 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=97, Invalid=208, Unknown=1, NotChecked=0, Total=306 [2018-08-07 10:50:59,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-08-07 10:50:59,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2018-08-07 10:50:59,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-08-07 10:50:59,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2018-08-07 10:50:59,739 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 63 [2018-08-07 10:50:59,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-08-07 10:50:59,740 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2018-08-07 10:50:59,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-08-07 10:50:59,740 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2018-08-07 10:50:59,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-08-07 10:50:59,741 INFO L368 BasicCegarLoop]: Found error trace [2018-08-07 10:50:59,741 INFO L376 BasicCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-08-07 10:50:59,742 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_crafted_simple_array_index_value_true_unreach_call__true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-08-07 10:50:59,742 INFO L82 PathProgramCache]: Analyzing trace with hash 2119814595, now seen corresponding path program 5 times [2018-08-07 10:50:59,742 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-08-07 10:50:59,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-08-07 10:50:59,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-08-07 10:50:59,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-08-07 10:50:59,743 INFO L292 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-08-07 10:50:59,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-08-07 10:51:00,106 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 6 proven. 100 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-08-07 10:51:00,106 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-08-07 10:51:00,106 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-08-07 10:51:00,114 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-08-07 10:51:00,114 INFO L292 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-08-07 10:51:01,063 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-08-07 10:51:01,063 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-08-07 10:51:01,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-08-07 10:51:01,084 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-08-07 10:51:01,084 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-08-07 10:51:05,057 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 6 proven. 100 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-08-07 10:51:05,078 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-08-07 10:51:05,078 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-08-07 10:51:05,094 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-08-07 10:51:05,095 INFO L292 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-08-07 10:51:07,480 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-08-07 10:51:07,480 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-08-07 10:51:07,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-08-07 10:51:07,500 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-08-07 10:51:07,501 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-08-07 10:51:07,531 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 6 proven. 100 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-08-07 10:51:07,533 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-08-07 10:51:07,533 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11, 11, 11] total 20 [2018-08-07 10:51:07,533 INFO L255 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-08-07 10:51:07,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-08-07 10:51:07,534 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-08-07 10:51:07,534 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=261, Unknown=1, NotChecked=0, Total=380 [2018-08-07 10:51:07,534 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand 11 states. [2018-08-07 10:51:08,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-08-07 10:51:08,121 INFO L93 Difference]: Finished difference Result 168 states and 185 transitions. [2018-08-07 10:51:08,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-08-07 10:51:08,122 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2018-08-07 10:51:08,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-08-07 10:51:08,123 INFO L225 Difference]: With dead ends: 168 [2018-08-07 10:51:08,123 INFO L226 Difference]: Without dead ends: 105 [2018-08-07 10:51:08,124 INFO L603 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 253 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=118, Invalid=261, Unknown=1, NotChecked=0, Total=380 [2018-08-07 10:51:08,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-08-07 10:51:08,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2018-08-07 10:51:08,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-08-07 10:51:08,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2018-08-07 10:51:08,142 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 66 [2018-08-07 10:51:08,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-08-07 10:51:08,142 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2018-08-07 10:51:08,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-08-07 10:51:08,142 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2018-08-07 10:51:08,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-08-07 10:51:08,143 INFO L368 BasicCegarLoop]: Found error trace [2018-08-07 10:51:08,144 INFO L376 BasicCegarLoop]: trace histogram [10, 9, 9, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-08-07 10:51:08,144 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_crafted_simple_array_index_value_true_unreach_call__true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-08-07 10:51:08,144 INFO L82 PathProgramCache]: Analyzing trace with hash 667737042, now seen corresponding path program 6 times [2018-08-07 10:51:08,144 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-08-07 10:51:08,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-08-07 10:51:08,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-08-07 10:51:08,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-08-07 10:51:08,145 INFO L292 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-08-07 10:51:08,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-08-07 10:51:08,467 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 6 proven. 126 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-08-07 10:51:08,467 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-08-07 10:51:08,467 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-08-07 10:51:08,476 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-08-07 10:51:08,476 INFO L292 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-08-07 10:51:32,844 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-08-07 10:51:32,844 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-08-07 10:51:32,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-08-07 10:51:32,855 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-08-07 10:51:32,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-08-07 10:51:32,883 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 10 treesize of output 9 [2018-08-07 10:51:32,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-08-07 10:51:32,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-08-07 10:51:32,894 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:16 [2018-08-07 10:51:32,969 INFO L700 Elim1Store]: detected not equals via solver [2018-08-07 10:51:32,971 INFO L700 Elim1Store]: detected not equals via solver [2018-08-07 10:51:32,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 57 [2018-08-07 10:51:32,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-08-07 10:51:32,982 INFO L700 Elim1Store]: detected not equals via solver [2018-08-07 10:51:32,984 INFO L700 Elim1Store]: detected not equals via solver [2018-08-07 10:51:32,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 56 [2018-08-07 10:51:32,986 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-08-07 10:51:33,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-08-07 10:51:33,041 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:115, output treesize:29 [2018-08-07 10:51:33,175 INFO L700 Elim1Store]: detected not equals via solver [2018-08-07 10:51:33,178 INFO L700 Elim1Store]: detected not equals via solver [2018-08-07 10:51:33,184 INFO L700 Elim1Store]: detected not equals via solver [2018-08-07 10:51:33,185 INFO L700 Elim1Store]: detected not equals via solver [2018-08-07 10:51:33,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 99 [2018-08-07 10:51:33,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-08-07 10:51:33,189 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-08-07 10:51:33,189 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-08-07 10:51:33,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-08-07 10:51:33,261 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:163, output treesize:40 [2018-08-07 10:51:33,348 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-08-07 10:51:33,348 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-08-07 10:51:39,487 INFO L700 Elim1Store]: detected not equals via solver [2018-08-07 10:51:39,491 INFO L700 Elim1Store]: detected not equals via solver [2018-08-07 10:51:41,501 WARN L686 Elim1Store]: solver failed to check if following not equals relation is implied: (= (mod main_~index~0 4294967296) (mod (+ v_prenex_20 4294967295) 4294967296)) [2018-08-07 10:51:41,507 INFO L700 Elim1Store]: detected not equals via solver [2018-08-07 10:51:43,523 WARN L686 Elim1Store]: solver failed to check if following not equals relation is implied: (= (mod main_~index~0 4294967296) (mod (+ v_prenex_20 4294967294) 4294967296)) [2018-08-07 10:51:45,541 WARN L669 Elim1Store]: solver failed to check if following equality is implied: (= (select v_main_~array~0_91 (mod (+ v_prenex_20 4294967295) 4294967296)) (select v_main_~array~0_91 (mod (+ v_prenex_20 4294967294) 4294967296))) [2018-08-07 10:51:45,542 INFO L700 Elim1Store]: detected not equals via solver [2018-08-07 10:51:47,559 WARN L669 Elim1Store]: solver failed to check if following equality is implied: (= (mod main_~index~0 2) (select v_main_~array~0_91 (mod (+ v_prenex_20 4294967294) 4294967296))) [2018-08-07 10:51:47,570 INFO L303 Elim1Store]: Index analysis took 8110 ms [2018-08-07 10:51:55,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 113 [2018-08-07 10:51:55,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 8 xjuncts. [2018-08-07 10:52:25,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-08-07 10:52:25,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:175, output treesize:97 [2018-08-07 10:52:32,334 WARN L170 SmtUtils]: Spent 6.09 s on a formula simplification. DAG size of input: 52 DAG size of output: 32 [2018-08-07 10:52:34,617 INFO L700 Elim1Store]: detected not equals via solver [2018-08-07 10:52:34,626 INFO L700 Elim1Store]: detected not equals via solver [2018-08-07 10:52:34,635 INFO L700 Elim1Store]: detected not equals via solver [2018-08-07 10:52:34,669 INFO L700 Elim1Store]: detected not equals via solver [2018-08-07 10:52:36,678 WARN L686 Elim1Store]: solver failed to check if following not equals relation is implied: (= (mod main_~index~0 4294967296) (mod (+ v_prenex_24 4294967294) 4294967296)) [2018-08-07 10:52:36,699 INFO L700 Elim1Store]: detected not equals via solver [2018-08-07 10:52:36,704 INFO L700 Elim1Store]: detected not equals via solver [2018-08-07 10:52:36,736 INFO L700 Elim1Store]: detected not equals via solver [2018-08-07 10:52:36,746 INFO L700 Elim1Store]: detected not equals via solver [2018-08-07 10:52:36,748 INFO L682 Elim1Store]: detected equality via solver [2018-08-07 10:52:36,750 INFO L682 Elim1Store]: detected equality via solver [2018-08-07 10:52:36,751 INFO L303 Elim1Store]: Index analysis took 2163 ms [2018-08-07 10:52:38,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 167 [2018-08-07 10:52:38,779 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-08-07 10:52:38,828 INFO L700 Elim1Store]: detected not equals via solver [2018-08-07 10:52:38,871 INFO L700 Elim1Store]: detected not equals via solver [2018-08-07 10:52:40,925 WARN L669 Elim1Store]: solver failed to check if following equality is implied: (= (mod (+ v_prenex_24 4294967294) 4294967296) (mod v_prenex_24 4294967296)) [2018-08-07 10:52:40,925 INFO L700 Elim1Store]: detected not equals via solver [2018-08-07 10:52:40,981 INFO L700 Elim1Store]: detected not equals via solver [2018-08-07 10:52:43,038 WARN L669 Elim1Store]: solver failed to check if following equality is implied: (= (select v_prenex_25 (mod (+ v_prenex_24 4294967294) 4294967296)) (select v_prenex_25 (mod (+ v_prenex_24 4294967295) 4294967296))) [2018-08-07 10:52:43,039 INFO L700 Elim1Store]: detected not equals via solver [2018-08-07 10:52:45,178 WARN L686 Elim1Store]: solver failed to check if following not equals relation is implied: (= (select v_prenex_25 (mod (+ v_prenex_24 4294967294) 4294967296)) (mod main_~index~0 2)) [2018-08-07 10:52:45,215 INFO L700 Elim1Store]: detected not equals via solver [2018-08-07 10:52:45,235 INFO L303 Elim1Store]: Index analysis took 6454 ms [2018-08-07 10:52:53,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 9 case distinctions, treesize of input 69 treesize of output 142 [2018-08-07 10:52:53,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-08-07 10:53:07,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-08-07 10:53:07,825 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:214, output treesize:62 [2018-08-07 10:53:12,102 WARN L170 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 38 [2018-08-07 10:53:16,891 WARN L669 Elim1Store]: solver failed to check if following equality is implied: (= (mod (+ main_~index~0 4294967294) 4294967296) (mod (+ v_prenex_26 4294967295) 4294967296)) [2018-08-07 10:53:16,939 INFO L700 Elim1Store]: detected not equals via solver [2018-08-07 10:53:16,993 INFO L700 Elim1Store]: detected not equals via solver [2018-08-07 10:53:19,000 WARN L669 Elim1Store]: solver failed to check if following equality is implied: (= (mod (+ v_prenex_26 4294967294) 4294967296) (mod (+ v_prenex_26 4294967295) 4294967296)) [2018-08-07 10:53:19,001 INFO L700 Elim1Store]: detected not equals via solver [2018-08-07 10:53:19,067 INFO L700 Elim1Store]: detected not equals via solver [2018-08-07 10:53:19,243 INFO L700 Elim1Store]: detected not equals via solver [2018-08-07 10:53:19,329 INFO L700 Elim1Store]: detected not equals via solver [2018-08-07 10:53:21,399 WARN L669 Elim1Store]: solver failed to check if following equality is implied: (= (select v_prenex_27 (mod (+ main_~index~0 4294967294) 4294967296)) (select v_prenex_27 (mod (+ v_prenex_26 4294967294) 4294967296))) [2018-08-07 10:53:21,423 INFO L700 Elim1Store]: detected not equals via solver [2018-08-07 10:53:21,478 INFO L700 Elim1Store]: detected not equals via solver [2018-08-07 10:53:23,606 WARN L669 Elim1Store]: solver failed to check if following equality is implied: (= (select v_prenex_27 (mod v_prenex_26 4294967296)) (select v_prenex_27 (mod (+ main_~index~0 4294967295) 4294967296))) [2018-08-07 10:53:23,642 INFO L303 Elim1Store]: Index analysis took 10771 ms [2018-08-07 10:53:37,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 12 case distinctions, treesize of input 85 treesize of output 184 [2018-08-07 10:53:37,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-08-07 10:53:37,902 INFO L700 Elim1Store]: detected not equals via solver [2018-08-07 10:53:37,923 INFO L700 Elim1Store]: detected not equals via solver [2018-08-07 10:53:37,936 INFO L700 Elim1Store]: detected not equals via solver [2018-08-07 10:53:37,949 INFO L700 Elim1Store]: detected not equals via solver [2018-08-07 10:53:37,964 INFO L700 Elim1Store]: detected not equals via solver [2018-08-07 10:53:37,969 INFO L700 Elim1Store]: detected not equals via solver [2018-08-07 10:53:37,981 INFO L700 Elim1Store]: detected not equals via solver [2018-08-07 10:53:38,055 INFO L700 Elim1Store]: detected not equals via solver [2018-08-07 10:53:38,065 INFO L700 Elim1Store]: detected not equals via solver [2018-08-07 10:53:38,115 INFO L700 Elim1Store]: detected not equals via solver [2018-08-07 10:53:38,122 INFO L700 Elim1Store]: detected not equals via solver [2018-08-07 10:53:38,131 INFO L682 Elim1Store]: detected equality via solver [2018-08-07 10:53:38,147 INFO L700 Elim1Store]: detected not equals via solver [2018-08-07 10:53:38,234 INFO L700 Elim1Store]: detected not equals via solver [2018-08-07 10:53:38,235 INFO L682 Elim1Store]: detected equality via solver [2018-08-07 10:53:38,235 INFO L303 Elim1Store]: Index analysis took 373 ms [2018-08-07 10:53:38,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 253 [2018-08-07 10:53:38,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-08-07 10:53:52,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-08-07 10:53:52,911 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:262, output treesize:78 [2018-08-07 10:53:55,448 WARN L170 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-08-07 10:54:05,707 WARN L170 SmtUtils]: Spent 6.12 s on a formula simplification that was a NOOP. DAG size: 46 [2018-08-07 10:54:16,345 WARN L1010 $PredicateComparison]: unable to prove that (and (= 0 c_main_~index~0) (exists ((v_prenex_28 Int)) (let ((.cse0 (mod (+ v_prenex_28 4294967295) 4294967296)) (.cse1 (mod (+ v_prenex_28 1) 2))) (and (= (select c_main_~array~0 .cse0) .cse1) (= (mod v_prenex_28 2) (select c_main_~array~0 (mod (+ v_prenex_28 4294967294) 4294967296))) (<= 1000 (mod v_prenex_28 4294967296)) (< .cse0 1000) (= (select c_main_~array~0 (mod (+ v_prenex_28 4294967293) 4294967296)) .cse1)))) (exists ((v_prenex_26 Int)) (let ((.cse2 (mod v_prenex_26 2))) (and (<= v_prenex_26 5) (= (select c_main_~array~0 (mod (+ v_prenex_26 4294967294) 4294967296)) .cse2) (= (select c_main_~array~0 (mod v_prenex_26 4294967296)) .cse2) (<= 5 v_prenex_26) (= (select c_main_~array~0 (mod (+ v_prenex_26 4294967295) 4294967296)) (mod (+ v_prenex_26 1) 2)))))) is different from false [2018-08-07 10:54:25,141 WARN L170 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2018-08-07 10:54:33,788 WARN L1010 $PredicateComparison]: unable to prove that (and (= (mod (select c_main_~array~0 (mod c_main_~index~0 4294967296)) 4294967296) 0) (= 0 c_main_~index~0) (exists ((v_prenex_28 Int)) (let ((.cse0 (mod (+ v_prenex_28 4294967295) 4294967296)) (.cse1 (mod (+ v_prenex_28 1) 2))) (and (= (select c_main_~array~0 .cse0) .cse1) (= (mod v_prenex_28 2) (select c_main_~array~0 (mod (+ v_prenex_28 4294967294) 4294967296))) (<= 1000 (mod v_prenex_28 4294967296)) (< .cse0 1000) (= (select c_main_~array~0 (mod (+ v_prenex_28 4294967293) 4294967296)) .cse1)))) (exists ((v_prenex_26 Int)) (let ((.cse2 (mod v_prenex_26 2))) (and (<= v_prenex_26 5) (= (select c_main_~array~0 (mod (+ v_prenex_26 4294967294) 4294967296)) .cse2) (= (select c_main_~array~0 (mod v_prenex_26 4294967296)) .cse2) (<= 5 v_prenex_26) (= (select c_main_~array~0 (mod (+ v_prenex_26 4294967295) 4294967296)) (mod (+ v_prenex_26 1) 2)))))) is different from false [2018-08-07 10:54:35,814 WARN L1010 $PredicateComparison]: unable to prove that (and (= 1 c_main_~index~0) (= 0 (mod (select c_main_~array~0 0) 4294967296)) (exists ((v_prenex_28 Int)) (let ((.cse0 (mod (+ v_prenex_28 4294967295) 4294967296)) (.cse1 (mod (+ v_prenex_28 1) 2))) (and (= (select c_main_~array~0 .cse0) .cse1) (= (mod v_prenex_28 2) (select c_main_~array~0 (mod (+ v_prenex_28 4294967294) 4294967296))) (<= 1000 (mod v_prenex_28 4294967296)) (< .cse0 1000) (= (select c_main_~array~0 (mod (+ v_prenex_28 4294967293) 4294967296)) .cse1)))) (exists ((v_prenex_26 Int)) (let ((.cse2 (mod v_prenex_26 2))) (and (<= v_prenex_26 5) (= (select c_main_~array~0 (mod (+ v_prenex_26 4294967294) 4294967296)) .cse2) (= (select c_main_~array~0 (mod v_prenex_26 4294967296)) .cse2) (<= 5 v_prenex_26) (= (select c_main_~array~0 (mod (+ v_prenex_26 4294967295) 4294967296)) (mod (+ v_prenex_26 1) 2)))))) is different from false [2018-08-07 10:54:49,300 WARN L170 SmtUtils]: Spent 4.72 s on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2018-08-07 10:54:53,359 WARN L1010 $PredicateComparison]: unable to prove that (and (= 1 c_main_~index~0) (= 0 (mod (select c_main_~array~0 0) 4294967296)) (not (= (mod (select c_main_~array~0 (mod c_main_~index~0 4294967296)) 4294967296) 0)) (exists ((v_prenex_28 Int)) (let ((.cse0 (mod (+ v_prenex_28 4294967295) 4294967296)) (.cse1 (mod (+ v_prenex_28 1) 2))) (and (= (select c_main_~array~0 .cse0) .cse1) (= (mod v_prenex_28 2) (select c_main_~array~0 (mod (+ v_prenex_28 4294967294) 4294967296))) (<= 1000 (mod v_prenex_28 4294967296)) (< .cse0 1000) (= (select c_main_~array~0 (mod (+ v_prenex_28 4294967293) 4294967296)) .cse1)))) (exists ((v_prenex_26 Int)) (let ((.cse2 (mod v_prenex_26 2))) (and (<= v_prenex_26 5) (= (select c_main_~array~0 (mod (+ v_prenex_26 4294967294) 4294967296)) .cse2) (= (select c_main_~array~0 (mod v_prenex_26 4294967296)) .cse2) (<= 5 v_prenex_26) (= (select c_main_~array~0 (mod (+ v_prenex_26 4294967295) 4294967296)) (mod (+ v_prenex_26 1) 2)))))) is different from false [2018-08-07 10:54:58,059 WARN L170 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-08-07 10:55:00,082 WARN L1010 $PredicateComparison]: unable to prove that (and (not (= 0 (mod (select c_main_~array~0 1) 4294967296))) (= 0 (mod (select c_main_~array~0 0) 4294967296)) (exists ((v_prenex_28 Int)) (let ((.cse0 (mod (+ v_prenex_28 4294967295) 4294967296)) (.cse1 (mod (+ v_prenex_28 1) 2))) (and (= (select c_main_~array~0 .cse0) .cse1) (= (mod v_prenex_28 2) (select c_main_~array~0 (mod (+ v_prenex_28 4294967294) 4294967296))) (<= 1000 (mod v_prenex_28 4294967296)) (< .cse0 1000) (= (select c_main_~array~0 (mod (+ v_prenex_28 4294967293) 4294967296)) .cse1)))) (= 2 c_main_~index~0) (< (mod c_main_~index~0 4294967296) 1000) (exists ((v_prenex_26 Int)) (let ((.cse2 (mod v_prenex_26 2))) (and (<= v_prenex_26 5) (= (select c_main_~array~0 (mod (+ v_prenex_26 4294967294) 4294967296)) .cse2) (= (select c_main_~array~0 (mod v_prenex_26 4294967296)) .cse2) (<= 5 v_prenex_26) (= (select c_main_~array~0 (mod (+ v_prenex_26 4294967295) 4294967296)) (mod (+ v_prenex_26 1) 2)))))) is different from false Received shutdown request... [2018-08-07 10:55:02,887 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-08-07 10:55:03,087 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-08-07 10:55:03,088 WARN L549 AbstractCegarLoop]: Verification canceled [2018-08-07 10:55:03,094 WARN L202 ceAbstractionStarter]: Timeout [2018-08-07 10:55:03,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.08 10:55:03 BoogieIcfgContainer [2018-08-07 10:55:03,095 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-08-07 10:55:03,096 INFO L168 Benchmark]: Toolchain (without parser) took 288720.71 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 861.4 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -155.3 MB). Peak memory consumption was 706.1 MB. Max. memory is 7.1 GB. [2018-08-07 10:55:03,097 INFO L168 Benchmark]: CDTParser took 0.30 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-08-07 10:55:03,097 INFO L168 Benchmark]: CACSL2BoogieTranslator took 235.46 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-08-07 10:55:03,098 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.19 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-08-07 10:55:03,098 INFO L168 Benchmark]: Boogie Preprocessor took 26.36 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-08-07 10:55:03,098 INFO L168 Benchmark]: RCFGBuilder took 432.37 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -790.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. [2018-08-07 10:55:03,099 INFO L168 Benchmark]: TraceAbstraction took 287991.48 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 123.7 MB). Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 624.2 MB). Peak memory consumption was 747.9 MB. Max. memory is 7.1 GB. [2018-08-07 10:55:03,103 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.30 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 235.46 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 29.19 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 26.36 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 432.37 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -790.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 287991.48 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 123.7 MB). Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 624.2 MB). Peak memory consumption was 747.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 11]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 11). Cancelled while BasicCegarLoop was analyzing trace of length 70 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 34 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. TIMEOUT Result, 287.9s OverallTime, 10 OverallIterations, 10 TraceHistogramMax, 7.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 302 SDtfs, 222 SDslu, 1453 SDs, 0 SdLazy, 1952 SolverSat, 110 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 6.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1383 GetRequests, 1222 SyntacticMatches, 18 SemanticMatches, 143 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 37.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=9, 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, 9 MinimizatonAttempts, 35 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 5.0s SatisfiabilityAnalysisTime, 39.2s InterpolantComputationTime, 1028 NumberOfCodeBlocks, 1028 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 1657 ConstructedInterpolants, 62 QuantifiedInterpolants, 336791 SizeOfPredicates, 26 NumberOfNonLiveVariables, 1146 ConjunctsInSsa, 206 ConjunctsInUnsatCore, 37 InterpolantComputations, 2 PerfectInterpolantSequences, 866/2360 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/simple_array_index_value_true-unreach-call1_true-termination.i_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-08-07_10-55-03-126.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/simple_array_index_value_true-unreach-call1_true-termination.i_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-08-07_10-55-03-126.csv Completed graceful shutdown