java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/loop-lit/mcmillan2006_true-unreach-call_true-termination.c.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dd2f093 [2018-07-24 10:57:37,490 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-24 10:57:37,493 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-24 10:57:37,508 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-24 10:57:37,508 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-24 10:57:37,509 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-24 10:57:37,511 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-24 10:57:37,513 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-24 10:57:37,515 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-24 10:57:37,515 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-24 10:57:37,516 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-24 10:57:37,517 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-24 10:57:37,518 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-24 10:57:37,518 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-24 10:57:37,520 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-24 10:57:37,520 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-24 10:57:37,521 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-24 10:57:37,523 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-24 10:57:37,525 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-24 10:57:37,527 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-24 10:57:37,528 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-24 10:57:37,531 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-24 10:57:37,537 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-24 10:57:37,538 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-24 10:57:37,538 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-24 10:57:37,539 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-24 10:57:37,544 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-24 10:57:37,545 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-24 10:57:37,546 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-24 10:57:37,550 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-24 10:57:37,550 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-24 10:57:37,551 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-24 10:57:37,551 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-24 10:57:37,552 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-24 10:57:37,553 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-24 10:57:37,557 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-24 10:57:37,557 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-07-24 10:57:37,587 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-24 10:57:37,588 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-24 10:57:37,589 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-07-24 10:57:37,590 INFO L133 SettingsManager]: * User list type=DISABLED [2018-07-24 10:57:37,590 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-07-24 10:57:37,590 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-07-24 10:57:37,590 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-07-24 10:57:37,590 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-07-24 10:57:37,591 INFO L133 SettingsManager]: * Log string format=TERM [2018-07-24 10:57:37,591 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-07-24 10:57:37,591 INFO L133 SettingsManager]: * Interval Domain=false [2018-07-24 10:57:37,592 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-07-24 10:57:37,592 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-07-24 10:57:37,592 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-07-24 10:57:37,593 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-07-24 10:57:37,593 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-07-24 10:57:37,593 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-07-24 10:57:37,593 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-07-24 10:57:37,593 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-07-24 10:57:37,594 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-24 10:57:37,594 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-07-24 10:57:37,594 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-07-24 10:57:37,596 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-07-24 10:57:37,596 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-24 10:57:37,596 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-24 10:57:37,596 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-07-24 10:57:37,597 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-07-24 10:57:37,597 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-07-24 10:57:37,597 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-07-24 10:57:37,597 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-07-24 10:57:37,598 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-24 10:57:37,598 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-07-24 10:57:37,598 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-07-24 10:57:37,667 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-24 10:57:37,682 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-24 10:57:37,688 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-24 10:57:37,690 INFO L271 PluginConnector]: Initializing CDTParser... [2018-07-24 10:57:37,690 INFO L276 PluginConnector]: CDTParser initialized [2018-07-24 10:57:37,691 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/mcmillan2006_true-unreach-call_true-termination.c.i [2018-07-24 10:57:38,047 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78b93b1a0/cab394fd62c6414ea256449feb8076a5/FLAGfa1ec3f1d [2018-07-24 10:57:38,227 INFO L276 CDTParser]: Found 1 translation units. [2018-07-24 10:57:38,227 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/mcmillan2006_true-unreach-call_true-termination.c.i [2018-07-24 10:57:38,233 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78b93b1a0/cab394fd62c6414ea256449feb8076a5/FLAGfa1ec3f1d [2018-07-24 10:57:38,247 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78b93b1a0/cab394fd62c6414ea256449feb8076a5 [2018-07-24 10:57:38,259 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-24 10:57:38,260 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-07-24 10:57:38,261 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-07-24 10:57:38,261 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-07-24 10:57:38,269 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-07-24 10:57:38,270 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 10:57:38" (1/1) ... [2018-07-24 10:57:38,274 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5372148d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 10:57:38, skipping insertion in model container [2018-07-24 10:57:38,274 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 10:57:38" (1/1) ... [2018-07-24 10:57:38,435 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-07-24 10:57:38,479 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 10:57:38,503 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-07-24 10:57:38,509 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 10:57:38,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 10:57:38 WrapperNode [2018-07-24 10:57:38,526 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-07-24 10:57:38,526 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-24 10:57:38,527 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-24 10:57:38,527 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-24 10:57:38,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 10:57:38" (1/1) ... [2018-07-24 10:57:38,547 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 10:57:38" (1/1) ... [2018-07-24 10:57:38,567 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-24 10:57:38,568 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-24 10:57:38,568 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-24 10:57:38,568 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-24 10:57:38,578 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 10:57:38" (1/1) ... [2018-07-24 10:57:38,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 10:57:38" (1/1) ... [2018-07-24 10:57:38,580 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 10:57:38" (1/1) ... [2018-07-24 10:57:38,581 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 10:57:38" (1/1) ... [2018-07-24 10:57:38,585 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 10:57:38" (1/1) ... [2018-07-24 10:57:38,590 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 10:57:38" (1/1) ... [2018-07-24 10:57:38,592 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 10:57:38" (1/1) ... [2018-07-24 10:57:38,594 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-24 10:57:38,594 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-24 10:57:38,594 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-24 10:57:38,595 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-24 10:57:38,596 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 10:57:38" (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-07-24 10:57:38,673 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_lit_mcmillan_____true_unreach_call_true_termination_c_i____VERIFIER_assert [2018-07-24 10:57:38,673 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_lit_mcmillan_____true_unreach_call_true_termination_c_i____VERIFIER_assert [2018-07-24 10:57:38,673 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-07-24 10:57:38,673 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-07-24 10:57:38,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-07-24 10:57:38,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-07-24 10:57:38,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-24 10:57:38,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-24 10:57:39,257 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-24 10:57:39,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 10:57:39 BoogieIcfgContainer [2018-07-24 10:57:39,258 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-24 10:57:39,259 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-24 10:57:39,259 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-24 10:57:39,263 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-24 10:57:39,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.07 10:57:38" (1/3) ... [2018-07-24 10:57:39,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d23a4f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 10:57:39, skipping insertion in model container [2018-07-24 10:57:39,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 10:57:38" (2/3) ... [2018-07-24 10:57:39,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d23a4f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 10:57:39, skipping insertion in model container [2018-07-24 10:57:39,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 10:57:39" (3/3) ... [2018-07-24 10:57:39,267 INFO L112 eAbstractionObserver]: Analyzing ICFG mcmillan2006_true-unreach-call_true-termination.c.i [2018-07-24 10:57:39,277 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-07-24 10:57:39,285 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-24 10:57:39,335 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-24 10:57:39,336 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-24 10:57:39,336 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-24 10:57:39,337 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-07-24 10:57:39,337 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-24 10:57:39,337 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-24 10:57:39,337 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-24 10:57:39,337 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-24 10:57:39,338 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-24 10:57:39,366 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-07-24 10:57:39,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-24 10:57:39,374 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 10:57:39,377 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 10:57:39,377 INFO L414 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_lit_mcmillan_____true_unreach_call_true_termination_c_i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 10:57:39,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1338250742, now seen corresponding path program 1 times [2018-07-24 10:57:39,385 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 10:57:39,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:57:39,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:57:39,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:57:39,432 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 10:57:39,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:57:39,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 10:57:39,526 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 10:57:39,526 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-24 10:57:39,526 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 10:57:39,530 INFO L450 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-07-24 10:57:39,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-07-24 10:57:39,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-07-24 10:57:39,544 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-07-24 10:57:39,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 10:57:39,566 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-07-24 10:57:39,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-07-24 10:57:39,568 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-07-24 10:57:39,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 10:57:39,577 INFO L225 Difference]: With dead ends: 44 [2018-07-24 10:57:39,578 INFO L226 Difference]: Without dead ends: 22 [2018-07-24 10:57:39,582 INFO L573 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-07-24 10:57:39,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-07-24 10:57:39,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-07-24 10:57:39,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-07-24 10:57:39,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-07-24 10:57:39,623 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 15 [2018-07-24 10:57:39,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 10:57:39,623 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-07-24 10:57:39,623 INFO L472 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-07-24 10:57:39,624 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-07-24 10:57:39,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-24 10:57:39,625 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 10:57:39,625 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 10:57:39,625 INFO L414 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_lit_mcmillan_____true_unreach_call_true_termination_c_i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 10:57:39,625 INFO L82 PathProgramCache]: Analyzing trace with hash 84142610, now seen corresponding path program 1 times [2018-07-24 10:57:39,626 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 10:57:39,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:57:39,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:57:39,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:57:39,628 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 10:57:39,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:57:39,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 10:57:39,779 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 10:57:39,779 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-24 10:57:39,779 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 10:57:39,781 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 10:57:39,782 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 10:57:39,782 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-07-24 10:57:39,783 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 5 states. [2018-07-24 10:57:39,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 10:57:39,957 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-07-24 10:57:39,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-24 10:57:39,958 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-07-24 10:57:39,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 10:57:39,959 INFO L225 Difference]: With dead ends: 39 [2018-07-24 10:57:39,959 INFO L226 Difference]: Without dead ends: 25 [2018-07-24 10:57:39,960 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-07-24 10:57:39,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-24 10:57:39,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-07-24 10:57:39,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-07-24 10:57:39,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-07-24 10:57:39,966 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 16 [2018-07-24 10:57:39,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 10:57:39,967 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-07-24 10:57:39,967 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 10:57:39,967 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-07-24 10:57:39,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-24 10:57:39,968 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 10:57:39,968 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 10:57:39,968 INFO L414 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_lit_mcmillan_____true_unreach_call_true_termination_c_i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 10:57:39,968 INFO L82 PathProgramCache]: Analyzing trace with hash -379014418, now seen corresponding path program 1 times [2018-07-24 10:57:39,969 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 10:57:39,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:57:39,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:57:39,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:57:39,970 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 10:57:39,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:57:40,400 WARN L169 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 11 [2018-07-24 10:57:40,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 10:57:40,565 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:57:40,565 INFO L191 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-07-24 10:57:40,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:57:40,578 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 10:57:40,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:57:40,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:57:40,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-07-24 10:57:40,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-07-24 10:57:40,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 10:57:40,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:57:40,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:57:40,799 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-07-24 10:57:40,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-07-24 10:57:40,963 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-07-24 10:57:40,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 10:57:40,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:57:40,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:57:40,971 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-07-24 10:57:40,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 10:57:40,998 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:57:41,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2018-07-24 10:57:41,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-07-24 10:57:41,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 10:57:41,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:57:41,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:57:41,251 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:14, output treesize:5 [2018-07-24 10:57:41,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 10:57:41,291 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:57:41,292 INFO L191 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-07-24 10:57:41,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:57:41,310 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 10:57:41,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:57:41,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:57:41,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-07-24 10:57:41,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-07-24 10:57:41,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 10:57:41,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:57:41,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:57:41,476 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-07-24 10:57:41,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-07-24 10:57:41,524 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-07-24 10:57:41,525 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 10:57:41,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:57:41,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:57:41,576 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-07-24 10:57:41,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 10:57:41,684 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:57:41,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2018-07-24 10:57:41,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-07-24 10:57:41,756 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 10:57:41,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:57:41,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:57:41,767 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-07-24 10:57:41,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 10:57:41,793 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 10:57:41,794 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8, 8, 8] total 15 [2018-07-24 10:57:41,794 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 10:57:41,794 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-24 10:57:41,795 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-24 10:57:41,795 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2018-07-24 10:57:41,796 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 12 states. [2018-07-24 10:57:42,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 10:57:42,338 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-07-24 10:57:42,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-24 10:57:42,339 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-07-24 10:57:42,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 10:57:42,341 INFO L225 Difference]: With dead ends: 36 [2018-07-24 10:57:42,341 INFO L226 Difference]: Without dead ends: 34 [2018-07-24 10:57:42,342 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 64 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-07-24 10:57:42,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-07-24 10:57:42,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2018-07-24 10:57:42,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-07-24 10:57:42,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-07-24 10:57:42,350 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 19 [2018-07-24 10:57:42,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 10:57:42,350 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-07-24 10:57:42,350 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-24 10:57:42,351 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-07-24 10:57:42,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-24 10:57:42,352 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 10:57:42,352 INFO L353 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 10:57:42,352 INFO L414 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_lit_mcmillan_____true_unreach_call_true_termination_c_i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 10:57:42,352 INFO L82 PathProgramCache]: Analyzing trace with hash 216503804, now seen corresponding path program 1 times [2018-07-24 10:57:42,352 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 10:57:42,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:57:42,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:57:42,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:57:42,354 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 10:57:42,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:57:42,495 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 10:57:42,495 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:57:42,495 INFO L191 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-07-24 10:57:42,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:57:42,504 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 10:57:42,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:57:42,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:57:42,660 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 10:57:42,660 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:57:42,782 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 10:57:42,803 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:57:42,803 INFO L191 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-07-24 10:57:42,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:57:42,818 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 10:57:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:57:42,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:57:42,870 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 10:57:42,870 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:57:42,949 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 10:57:42,952 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 10:57:42,952 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7] total 11 [2018-07-24 10:57:42,953 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 10:57:42,953 INFO L450 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-24 10:57:42,954 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-24 10:57:42,954 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-07-24 10:57:42,954 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 10 states. [2018-07-24 10:57:43,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 10:57:43,151 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2018-07-24 10:57:43,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 10:57:43,152 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2018-07-24 10:57:43,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 10:57:43,155 INFO L225 Difference]: With dead ends: 54 [2018-07-24 10:57:43,156 INFO L226 Difference]: Without dead ends: 35 [2018-07-24 10:57:43,156 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 102 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-07-24 10:57:43,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-07-24 10:57:43,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-07-24 10:57:43,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-07-24 10:57:43,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-07-24 10:57:43,168 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 28 [2018-07-24 10:57:43,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 10:57:43,168 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-07-24 10:57:43,168 INFO L472 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-24 10:57:43,169 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-07-24 10:57:43,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-07-24 10:57:43,170 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 10:57:43,170 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 10:57:43,170 INFO L414 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_lit_mcmillan_____true_unreach_call_true_termination_c_i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 10:57:43,170 INFO L82 PathProgramCache]: Analyzing trace with hash -788925224, now seen corresponding path program 2 times [2018-07-24 10:57:43,170 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 10:57:43,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:57:43,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:57:43,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:57:43,172 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 10:57:43,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:57:43,475 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 10:57:43,475 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:57:43,475 INFO L191 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-07-24 10:57:43,484 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-07-24 10:57:43,485 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-07-24 10:57:43,515 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-07-24 10:57:43,515 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 10:57:43,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:57:43,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-07-24 10:57:43,577 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-07-24 10:57:43,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 10:57:43,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:57:43,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:57:43,587 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-07-24 10:57:45,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-07-24 10:57:45,866 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-07-24 10:57:45,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 10:57:45,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:57:45,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:57:45,873 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-07-24 10:57:45,922 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 10:57:45,922 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:57:50,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-07-24 10:57:50,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-07-24 10:57:50,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 10:57:50,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:57:50,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:57:50,183 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:5 [2018-07-24 10:57:50,206 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 10:57:50,226 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:57:50,227 INFO L191 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-07-24 10:57:50,243 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-07-24 10:57:50,243 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-07-24 10:57:50,303 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-07-24 10:57:50,304 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 10:57:50,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:57:50,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-07-24 10:57:50,448 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 12 treesize of output 11 [2018-07-24 10:57:50,449 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 10:57:50,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:57:50,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:57:50,462 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-07-24 10:58:03,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-07-24 10:58:03,398 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:58:03,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-07-24 10:58:03,399 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 10:58:03,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:58:03,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:58:03,420 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2018-07-24 10:58:03,465 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 10:58:03,465 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:58:03,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-07-24 10:58:03,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-07-24 10:58:03,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 10:58:03,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:58:03,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:58:03,808 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:7 [2018-07-24 10:58:03,839 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 10:58:03,841 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 10:58:03,841 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 10, 13, 12] total 35 [2018-07-24 10:58:03,841 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 10:58:03,842 INFO L450 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-24 10:58:03,842 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-24 10:58:03,844 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1040, Unknown=9, NotChecked=0, Total=1190 [2018-07-24 10:58:03,844 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 22 states. [2018-07-24 10:58:07,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 10:58:07,295 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2018-07-24 10:58:07,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-24 10:58:07,296 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 31 [2018-07-24 10:58:07,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 10:58:07,298 INFO L225 Difference]: With dead ends: 72 [2018-07-24 10:58:07,298 INFO L226 Difference]: Without dead ends: 70 [2018-07-24 10:58:07,300 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 90 SyntacticMatches, 14 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 873 ImplicationChecksByTransitivity, 21.0s TimeCoverageRelationStatistics Valid=363, Invalid=2178, Unknown=9, NotChecked=0, Total=2550 [2018-07-24 10:58:07,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-07-24 10:58:07,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 55. [2018-07-24 10:58:07,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-07-24 10:58:07,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-07-24 10:58:07,313 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 31 [2018-07-24 10:58:07,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 10:58:07,313 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-07-24 10:58:07,313 INFO L472 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-24 10:58:07,314 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-07-24 10:58:07,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-07-24 10:58:07,316 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 10:58:07,316 INFO L353 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 10:58:07,316 INFO L414 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_lit_mcmillan_____true_unreach_call_true_termination_c_i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 10:58:07,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1465897006, now seen corresponding path program 3 times [2018-07-24 10:58:07,317 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 10:58:07,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:58:07,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-24 10:58:07,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:58:07,318 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 10:58:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:58:07,676 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-07-24 10:58:07,676 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:58:07,676 INFO L191 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-07-24 10:58:07,684 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-07-24 10:58:07,684 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-07-24 10:58:07,726 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-07-24 10:58:07,727 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 10:58:07,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:58:07,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-07-24 10:58:07,802 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-07-24 10:58:07,802 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 10:58:07,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:58:07,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:58:07,813 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-07-24 10:58:08,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-07-24 10:58:08,069 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-07-24 10:58:08,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 10:58:08,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:58:08,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:58:08,115 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-07-24 10:58:08,283 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-07-24 10:58:08,284 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:58:08,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-07-24 10:58:08,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-07-24 10:58:08,668 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 10:58:08,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:58:08,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:58:08,671 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:5 [2018-07-24 10:58:08,774 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-07-24 10:58:08,795 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:58:08,795 INFO L191 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-07-24 10:58:08,828 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-07-24 10:58:08,828 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-07-24 10:58:08,923 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-07-24 10:58:08,923 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 10:58:08,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:58:08,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-07-24 10:58:08,974 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 12 treesize of output 11 [2018-07-24 10:58:08,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 10:58:08,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:58:08,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:58:08,981 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-07-24 10:58:09,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-07-24 10:58:09,672 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:58:09,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-07-24 10:58:09,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 10:58:09,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:58:09,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:58:09,687 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2018-07-24 10:58:09,712 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-07-24 10:58:09,712 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:58:10,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-07-24 10:58:10,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2018-07-24 10:58:10,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 10:58:10,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:58:10,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:58:10,236 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:7 [2018-07-24 10:58:10,267 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-07-24 10:58:10,269 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 10:58:10,270 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 12, 15, 14] total 44 [2018-07-24 10:58:10,270 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 10:58:10,271 INFO L450 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-24 10:58:10,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-24 10:58:10,272 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1683, Unknown=0, NotChecked=0, Total=1892 [2018-07-24 10:58:10,273 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 25 states. [2018-07-24 10:58:12,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 10:58:12,109 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2018-07-24 10:58:12,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-24 10:58:12,109 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 43 [2018-07-24 10:58:12,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 10:58:12,111 INFO L225 Difference]: With dead ends: 119 [2018-07-24 10:58:12,112 INFO L226 Difference]: Without dead ends: 61 [2018-07-24 10:58:12,115 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 127 SyntacticMatches, 20 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1780 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=608, Invalid=4504, Unknown=0, NotChecked=0, Total=5112 [2018-07-24 10:58:12,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-07-24 10:58:12,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2018-07-24 10:58:12,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-07-24 10:58:12,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2018-07-24 10:58:12,124 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 43 [2018-07-24 10:58:12,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 10:58:12,125 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2018-07-24 10:58:12,125 INFO L472 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-24 10:58:12,125 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-07-24 10:58:12,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-07-24 10:58:12,126 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 10:58:12,127 INFO L353 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 10:58:12,127 INFO L414 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_lit_mcmillan_____true_unreach_call_true_termination_c_i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 10:58:12,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1289218968, now seen corresponding path program 4 times [2018-07-24 10:58:12,127 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 10:58:12,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:58:12,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-24 10:58:12,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:58:12,129 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 10:58:12,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:58:12,564 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 10 proven. 52 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-07-24 10:58:12,565 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:58:12,565 INFO L191 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-07-24 10:58:12,573 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-07-24 10:58:12,573 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-07-24 10:58:12,629 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-07-24 10:58:12,630 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 10:58:12,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:58:12,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-07-24 10:58:12,755 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-07-24 10:58:12,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 10:58:12,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:58:12,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:58:12,759 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-07-24 10:58:42,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-07-24 10:58:43,010 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-07-24 10:58:43,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 10:58:43,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:58:43,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:58:43,056 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-07-24 10:58:43,149 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-07-24 10:58:43,149 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:58:48,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-07-24 10:58:48,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-07-24 10:58:48,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 10:58:48,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:58:48,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:58:48,422 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2018-07-24 10:58:48,462 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 6 proven. 50 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-07-24 10:58:48,486 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:58:48,487 INFO L191 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-07-24 10:58:48,502 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-07-24 10:58:48,502 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-07-24 10:58:48,612 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-07-24 10:58:48,612 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 10:58:48,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:58:48,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-07-24 10:58:48,630 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-07-24 10:58:48,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 10:58:48,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:58:48,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:58:48,637 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-07-24 10:59:18,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-07-24 10:59:18,839 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-07-24 10:59:18,839 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 10:59:18,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:59:18,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:59:18,841 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-07-24 10:59:18,857 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-07-24 10:59:18,857 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:59:18,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-07-24 10:59:18,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-07-24 10:59:18,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 10:59:18,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:59:18,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:59:18,912 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:5 [2018-07-24 10:59:18,942 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 6 proven. 50 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-07-24 10:59:18,944 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 10:59:18,944 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 14, 15, 14] total 32 [2018-07-24 10:59:18,944 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 10:59:18,945 INFO L450 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-24 10:59:18,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-24 10:59:18,949 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=877, Unknown=9, NotChecked=0, Total=992 [2018-07-24 10:59:18,950 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 28 states. [2018-07-24 10:59:27,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 10:59:27,642 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2018-07-24 10:59:27,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-24 10:59:27,642 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 55 [2018-07-24 10:59:27,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 10:59:27,644 INFO L225 Difference]: With dead ends: 101 [2018-07-24 10:59:27,644 INFO L226 Difference]: Without dead ends: 73 [2018-07-24 10:59:27,646 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 187 SyntacticMatches, 22 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1016 ImplicationChecksByTransitivity, 67.5s TimeCoverageRelationStatistics Valid=338, Invalid=2515, Unknown=9, NotChecked=0, Total=2862 [2018-07-24 10:59:27,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-07-24 10:59:27,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2018-07-24 10:59:27,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-07-24 10:59:27,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2018-07-24 10:59:27,660 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 55 [2018-07-24 10:59:27,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 10:59:27,660 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2018-07-24 10:59:27,660 INFO L472 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-24 10:59:27,661 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2018-07-24 10:59:27,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-07-24 10:59:27,663 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 10:59:27,663 INFO L353 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 10:59:27,663 INFO L414 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_lit_mcmillan_____true_unreach_call_true_termination_c_i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 10:59:27,663 INFO L82 PathProgramCache]: Analyzing trace with hash -2033083026, now seen corresponding path program 5 times [2018-07-24 10:59:27,664 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 10:59:27,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:59:27,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-24 10:59:27,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:59:27,665 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 10:59:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:59:28,128 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 22 proven. 77 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-07-24 10:59:28,128 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:59:28,128 INFO L191 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-07-24 10:59:28,137 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-07-24 10:59:28,137 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-07-24 10:59:28,183 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-07-24 10:59:28,184 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 10:59:28,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:59:28,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-07-24 10:59:28,323 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-07-24 10:59:28,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 10:59:28,325 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:59:28,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:59:28,328 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-07-24 10:59:28,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-07-24 10:59:28,720 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-07-24 10:59:28,720 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 10:59:28,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:59:28,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:59:28,723 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-07-24 10:59:28,783 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-07-24 10:59:28,783 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:59:28,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-07-24 10:59:28,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-07-24 10:59:28,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 10:59:28,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:59:28,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:59:28,978 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:5 [2018-07-24 10:59:29,117 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 8 proven. 82 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-07-24 10:59:29,141 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:59:29,141 INFO L191 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-07-24 10:59:29,157 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-07-24 10:59:29,157 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-07-24 10:59:29,292 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-07-24 10:59:29,293 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 10:59:29,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:59:29,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-07-24 10:59:29,422 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-07-24 10:59:29,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 10:59:29,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:59:29,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:59:29,425 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-07-24 11:00:50,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-07-24 11:00:50,469 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-07-24 11:00:50,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 11:00:50,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 11:00:50,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-07-24 11:00:50,471 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-07-24 11:00:50,491 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-07-24 11:00:50,491 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 11:00:50,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2018-07-24 11:00:50,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-07-24 11:00:50,571 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 11:00:50,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 11:00:50,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-07-24 11:00:50,573 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:5 [2018-07-24 11:00:50,585 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 8 proven. 82 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-07-24 11:00:50,587 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 11:00:50,587 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 16, 17, 16] total 49 [2018-07-24 11:00:50,587 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 11:00:50,587 INFO L450 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-07-24 11:00:50,588 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-07-24 11:00:50,588 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=2122, Unknown=10, NotChecked=0, Total=2352 [2018-07-24 11:00:50,588 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 33 states. [2018-07-24 11:00:52,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 11:00:52,967 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2018-07-24 11:00:52,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-24 11:00:52,967 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 67 [2018-07-24 11:00:52,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 11:00:52,969 INFO L225 Difference]: With dead ends: 118 [2018-07-24 11:00:52,969 INFO L226 Difference]: Without dead ends: 85 [2018-07-24 11:00:52,971 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 214 SyntacticMatches, 28 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2347 ImplicationChecksByTransitivity, 83.4s TimeCoverageRelationStatistics Valid=548, Invalid=4844, Unknown=10, NotChecked=0, Total=5402 [2018-07-24 11:00:52,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-07-24 11:00:52,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2018-07-24 11:00:52,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-07-24 11:00:52,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2018-07-24 11:00:52,983 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 67 [2018-07-24 11:00:52,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 11:00:52,983 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2018-07-24 11:00:52,983 INFO L472 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-07-24 11:00:52,983 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2018-07-24 11:00:52,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-07-24 11:00:52,986 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 11:00:52,986 INFO L353 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 11:00:52,986 INFO L414 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_lit_mcmillan_____true_unreach_call_true_termination_c_i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 11:00:52,986 INFO L82 PathProgramCache]: Analyzing trace with hash 58536536, now seen corresponding path program 6 times [2018-07-24 11:00:52,987 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 11:00:52,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 11:00:52,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-24 11:00:52,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 11:00:52,988 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 11:00:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 11:00:53,385 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 39 proven. 105 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-07-24 11:00:53,386 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 11:00:53,386 INFO L191 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-07-24 11:00:53,395 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-07-24 11:00:53,395 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-07-24 11:00:53,447 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-07-24 11:00:53,447 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 11:00:53,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 11:00:53,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-07-24 11:00:53,500 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 12 treesize of output 11 [2018-07-24 11:00:53,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 11:00:53,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 11:00:53,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-07-24 11:00:53,507 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-07-24 11:00:55,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-07-24 11:00:55,153 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 11:00:55,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-07-24 11:00:55,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 11:00:55,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 11:00:55,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-07-24 11:00:55,174 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2018-07-24 11:00:55,268 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 72 proven. 72 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-07-24 11:00:55,269 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 11:00:56,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-07-24 11:00:56,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2018-07-24 11:00:56,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 11:00:56,964 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 11:00:56,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-07-24 11:00:56,970 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:7 [2018-07-24 11:00:57,041 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 60 proven. 72 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-07-24 11:00:57,063 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 11:00:57,063 INFO L191 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-07-24 11:00:57,083 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-07-24 11:00:57,084 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-07-24 11:00:57,343 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-07-24 11:00:57,343 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 11:00:57,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 11:00:57,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-07-24 11:00:57,366 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 12 treesize of output 11 [2018-07-24 11:00:57,366 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 11:00:57,370 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 11:00:57,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-07-24 11:00:57,377 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-07-24 11:00:58,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-07-24 11:00:58,771 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 11:00:58,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-07-24 11:00:58,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 11:00:58,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 11:00:58,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-07-24 11:00:58,782 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2018-07-24 11:00:58,816 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 60 proven. 72 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-07-24 11:00:58,816 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 11:00:59,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-07-24 11:00:59,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2018-07-24 11:00:59,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 11:00:59,190 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 11:00:59,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-07-24 11:00:59,197 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:7 [2018-07-24 11:00:59,241 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 60 proven. 72 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-07-24 11:00:59,243 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 11:00:59,244 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23, 20, 21, 20] total 44 [2018-07-24 11:00:59,244 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 11:00:59,245 INFO L450 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-07-24 11:00:59,245 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-07-24 11:00:59,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=1627, Unknown=0, NotChecked=0, Total=1892 [2018-07-24 11:00:59,246 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 36 states. [2018-07-24 11:01:00,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 11:01:00,979 INFO L93 Difference]: Finished difference Result 123 states and 130 transitions. [2018-07-24 11:01:00,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-24 11:01:00,980 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 79 [2018-07-24 11:01:00,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 11:01:00,982 INFO L225 Difference]: With dead ends: 123 [2018-07-24 11:01:00,982 INFO L226 Difference]: Without dead ends: 86 [2018-07-24 11:01:00,985 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 251 SyntacticMatches, 44 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2460 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=745, Invalid=4225, Unknown=0, NotChecked=0, Total=4970 [2018-07-24 11:01:00,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-07-24 11:01:00,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2018-07-24 11:01:00,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-07-24 11:01:00,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-07-24 11:01:00,998 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 79 [2018-07-24 11:01:00,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 11:01:00,998 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-07-24 11:01:00,999 INFO L472 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-07-24 11:01:00,999 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-07-24 11:01:01,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-07-24 11:01:01,000 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 11:01:01,000 INFO L353 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 11:01:01,000 INFO L414 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_lit_mcmillan_____true_unreach_call_true_termination_c_i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 11:01:01,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1996571140, now seen corresponding path program 7 times [2018-07-24 11:01:01,001 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 11:01:01,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 11:01:01,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-24 11:01:01,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 11:01:01,002 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 11:01:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 11:01:01,697 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 9 proven. 155 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-07-24 11:01:01,697 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 11:01:01,697 INFO L191 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-07-24 11:01:01,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 11:01:01,711 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 11:01:01,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 11:01:01,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 11:01:01,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-07-24 11:01:01,771 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 12 treesize of output 11 [2018-07-24 11:01:01,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 11:01:01,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 11:01:01,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-07-24 11:01:01,781 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-07-24 11:01:01,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-07-24 11:01:01,833 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 11:01:01,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-07-24 11:01:01,834 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 11:01:01,842 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 11:01:01,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-07-24 11:01:01,852 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:11 [2018-07-24 11:01:52,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-07-24 11:01:52,656 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 11:01:52,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-07-24 11:01:52,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 11:01:52,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 11:01:52,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-07-24 11:01:52,662 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:3 [2018-07-24 11:01:52,740 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-07-24 11:01:52,741 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 11:01:55,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-07-24 11:01:55,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-07-24 11:01:55,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 11:01:55,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 11:01:55,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-07-24 11:01:55,114 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:5 [2018-07-24 11:01:55,135 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 10 proven. 142 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-07-24 11:01:55,157 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 11:01:55,157 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 17 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 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-07-24 11:01:55,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 11:01:55,174 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 11:01:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 11:01:55,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 11:01:55,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-07-24 11:01:55,309 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 12 treesize of output 11 [2018-07-24 11:01:55,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 11:01:55,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 11:01:55,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-07-24 11:01:55,319 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-07-24 11:01:55,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-07-24 11:01:55,347 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 11:01:55,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-07-24 11:01:55,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 11:01:55,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 11:01:55,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-07-24 11:01:55,368 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:11 Received shutdown request... [2018-07-24 11:02:21,613 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-07-24 11:02:21,815 WARN L512 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-07-24 11:02:21,815 WARN L540 AbstractCegarLoop]: Verification canceled [2018-07-24 11:02:21,820 WARN L202 ceAbstractionStarter]: Timeout [2018-07-24 11:02:21,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.07 11:02:21 BoogieIcfgContainer [2018-07-24 11:02:21,820 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-24 11:02:21,821 INFO L168 Benchmark]: Toolchain (without parser) took 283561.75 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 992.5 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -339.1 MB). Peak memory consumption was 653.4 MB. Max. memory is 7.1 GB. [2018-07-24 11:02:21,822 INFO L168 Benchmark]: CDTParser took 0.24 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-07-24 11:02:21,822 INFO L168 Benchmark]: CACSL2BoogieTranslator took 264.78 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-07-24 11:02:21,822 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.09 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-07-24 11:02:21,823 INFO L168 Benchmark]: Boogie Preprocessor took 26.06 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-07-24 11:02:21,823 INFO L168 Benchmark]: RCFGBuilder took 664.11 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -793.5 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. [2018-07-24 11:02:21,823 INFO L168 Benchmark]: TraceAbstraction took 282561.41 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 243.3 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 443.9 MB). Peak memory consumption was 687.1 MB. Max. memory is 7.1 GB. [2018-07-24 11:02:21,825 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.24 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 264.78 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 41.09 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.06 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 664.11 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -793.5 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 282561.41 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 243.3 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 443.9 MB). Peak memory consumption was 687.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 6]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 6). Cancelled while BasicCegarLoop was analyzing trace of length 83 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 33 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. TIMEOUT Result, 282.4s OverallTime, 10 OverallIterations, 8 TraceHistogramMax, 19.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 240 SDtfs, 602 SDslu, 2260 SDs, 0 SdLazy, 2950 SolverSat, 429 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 12.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1523 GetRequests, 1039 SyntacticMatches, 140 SemanticMatches, 344 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8616 ImplicationChecksByTransitivity, 183.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred 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, 30 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 180.5s InterpolantComputationTime, 997 NumberOfCodeBlocks, 997 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 1604 ConstructedInterpolants, 286 QuantifiedInterpolants, 823324 SizeOfPredicates, 229 NumberOfNonLiveVariables, 2490 ConjunctsInSsa, 478 ConjunctsInUnsatCore, 37 InterpolantComputations, 2 PerfectInterpolantSequences, 764/2045 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/mcmillan2006_true-unreach-call_true-termination.c.i_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-07-24_11-02-21-834.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/mcmillan2006_true-unreach-call_true-termination.c.i_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-24_11-02-21-834.csv Completed graceful shutdown