java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/loops/matrix_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-10 10:08:49,395 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-10 10:08:49,397 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-10 10:08:49,410 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-10 10:08:49,410 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-10 10:08:49,411 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-10 10:08:49,413 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-10 10:08:49,415 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-10 10:08:49,417 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-10 10:08:49,418 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-10 10:08:49,419 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-10 10:08:49,419 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-10 10:08:49,420 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-10 10:08:49,421 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-10 10:08:49,423 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-10 10:08:49,423 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-10 10:08:49,424 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-10 10:08:49,426 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-10 10:08:49,429 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-10 10:08:49,430 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-10 10:08:49,432 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-10 10:08:49,433 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-10 10:08:49,436 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-10 10:08:49,436 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-10 10:08:49,436 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-10 10:08:49,440 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-10 10:08:49,441 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-10 10:08:49,442 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-10 10:08:49,444 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-10 10:08:49,447 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-10 10:08:49,449 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-10 10:08:49,450 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-10 10:08:49,450 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-10 10:08:49,450 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-10 10:08:49,452 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-10 10:08:49,453 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-10 10:08:49,454 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-09-10 10:08:49,485 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-10 10:08:49,485 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-10 10:08:49,486 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-10 10:08:49,486 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-10 10:08:49,486 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-10 10:08:49,487 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-10 10:08:49,487 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-10 10:08:49,487 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-10 10:08:49,487 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-10 10:08:49,488 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-10 10:08:49,488 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-10 10:08:49,489 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-10 10:08:49,489 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-10 10:08:49,489 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-10 10:08:49,490 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-10 10:08:49,490 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-10 10:08:49,490 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-10 10:08:49,490 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-10 10:08:49,490 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-10 10:08:49,491 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-10 10:08:49,491 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-10 10:08:49,491 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-10 10:08:49,491 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-10 10:08:49,493 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 10:08:49,493 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-10 10:08:49,493 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-10 10:08:49,494 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-10 10:08:49,494 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-10 10:08:49,494 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-10 10:08:49,494 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-10 10:08:49,494 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-10 10:08:49,495 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-10 10:08:49,495 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-10 10:08:49,561 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-10 10:08:49,576 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-10 10:08:49,583 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-10 10:08:49,585 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-10 10:08:49,585 INFO L276 PluginConnector]: CDTParser initialized [2018-09-10 10:08:49,586 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/matrix_true-unreach-call_true-termination.i [2018-09-10 10:08:49,950 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb5675a81/6649131de21b47b4a2e91560b20bf77a/FLAGf28ce23e5 [2018-09-10 10:08:50,109 INFO L276 CDTParser]: Found 1 translation units. [2018-09-10 10:08:50,109 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/matrix_true-unreach-call_true-termination.i [2018-09-10 10:08:50,115 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb5675a81/6649131de21b47b4a2e91560b20bf77a/FLAGf28ce23e5 [2018-09-10 10:08:50,132 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb5675a81/6649131de21b47b4a2e91560b20bf77a [2018-09-10 10:08:50,145 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-10 10:08:50,149 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-10 10:08:50,150 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-10 10:08:50,150 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-10 10:08:50,157 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-10 10:08:50,158 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:08:50" (1/1) ... [2018-09-10 10:08:50,161 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@560f8b24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:08:50, skipping insertion in model container [2018-09-10 10:08:50,161 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:08:50" (1/1) ... [2018-09-10 10:08:50,329 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-10 10:08:50,376 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:08:50,393 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-10 10:08:50,403 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:08:50,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:08:50 WrapperNode [2018-09-10 10:08:50,418 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-10 10:08:50,419 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-10 10:08:50,420 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-10 10:08:50,420 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-10 10:08:50,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:08:50" (1/1) ... [2018-09-10 10:08:50,438 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:08:50" (1/1) ... [2018-09-10 10:08:50,445 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-10 10:08:50,446 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-10 10:08:50,446 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-10 10:08:50,446 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-10 10:08:50,457 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:08:50" (1/1) ... [2018-09-10 10:08:50,458 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:08:50" (1/1) ... [2018-09-10 10:08:50,462 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:08:50" (1/1) ... [2018-09-10 10:08:50,463 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:08:50" (1/1) ... [2018-09-10 10:08:50,470 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:08:50" (1/1) ... [2018-09-10 10:08:50,477 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:08:50" (1/1) ... [2018-09-10 10:08:50,478 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:08:50" (1/1) ... [2018-09-10 10:08:50,480 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-10 10:08:50,481 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-10 10:08:50,481 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-10 10:08:50,481 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-10 10:08:50,482 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:08:50" (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-09-10 10:08:50,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-10 10:08:50,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-10 10:08:50,553 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_matrix_true_unreach_call_true_termination_i____VERIFIER_assert [2018-09-10 10:08:50,553 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_matrix_true_unreach_call_true_termination_i____VERIFIER_assert [2018-09-10 10:08:50,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-10 10:08:50,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-10 10:08:50,554 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-10 10:08:50,554 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-10 10:08:50,968 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-10 10:08:50,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:08:50 BoogieIcfgContainer [2018-09-10 10:08:50,969 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-10 10:08:50,972 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-10 10:08:50,973 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-10 10:08:50,979 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-10 10:08:50,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 10:08:50" (1/3) ... [2018-09-10 10:08:50,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1efe3708 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:08:50, skipping insertion in model container [2018-09-10 10:08:50,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:08:50" (2/3) ... [2018-09-10 10:08:50,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1efe3708 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:08:50, skipping insertion in model container [2018-09-10 10:08:50,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:08:50" (3/3) ... [2018-09-10 10:08:50,985 INFO L112 eAbstractionObserver]: Analyzing ICFG matrix_true-unreach-call_true-termination.i [2018-09-10 10:08:50,995 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-10 10:08:51,004 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-10 10:08:51,053 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-10 10:08:51,054 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-10 10:08:51,054 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-10 10:08:51,054 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-10 10:08:51,054 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-10 10:08:51,054 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-10 10:08:51,054 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-10 10:08:51,054 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-10 10:08:51,055 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-10 10:08:51,073 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-09-10 10:08:51,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-10 10:08:51,079 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:08:51,080 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:08:51,080 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_matrix_true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:08:51,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1764199642, now seen corresponding path program 1 times [2018-09-10 10:08:51,089 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:08:51,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:08:51,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:08:51,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:08:51,141 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:08:51,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:08:51,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:08:51,211 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:08:51,211 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-10 10:08:51,211 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:08:51,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-10 10:08:51,228 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-10 10:08:51,229 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-10 10:08:51,231 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2018-09-10 10:08:51,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:08:51,258 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2018-09-10 10:08:51,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-10 10:08:51,260 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-09-10 10:08:51,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:08:51,269 INFO L225 Difference]: With dead ends: 43 [2018-09-10 10:08:51,269 INFO L226 Difference]: Without dead ends: 17 [2018-09-10 10:08:51,273 INFO L604 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-09-10 10:08:51,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-09-10 10:08:51,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-09-10 10:08:51,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-10 10:08:51,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-09-10 10:08:51,310 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 10 [2018-09-10 10:08:51,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:08:51,311 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-09-10 10:08:51,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-10 10:08:51,311 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2018-09-10 10:08:51,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-10 10:08:51,312 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:08:51,312 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:08:51,312 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_matrix_true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:08:51,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1946243441, now seen corresponding path program 1 times [2018-09-10 10:08:51,313 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:08:51,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:08:51,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:08:51,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:08:51,315 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:08:51,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:08:51,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:08:51,446 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:08:51,446 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 10:08:51,447 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:08:51,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:08:51,451 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:08:51,451 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:08:51,459 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 3 states. [2018-09-10 10:08:51,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:08:51,545 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-09-10 10:08:51,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:08:51,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-09-10 10:08:51,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:08:51,547 INFO L225 Difference]: With dead ends: 29 [2018-09-10 10:08:51,547 INFO L226 Difference]: Without dead ends: 24 [2018-09-10 10:08:51,549 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:08:51,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-09-10 10:08:51,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2018-09-10 10:08:51,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-09-10 10:08:51,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-09-10 10:08:51,555 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 11 [2018-09-10 10:08:51,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:08:51,555 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-09-10 10:08:51,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:08:51,556 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-09-10 10:08:51,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-10 10:08:51,557 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:08:51,557 INFO L376 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:08:51,557 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_matrix_true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:08:51,558 INFO L82 PathProgramCache]: Analyzing trace with hash -281489901, now seen corresponding path program 1 times [2018-09-10 10:08:51,558 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:08:51,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:08:51,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:08:51,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:08:51,560 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:08:51,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:08:51,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:08:51,735 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:08:51,735 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-09-10 10:08:51,735 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:08:51,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-10 10:08:51,738 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-10 10:08:51,739 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 10:08:51,739 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 4 states. [2018-09-10 10:08:51,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:08:51,824 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-09-10 10:08:51,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 10:08:51,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-09-10 10:08:51,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:08:51,826 INFO L225 Difference]: With dead ends: 35 [2018-09-10 10:08:51,826 INFO L226 Difference]: Without dead ends: 23 [2018-09-10 10:08:51,826 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-10 10:08:51,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-09-10 10:08:51,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-09-10 10:08:51,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-10 10:08:51,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-09-10 10:08:51,833 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2018-09-10 10:08:51,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:08:51,833 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-09-10 10:08:51,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-10 10:08:51,833 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-09-10 10:08:51,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-10 10:08:51,834 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:08:51,834 INFO L376 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:08:51,835 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_matrix_true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:08:51,835 INFO L82 PathProgramCache]: Analyzing trace with hash 388960234, now seen corresponding path program 1 times [2018-09-10 10:08:51,835 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:08:51,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:08:51,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:08:51,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:08:51,837 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:08:51,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:08:52,419 WARN L175 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2018-09-10 10:08:52,791 WARN L175 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 15 [2018-09-10 10:08:52,987 WARN L175 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 26 [2018-09-10 10:08:53,041 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:08:53,042 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:08:53,042 INFO L197 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-09-10 10:08:53,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:08:53,059 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:08:53,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:08:53,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:08:53,180 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 17 treesize of output 12 [2018-09-10 10:08:53,191 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-09-10 10:08:53,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-10 10:08:53,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:08:53,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:08:53,223 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:17 [2018-09-10 10:08:53,280 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:08:53,281 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:08:53,522 WARN L175 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 17 [2018-09-10 10:08:53,541 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 9 treesize of output 7 [2018-09-10 10:08:53,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-09-10 10:08:53,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-10 10:08:53,583 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:08:53,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-09-10 10:08:53,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:11 [2018-09-10 10:08:53,984 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:08:54,009 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:08:54,009 INFO L197 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-09-10 10:08:54,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:08:54,028 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:08:54,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:08:54,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:08:54,080 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 17 treesize of output 12 [2018-09-10 10:08:54,094 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-09-10 10:08:54,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-10 10:08:54,100 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:08:54,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:08:54,121 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:17 [2018-09-10 10:08:54,259 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:08:54,259 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:08:54,353 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 9 treesize of output 7 [2018-09-10 10:08:54,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-09-10 10:08:54,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-10 10:08:54,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-10 10:08:54,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-09-10 10:08:54,365 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:11 [2018-09-10 10:08:54,372 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:08:54,375 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:08:54,375 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8, 7, 8] total 15 [2018-09-10 10:08:54,375 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:08:54,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-10 10:08:54,376 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-10 10:08:54,377 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2018-09-10 10:08:54,377 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 9 states. [2018-09-10 10:08:54,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:08:54,596 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-09-10 10:08:54,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-10 10:08:54,599 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-09-10 10:08:54,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:08:54,600 INFO L225 Difference]: With dead ends: 42 [2018-09-10 10:08:54,600 INFO L226 Difference]: Without dead ends: 37 [2018-09-10 10:08:54,601 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 67 SyntacticMatches, 8 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-09-10 10:08:54,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-10 10:08:54,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2018-09-10 10:08:54,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-09-10 10:08:54,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-09-10 10:08:54,608 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 20 [2018-09-10 10:08:54,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:08:54,609 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-09-10 10:08:54,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-10 10:08:54,609 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-09-10 10:08:54,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-10 10:08:54,610 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:08:54,610 INFO L376 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:08:54,610 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_matrix_true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:08:54,611 INFO L82 PathProgramCache]: Analyzing trace with hash -202207679, now seen corresponding path program 2 times [2018-09-10 10:08:54,611 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:08:54,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:08:54,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:08:54,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:08:54,612 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:08:54,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:08:54,771 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:08:54,772 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:08:54,772 INFO L197 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-09-10 10:08:54,787 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-10 10:08:54,787 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-10 10:08:54,831 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-10 10:08:54,831 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:08:54,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:08:54,984 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:08:54,984 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:08:55,031 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:08:55,052 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:08:55,053 INFO L197 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-09-10 10:08:55,072 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-10 10:08:55,072 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-10 10:08:55,109 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-10 10:08:55,109 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:08:55,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:08:55,152 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:08:55,152 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:08:55,162 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:08:55,164 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:08:55,164 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5, 5, 5] total 11 [2018-09-10 10:08:55,165 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:08:55,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-10 10:08:55,165 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-10 10:08:55,166 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-09-10 10:08:55,166 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 8 states. [2018-09-10 10:08:55,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:08:55,214 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2018-09-10 10:08:55,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-10 10:08:55,217 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-09-10 10:08:55,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:08:55,218 INFO L225 Difference]: With dead ends: 44 [2018-09-10 10:08:55,218 INFO L226 Difference]: Without dead ends: 30 [2018-09-10 10:08:55,219 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 89 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-09-10 10:08:55,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-09-10 10:08:55,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-09-10 10:08:55,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-09-10 10:08:55,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-09-10 10:08:55,225 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 24 [2018-09-10 10:08:55,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:08:55,225 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-09-10 10:08:55,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-10 10:08:55,226 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-09-10 10:08:55,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-10 10:08:55,227 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:08:55,227 INFO L376 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:08:55,227 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_matrix_true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:08:55,227 INFO L82 PathProgramCache]: Analyzing trace with hash -873003793, now seen corresponding path program 3 times [2018-09-10 10:08:55,228 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:08:55,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:08:55,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-10 10:08:55,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:08:55,229 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:08:55,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:08:55,370 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-09-10 10:08:55,370 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:08:55,371 INFO L197 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-09-10 10:08:55,390 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-10 10:08:55,391 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-09-10 10:08:55,442 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-09-10 10:08:55,442 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:08:55,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:08:55,496 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-09-10 10:08:55,497 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:08:55,599 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-09-10 10:08:55,631 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:08:55,631 INFO L197 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-09-10 10:08:55,661 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-10 10:08:55,661 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-09-10 10:08:55,700 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-09-10 10:08:55,701 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:08:55,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:08:55,725 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-09-10 10:08:55,726 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:08:55,776 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-09-10 10:08:55,778 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:08:55,778 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4, 4, 4] total 9 [2018-09-10 10:08:55,778 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:08:55,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-10 10:08:55,779 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-10 10:08:55,779 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-09-10 10:08:55,780 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 7 states. [2018-09-10 10:08:55,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:08:55,819 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2018-09-10 10:08:55,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-10 10:08:55,822 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-09-10 10:08:55,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:08:55,823 INFO L225 Difference]: With dead ends: 30 [2018-09-10 10:08:55,823 INFO L226 Difference]: Without dead ends: 0 [2018-09-10 10:08:55,824 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 110 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-09-10 10:08:55,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-10 10:08:55,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-10 10:08:55,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-10 10:08:55,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-10 10:08:55,825 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-09-10 10:08:55,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:08:55,825 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-10 10:08:55,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-10 10:08:55,825 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-10 10:08:55,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-10 10:08:55,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-10 10:08:56,027 WARN L175 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-09-10 10:08:56,229 WARN L175 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 20 [2018-09-10 10:08:56,349 WARN L175 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 25 [2018-09-10 10:08:56,353 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-09-10 10:08:56,353 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-10 10:08:56,354 INFO L429 ceAbstractionStarter]: At program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_matrix_true_unreach_call_true_termination_i____VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-09-10 10:08:56,354 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_matrix_true_unreach_call_true_termination_i____VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-09-10 10:08:56,354 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_matrix_true_unreach_call_true_termination_i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-09-10 10:08:56,354 INFO L426 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-09-10 10:08:56,354 INFO L426 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-09-10 10:08:56,354 INFO L426 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-09-10 10:08:56,354 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-10 10:08:56,355 INFO L429 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-09-10 10:08:56,355 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-10 10:08:56,355 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-10 10:08:56,355 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 11 31) no Hoare annotation was computed. [2018-09-10 10:08:56,355 INFO L426 ceAbstractionStarter]: For program point L19-1(lines 19 26) no Hoare annotation was computed. [2018-09-10 10:08:56,355 INFO L426 ceAbstractionStarter]: For program point L19-3(lines 19 26) no Hoare annotation was computed. [2018-09-10 10:08:56,355 INFO L422 ceAbstractionStarter]: At program point L19-4(lines 19 26) the Hoare annotation is: (let ((.cse0 (= 1 main_~N_COL~0)) (.cse1 (<= main_~N_LIN~0 1)) (.cse2 (<= 1 main_~N_LIN~0))) (or (and .cse0 (= main_~j~0 0) .cse1 .cse2) (and (= main_~k~0 1) .cse0 (<= (select (select main_~matriz~0 0) 0) main_~maior~0) (= main_~j~0 1) .cse1 .cse2))) [2018-09-10 10:08:56,356 INFO L422 ceAbstractionStarter]: At program point L19-5(lines 19 26) the Hoare annotation is: (and (<= (select (select main_~matriz~0 0) 0) main_~maior~0) (<= main_~N_LIN~0 1) (<= 1 main_~N_LIN~0)) [2018-09-10 10:08:56,356 INFO L426 ceAbstractionStarter]: For program point mainFINAL(lines 11 31) no Hoare annotation was computed. [2018-09-10 10:08:56,356 INFO L429 ceAbstractionStarter]: At program point mainENTRY(lines 11 31) the Hoare annotation is: true [2018-09-10 10:08:56,356 INFO L426 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-09-10 10:08:56,356 INFO L426 ceAbstractionStarter]: For program point L24(lines 24 25) no Hoare annotation was computed. [2018-09-10 10:08:56,356 INFO L426 ceAbstractionStarter]: For program point L20-1(lines 20 26) no Hoare annotation was computed. [2018-09-10 10:08:56,356 INFO L426 ceAbstractionStarter]: For program point L20-3(lines 20 26) no Hoare annotation was computed. [2018-09-10 10:08:56,357 INFO L422 ceAbstractionStarter]: At program point L20-4(lines 20 26) the Hoare annotation is: (let ((.cse0 (= 1 main_~N_COL~0)) (.cse1 (<= main_~N_LIN~0 1)) (.cse2 (<= 1 main_~N_LIN~0))) (or (and (= main_~k~0 1) .cse0 (= main_~j~0 0) (<= (select (select main_~matriz~0 0) 0) main_~maior~0) .cse1 .cse2) (and (= main_~k~0 0) .cse0 (<= main_~j~0 0) .cse1 (< 0 (+ (div main_~j~0 4294967296) 1)) .cse2))) [2018-09-10 10:08:56,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 10:08:56 BoogieIcfgContainer [2018-09-10 10:08:56,370 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-10 10:08:56,371 INFO L168 Benchmark]: Toolchain (without parser) took 6225.24 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 735.6 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -498.9 MB). Peak memory consumption was 236.7 MB. Max. memory is 7.1 GB. [2018-09-10 10:08:56,372 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-09-10 10:08:56,373 INFO L168 Benchmark]: CACSL2BoogieTranslator took 268.99 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. [2018-09-10 10:08:56,374 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.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-09-10 10:08:56,374 INFO L168 Benchmark]: Boogie Preprocessor took 34.46 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-09-10 10:08:56,375 INFO L168 Benchmark]: RCFGBuilder took 489.80 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 735.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -780.4 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. [2018-09-10 10:08:56,376 INFO L168 Benchmark]: TraceAbstraction took 5398.31 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 268.2 MB). Peak memory consumption was 268.2 MB. Max. memory is 7.1 GB. [2018-09-10 10:08:56,380 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 268.99 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 26.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 34.46 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 489.80 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 735.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -780.4 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5398.31 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 268.2 MB). Peak memory consumption was 268.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: (((1 == N_COL && j == 0) && N_LIN <= 1) && 1 <= N_LIN) || (((((k == 1 && 1 == N_COL) && matriz[0][0] <= maior) && j == 1) && N_LIN <= 1) && 1 <= N_LIN) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (((((k == 1 && 1 == N_COL) && j == 0) && matriz[0][0] <= maior) && N_LIN <= 1) && 1 <= N_LIN) || (((((k == 0 && 1 == N_COL) && j <= 0) && N_LIN <= 1) && 0 < j / 4294967296 + 1) && 1 <= N_LIN) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. SAFE Result, 5.3s OverallTime, 6 OverallIterations, 4 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 96 SDtfs, 77 SDslu, 150 SDs, 0 SdLazy, 108 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 321 GetRequests, 272 SyntacticMatches, 14 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 14 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 13 PreInvPairs, 18 NumberOfFragments, 103 HoareAnnotationTreeSize, 13 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 34 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 256 NumberOfCodeBlocks, 248 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 384 ConstructedInterpolants, 7 QuantifiedInterpolants, 42675 SizeOfPredicates, 21 NumberOfNonLiveVariables, 330 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 18 InterpolantComputations, 3 PerfectInterpolantSequences, 137/177 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/matrix_true-unreach-call_true-termination.i_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-10_10-08-56-394.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/matrix_true-unreach-call_true-termination.i_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-10_10-08-56-394.csv Received shutdown request...