java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-3142e50-m [2018-09-10 10:09:15,181 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-10 10:09:15,183 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-10 10:09:15,196 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-10 10:09:15,197 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-10 10:09:15,198 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-10 10:09:15,199 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-10 10:09:15,201 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-10 10:09:15,203 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-10 10:09:15,204 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-10 10:09:15,205 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-10 10:09:15,205 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-10 10:09:15,206 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-10 10:09:15,207 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-10 10:09:15,209 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-10 10:09:15,209 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-10 10:09:15,211 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-10 10:09:15,215 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-10 10:09:15,219 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-10 10:09:15,223 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-10 10:09:15,225 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-10 10:09:15,232 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-10 10:09:15,234 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-10 10:09:15,235 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-10 10:09:15,235 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-10 10:09:15,236 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-10 10:09:15,242 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-10 10:09:15,243 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-10 10:09:15,245 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-10 10:09:15,248 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-10 10:09:15,248 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-10 10:09:15,249 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-10 10:09:15,249 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-10 10:09:15,249 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-10 10:09:15,253 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-10 10:09:15,254 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-10 10:09:15,254 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:09:15,284 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-10 10:09:15,286 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-10 10:09:15,286 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-10 10:09:15,287 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-10 10:09:15,287 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-10 10:09:15,287 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-10 10:09:15,288 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-10 10:09:15,288 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-10 10:09:15,288 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-10 10:09:15,288 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-10 10:09:15,289 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-10 10:09:15,290 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-10 10:09:15,290 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-10 10:09:15,290 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-10 10:09:15,291 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-10 10:09:15,291 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-10 10:09:15,291 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-10 10:09:15,291 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-10 10:09:15,292 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-10 10:09:15,292 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-10 10:09:15,292 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-10 10:09:15,294 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-10 10:09:15,294 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-10 10:09:15,295 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-10 10:09:15,295 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-10 10:09:15,295 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-10 10:09:15,295 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-10 10:09:15,295 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-10 10:09:15,296 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-10 10:09:15,296 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-10 10:09:15,296 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-10 10:09:15,296 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-10 10:09:15,296 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-10 10:09:15,362 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-10 10:09:15,380 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-10 10:09:15,386 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-10 10:09:15,388 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-10 10:09:15,388 INFO L276 PluginConnector]: CDTParser initialized [2018-09-10 10:09:15,389 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call2.i [2018-09-10 10:09:15,741 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49a515ca2/09b9a50f05d648379cbd6edb705952a0/FLAG56c3c894f [2018-09-10 10:09:15,896 INFO L276 CDTParser]: Found 1 translation units. [2018-09-10 10:09:15,902 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_true-unreach-call2.i [2018-09-10 10:09:15,908 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49a515ca2/09b9a50f05d648379cbd6edb705952a0/FLAG56c3c894f [2018-09-10 10:09:15,922 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49a515ca2/09b9a50f05d648379cbd6edb705952a0 [2018-09-10 10:09:15,933 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-10 10:09:15,936 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-10 10:09:15,937 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-10 10:09:15,937 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-10 10:09:15,944 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-10 10:09:15,945 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:09:15" (1/1) ... [2018-09-10 10:09:15,948 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f3429ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:09:15, skipping insertion in model container [2018-09-10 10:09:15,948 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 10:09:15" (1/1) ... [2018-09-10 10:09:16,112 INFO L180 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-09-10 10:09:16,164 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:09:16,182 INFO L431 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-10 10:09:16,196 INFO L175 PostProcessor]: Settings: Checked method=main [2018-09-10 10:09:16,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:09:16 WrapperNode [2018-09-10 10:09:16,219 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-10 10:09:16,222 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-10 10:09:16,222 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-10 10:09:16,224 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-10 10:09:16,234 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:09:16" (1/1) ... [2018-09-10 10:09:16,242 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:09:16" (1/1) ... [2018-09-10 10:09:16,248 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-10 10:09:16,249 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-10 10:09:16,249 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-10 10:09:16,249 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-10 10:09:16,259 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:09:16" (1/1) ... [2018-09-10 10:09:16,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:09:16" (1/1) ... [2018-09-10 10:09:16,262 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:09:16" (1/1) ... [2018-09-10 10:09:16,262 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:09:16" (1/1) ... [2018-09-10 10:09:16,265 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:09:16" (1/1) ... [2018-09-10 10:09:16,271 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:09:16" (1/1) ... [2018-09-10 10:09:16,273 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:09:16" (1/1) ... [2018-09-10 10:09:16,275 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-10 10:09:16,276 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-10 10:09:16,276 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-10 10:09:16,276 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-10 10:09:16,277 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:09:16" (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:09:16,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-10 10:09:16,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-10 10:09:16,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-10 10:09:16,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-10 10:09:16,420 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-10 10:09:16,420 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-10 10:09:16,420 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_diamond_true_unreach_call__i____VERIFIER_assert [2018-09-10 10:09:16,420 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_diamond_true_unreach_call__i____VERIFIER_assert [2018-09-10 10:09:16,856 INFO L353 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-10 10:09:16,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:09:16 BoogieIcfgContainer [2018-09-10 10:09:16,857 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-10 10:09:16,858 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-10 10:09:16,858 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-10 10:09:16,861 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-10 10:09:16,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 10:09:15" (1/3) ... [2018-09-10 10:09:16,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73cdd703 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:09:16, skipping insertion in model container [2018-09-10 10:09:16,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 10:09:16" (2/3) ... [2018-09-10 10:09:16,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73cdd703 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 10:09:16, skipping insertion in model container [2018-09-10 10:09:16,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 10:09:16" (3/3) ... [2018-09-10 10:09:16,865 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond_true-unreach-call2.i [2018-09-10 10:09:16,876 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-10 10:09:16,884 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-10 10:09:16,928 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-10 10:09:16,929 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-10 10:09:16,929 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-10 10:09:16,929 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-10 10:09:16,929 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-10 10:09:16,929 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-10 10:09:16,929 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-10 10:09:16,929 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-10 10:09:16,929 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-10 10:09:16,946 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-09-10 10:09:16,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-10 10:09:16,952 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:09:16,953 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:09:16,954 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_diamond_true_unreach_call__i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:09:16,960 INFO L82 PathProgramCache]: Analyzing trace with hash 46027330, now seen corresponding path program 1 times [2018-09-10 10:09:16,963 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:09:17,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:09:17,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:09:17,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:09:17,017 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:09:17,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:09:17,076 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:09:17,078 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:09:17,078 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-10 10:09:17,079 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:09:17,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-10 10:09:17,095 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-10 10:09:17,095 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-10 10:09:17,098 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-09-10 10:09:17,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:09:17,120 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2018-09-10 10:09:17,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-10 10:09:17,122 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-09-10 10:09:17,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:09:17,131 INFO L225 Difference]: With dead ends: 39 [2018-09-10 10:09:17,131 INFO L226 Difference]: Without dead ends: 22 [2018-09-10 10:09:17,134 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:09:17,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-09-10 10:09:17,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-09-10 10:09:17,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-09-10 10:09:17,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2018-09-10 10:09:17,174 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 10 [2018-09-10 10:09:17,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:09:17,174 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2018-09-10 10:09:17,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-10 10:09:17,175 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2018-09-10 10:09:17,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-10 10:09:17,176 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:09:17,176 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:09:17,176 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_diamond_true_unreach_call__i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:09:17,177 INFO L82 PathProgramCache]: Analyzing trace with hash -596143276, now seen corresponding path program 1 times [2018-09-10 10:09:17,177 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:09:17,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:09:17,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:09:17,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:09:17,179 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:09:17,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:09:17,363 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:09:17,363 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:09:17,363 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 10:09:17,363 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:09:17,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:09:17,366 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:09:17,366 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:09:17,366 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand 3 states. [2018-09-10 10:09:17,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:09:17,704 INFO L93 Difference]: Finished difference Result 30 states and 41 transitions. [2018-09-10 10:09:17,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:09:17,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-09-10 10:09:17,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:09:17,707 INFO L225 Difference]: With dead ends: 30 [2018-09-10 10:09:17,707 INFO L226 Difference]: Without dead ends: 25 [2018-09-10 10:09:17,708 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:09:17,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-10 10:09:17,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-09-10 10:09:17,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-09-10 10:09:17,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-09-10 10:09:17,715 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 11 [2018-09-10 10:09:17,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:09:17,716 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-09-10 10:09:17,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:09:17,716 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-09-10 10:09:17,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-10 10:09:17,717 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:09:17,717 INFO L376 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:09:17,717 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_diamond_true_unreach_call__i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:09:17,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1592807782, now seen corresponding path program 1 times [2018-09-10 10:09:17,718 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:09:17,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:09:17,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:09:17,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:09:17,719 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:09:17,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:09:19,920 WARN L175 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 27 DAG size of output: 12 [2018-09-10 10:09:19,925 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:09:19,925 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:09:19,926 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 10:09:19,926 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:09:19,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:09:19,927 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:09:19,927 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:09:19,927 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 3 states. [2018-09-10 10:09:20,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:09:20,222 INFO L93 Difference]: Finished difference Result 54 states and 85 transitions. [2018-09-10 10:09:20,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:09:20,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-09-10 10:09:20,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:09:20,225 INFO L225 Difference]: With dead ends: 54 [2018-09-10 10:09:20,225 INFO L226 Difference]: Without dead ends: 37 [2018-09-10 10:09:20,226 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:09:20,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-10 10:09:20,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-09-10 10:09:20,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-09-10 10:09:20,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2018-09-10 10:09:20,233 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 23 [2018-09-10 10:09:20,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:09:20,234 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2018-09-10 10:09:20,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:09:20,235 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2018-09-10 10:09:20,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-10 10:09:20,236 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:09:20,236 INFO L376 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:09:20,236 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_diamond_true_unreach_call__i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:09:20,236 INFO L82 PathProgramCache]: Analyzing trace with hash 2001094936, now seen corresponding path program 1 times [2018-09-10 10:09:20,237 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:09:20,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:09:20,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:09:20,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:09:20,238 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:09:20,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:09:21,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:09:21,048 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:09:21,048 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:09:21,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:09:21,062 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:09:21,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:09:21,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:09:21,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:09:21,150 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:09:24,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:09:24,957 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:09:24,958 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:09:24,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:09:24,973 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:09:24,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:09:25,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:09:25,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:09:25,067 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:09:25,080 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:09:25,082 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:09:25,082 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 13, 13] total 24 [2018-09-10 10:09:25,082 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:09:25,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-10 10:09:25,083 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-10 10:09:25,085 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-09-10 10:09:25,086 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand 13 states. [2018-09-10 10:09:25,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:09:25,574 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2018-09-10 10:09:25,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-10 10:09:25,576 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-09-10 10:09:25,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:09:25,578 INFO L225 Difference]: With dead ends: 54 [2018-09-10 10:09:25,578 INFO L226 Difference]: Without dead ends: 49 [2018-09-10 10:09:25,579 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 79 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-09-10 10:09:25,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-10 10:09:25,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-09-10 10:09:25,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-09-10 10:09:25,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2018-09-10 10:09:25,587 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 23 [2018-09-10 10:09:25,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:09:25,588 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2018-09-10 10:09:25,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-10 10:09:25,588 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2018-09-10 10:09:25,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-10 10:09:25,589 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:09:25,589 INFO L376 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:09:25,590 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_diamond_true_unreach_call__i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:09:25,590 INFO L82 PathProgramCache]: Analyzing trace with hash 980026582, now seen corresponding path program 1 times [2018-09-10 10:09:25,590 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:09:25,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:09:25,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:09:25,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:09:25,591 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:09:25,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:09:25,800 WARN L175 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 13 [2018-09-10 10:09:25,802 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:09:25,802 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-10 10:09:25,803 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-10 10:09:25,803 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-10 10:09:25,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-10 10:09:25,803 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-10 10:09:25,804 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:09:25,804 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand 3 states. [2018-09-10 10:09:25,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:09:25,939 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2018-09-10 10:09:25,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-10 10:09:25,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-09-10 10:09:25,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:09:25,940 INFO L225 Difference]: With dead ends: 66 [2018-09-10 10:09:25,941 INFO L226 Difference]: Without dead ends: 49 [2018-09-10 10:09:25,941 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-10 10:09:25,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-10 10:09:25,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-09-10 10:09:25,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-09-10 10:09:25,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-09-10 10:09:25,949 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 23 [2018-09-10 10:09:25,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:09:25,949 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-09-10 10:09:25,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-10 10:09:25,950 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-09-10 10:09:25,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-10 10:09:25,951 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:09:25,951 INFO L376 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:09:25,951 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_diamond_true_unreach_call__i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:09:25,951 INFO L82 PathProgramCache]: Analyzing trace with hash 314161752, now seen corresponding path program 1 times [2018-09-10 10:09:25,952 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:09:25,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:09:25,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:09:25,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:09:25,953 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:09:25,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:09:28,488 WARN L1010 $PredicateComparison]: unable to prove that (let ((.cse14 (div c_main_~y~0 2))) (let ((.cse9 (* 2 .cse14))) (let ((.cse13 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse4 (= c_main_~y~0 .cse9)) (.cse12 (* (- 2) .cse14))) (let ((.cse11 (div (+ c_main_~y~0 .cse12) 4294967296)) (.cse7 (not .cse4)) (.cse8 (< c_main_~y~0 .cse13)) (.cse5 (<= .cse13 c_main_~y~0)) (.cse10 (div (+ c_main_~y~0 .cse12 (- 2)) 4294967296))) (let ((.cse3 (+ .cse9 (* 4294967296 .cse10) 2)) (.cse0 (+ c_main_~x~0 3)) (.cse2 (or .cse4 .cse5)) (.cse6 (and .cse7 .cse8)) (.cse1 (+ .cse9 (* 4294967296 .cse11)))) (and (<= 0 .cse0) (or (and (<= .cse1 c_main_~y~0) .cse2) (and (or (< .cse3 c_main_~y~0) .cse4 .cse5) (or .cse6 (< .cse1 c_main_~y~0))) (and (<= .cse3 c_main_~y~0) .cse7 .cse8)) (or (and (<= c_main_~y~0 (+ .cse9 3)) .cse7 .cse8) (and (<= c_main_~y~0 (+ .cse9 1)) .cse2)) (or .cse4 (not (= .cse3 c_main_~y~0)) .cse5) (<= .cse0 0) (or (and .cse7 .cse8 (<= 0 .cse10)) (and (<= 0 .cse11) .cse2)) (or .cse6 (not (= .cse1 c_main_~y~0))))))))) is different from false [2018-09-10 10:09:38,761 WARN L175 SmtUtils]: Spent 8.22 s on a formula simplification. DAG size of input: 54 DAG size of output: 17 [2018-09-10 10:09:40,773 WARN L1010 $PredicateComparison]: unable to prove that (let ((.cse12 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse12)) (.cse11 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse11 c_main_~y~0)) (.cse10 (* (- 2) .cse12)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse11)) (.cse9 (div (+ c_main_~y~0 .cse10 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse10) 4294967296)) (.cse7 (or .cse2 .cse3))) (and (let ((.cse1 (* 4294967296 .cse9)) (.cse6 (* 4294967296 .cse8))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 (<= (+ .cse0 .cse6 1) c_main_~y~0)))) (<= c_main_~x~0 3) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (<= 3 c_main_~x~0) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from false [2018-09-10 10:09:42,788 WARN L1010 $PredicateComparison]: unable to prove that (let ((.cse13 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse13)) (.cse12 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse12 c_main_~y~0)) (.cse11 (* (- 2) .cse13)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse10 (+ c_main_~x~0 1)) (.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse12)) (.cse9 (div (+ c_main_~y~0 .cse11 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse11) 4294967296)) (.cse7 (or .cse2 .cse3))) (and (let ((.cse1 (* 4294967296 .cse9)) (.cse6 (* 4294967296 .cse8))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 (<= (+ .cse0 .cse6 1) c_main_~y~0)))) (<= .cse10 0) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (<= 0 .cse10) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from false [2018-09-10 10:09:44,803 WARN L1010 $PredicateComparison]: unable to prove that (let ((.cse13 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse13)) (.cse12 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse12 c_main_~y~0)) (.cse11 (* (- 2) .cse13)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse10 (+ c_main_~x~0 5)) (.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse12)) (.cse9 (div (+ c_main_~y~0 .cse11 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse11) 4294967296)) (.cse7 (or .cse2 .cse3))) (and (let ((.cse1 (* 4294967296 .cse9)) (.cse6 (* 4294967296 .cse8))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 (<= (+ .cse0 .cse6 1) c_main_~y~0)))) (<= 0 .cse10) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (<= .cse10 0) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from false [2018-09-10 10:09:46,820 WARN L1010 $PredicateComparison]: unable to prove that (let ((.cse13 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse13)) (.cse12 (* 4294967296 (div c_main_~y~0 4294967296)))) (let ((.cse3 (<= .cse12 c_main_~y~0)) (.cse11 (* (- 2) .cse13)) (.cse2 (= c_main_~y~0 .cse0))) (let ((.cse10 (+ c_main_~x~0 5)) (.cse4 (not .cse2)) (.cse5 (< c_main_~y~0 .cse12)) (.cse9 (div (+ c_main_~y~0 .cse11 (- 2)) 4294967296)) (.cse8 (div (+ c_main_~y~0 .cse11) 4294967296)) (.cse7 (or .cse2 .cse3))) (and (let ((.cse1 (* 4294967296 .cse9)) (.cse6 (* 4294967296 .cse8))) (or (and (or (< (+ .cse0 .cse1 2) c_main_~y~0) .cse2 .cse3) (or (and .cse4 .cse5) (< (+ .cse0 .cse6) c_main_~y~0))) (and (<= (+ .cse0 .cse1 3) c_main_~y~0) .cse4 .cse5) (and .cse7 (<= (+ .cse0 .cse6 1) c_main_~y~0)))) (<= 0 .cse10) (< (* 4294967296 (div c_main_~x~0 4294967296)) (+ c_main_~x~0 1)) (or (and (<= c_main_~y~0 (+ .cse0 3)) .cse4 .cse5) (and (<= c_main_~y~0 (+ .cse0 1)) .cse7)) (<= .cse10 0) (or (and .cse4 .cse5 (<= 0 .cse9)) (and (<= 0 .cse8) .cse7))))))) is different from false [2018-09-10 10:09:46,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-09-10 10:09:46,844 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:09:46,844 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:09:46,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:09:46,862 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:09:46,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:09:46,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:09:47,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:09:47,160 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:09:47,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:09:47,576 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:09:47,576 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:09:47,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:09:47,594 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-10 10:09:47,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:09:47,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:09:48,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:09:48,020 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:09:48,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:09:48,394 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:09:48,395 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 6, 10, 7] total 22 [2018-09-10 10:09:48,395 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:09:48,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-10 10:09:48,399 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-10 10:09:48,399 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=227, Unknown=6, NotChecked=170, Total=462 [2018-09-10 10:09:48,400 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 17 states. [2018-09-10 10:09:50,632 WARN L1010 $PredicateComparison]: unable to prove that (let ((.cse15 (div c_main_~y~0 2))) (let ((.cse13 (* (- 2) .cse15)) (.cse9 (* 2 .cse15))) (let ((.cse14 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse4 (= c_main_~y~0 .cse9)) (.cse11 (div (+ c_main_~y~0 .cse13) 4294967296))) (let ((.cse12 (* 4294967296 .cse11)) (.cse7 (not .cse4)) (.cse8 (< c_main_~y~0 .cse14)) (.cse5 (<= .cse14 c_main_~y~0)) (.cse10 (div (+ c_main_~y~0 .cse13 (- 2)) 4294967296))) (let ((.cse3 (+ .cse9 (* 4294967296 .cse10) 2)) (.cse0 (+ c_main_~x~0 3)) (.cse2 (or .cse4 .cse5)) (.cse6 (and .cse7 .cse8)) (.cse1 (+ .cse9 .cse12))) (and (<= 0 .cse0) (or (and (<= .cse1 c_main_~y~0) .cse2) (and (or (< .cse3 c_main_~y~0) .cse4 .cse5) (or .cse6 (< .cse1 c_main_~y~0))) (and (<= .cse3 c_main_~y~0) .cse7 .cse8)) (or (and (<= c_main_~y~0 (+ .cse9 3)) .cse7 .cse8) (and (<= c_main_~y~0 (+ .cse9 1)) .cse2)) (or .cse4 (not (= .cse3 c_main_~y~0)) .cse5) (<= .cse0 0) (or (and .cse7 .cse8 (<= 0 .cse10)) (and (<= 0 .cse11) .cse2)) (or .cse6 (not (= .cse1 c_main_~y~0))) (<= (+ .cse9 .cse12 1) c_main_~y~0))))))) is different from false [2018-09-10 10:10:07,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:10:07,030 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-09-10 10:10:07,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-10 10:10:07,031 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 23 [2018-09-10 10:10:07,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:10:07,032 INFO L225 Difference]: With dead ends: 67 [2018-09-10 10:10:07,033 INFO L226 Difference]: Without dead ends: 36 [2018-09-10 10:10:07,034 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 76 SyntacticMatches, 14 SemanticMatches, 22 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 40.1s TimeCoverageRelationStatistics Valid=67, Invalid=256, Unknown=7, NotChecked=222, Total=552 [2018-09-10 10:10:07,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-09-10 10:10:07,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-09-10 10:10:07,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-09-10 10:10:07,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-09-10 10:10:07,039 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 23 [2018-09-10 10:10:07,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:10:07,039 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-09-10 10:10:07,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-10 10:10:07,039 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-09-10 10:10:07,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-09-10 10:10:07,040 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:10:07,041 INFO L376 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:10:07,041 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_diamond_true_unreach_call__i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:10:07,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1929479972, now seen corresponding path program 2 times [2018-09-10 10:10:07,041 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:10:07,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:10:07,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-10 10:10:07,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:10:07,043 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:10:07,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:10:07,914 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:10:07,914 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:10:07,914 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:10:07,925 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-10 10:10:07,925 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-10 10:10:07,963 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-10 10:10:07,963 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:10:07,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:10:08,006 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:10:08,006 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:10:26,293 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:10:26,314 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:10:26,315 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:10:26,330 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-10 10:10:26,330 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-10 10:10:26,383 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-10 10:10:26,383 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:10:26,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:10:26,412 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:10:26,412 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:10:26,474 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (7)] Exception during sending of exit command (exit): Broken pipe [2018-09-10 10:10:26,477 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:10:26,477 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23, 23, 23] total 44 [2018-09-10 10:10:26,477 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:10:26,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-10 10:10:26,478 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-10 10:10:26,480 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=1366, Unknown=0, NotChecked=0, Total=1892 [2018-09-10 10:10:26,481 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 23 states. [2018-09-10 10:10:27,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:10:27,018 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-09-10 10:10:27,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-10 10:10:27,020 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 35 [2018-09-10 10:10:27,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:10:27,021 INFO L225 Difference]: With dead ends: 54 [2018-09-10 10:10:27,021 INFO L226 Difference]: Without dead ends: 49 [2018-09-10 10:10:27,022 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 117 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=526, Invalid=1366, Unknown=0, NotChecked=0, Total=1892 [2018-09-10 10:10:27,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-10 10:10:27,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-09-10 10:10:27,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-09-10 10:10:27,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-09-10 10:10:27,028 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 35 [2018-09-10 10:10:27,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:10:27,028 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-09-10 10:10:27,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-10 10:10:27,029 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-09-10 10:10:27,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-09-10 10:10:27,030 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:10:27,030 INFO L376 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:10:27,030 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_diamond_true_unreach_call__i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:10:27,031 INFO L82 PathProgramCache]: Analyzing trace with hash 2033787552, now seen corresponding path program 3 times [2018-09-10 10:10:27,031 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:10:27,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:10:27,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-10 10:10:27,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:10:27,032 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:10:27,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:10:28,230 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:10:28,230 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:10:28,230 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 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-09-10 10:10:28,238 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-10 10:10:28,238 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-09-10 10:10:28,271 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-09-10 10:10:28,271 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:10:28,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:10:28,308 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:10:28,308 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:10:48,256 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:10:48,279 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:10:48,279 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 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-09-10 10:10:48,295 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-10 10:10:48,295 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-09-10 10:10:48,388 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-09-10 10:10:48,388 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:10:48,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:10:48,422 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:10:48,422 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:10:48,478 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:10:48,480 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:10:48,481 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33, 33, 33] total 64 [2018-09-10 10:10:48,481 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:10:48,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-09-10 10:10:48,482 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-09-10 10:10:48,484 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1020, Invalid=3012, Unknown=0, NotChecked=0, Total=4032 [2018-09-10 10:10:48,484 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 33 states. [2018-09-10 10:10:49,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:10:49,671 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-09-10 10:10:49,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-10 10:10:49,679 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 47 [2018-09-10 10:10:49,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:10:49,680 INFO L225 Difference]: With dead ends: 66 [2018-09-10 10:10:49,680 INFO L226 Difference]: Without dead ends: 61 [2018-09-10 10:10:49,682 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 155 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 21.0s TimeCoverageRelationStatistics Valid=1020, Invalid=3012, Unknown=0, NotChecked=0, Total=4032 [2018-09-10 10:10:49,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-09-10 10:10:49,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-09-10 10:10:49,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-09-10 10:10:49,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-09-10 10:10:49,687 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 47 [2018-09-10 10:10:49,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:10:49,688 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-09-10 10:10:49,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-09-10 10:10:49,688 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-09-10 10:10:49,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-09-10 10:10:49,689 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:10:49,690 INFO L376 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:10:49,690 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_diamond_true_unreach_call__i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:10:49,690 INFO L82 PathProgramCache]: Analyzing trace with hash -99662236, now seen corresponding path program 4 times [2018-09-10 10:10:49,690 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:10:49,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:10:49,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-10 10:10:49,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:10:49,691 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:10:49,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:10:50,811 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:10:50,812 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:10:50,812 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 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-09-10 10:10:50,832 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-10 10:10:50,832 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-09-10 10:10:50,885 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-10 10:10:50,886 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:10:50,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:10:50,974 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:10:50,975 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:11:20,231 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:11:20,251 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:11:20,251 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 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-09-10 10:11:20,266 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-10 10:11:20,266 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-09-10 10:11:20,344 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-10 10:11:20,345 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:11:20,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:11:20,396 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:11:20,397 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:11:20,462 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:11:20,465 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:11:20,465 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43, 43, 43] total 84 [2018-09-10 10:11:20,465 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:11:20,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-09-10 10:11:20,467 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-09-10 10:11:20,470 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1350, Invalid=5621, Unknown=1, NotChecked=0, Total=6972 [2018-09-10 10:11:20,471 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 43 states. [2018-09-10 10:11:22,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:11:22,502 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-09-10 10:11:22,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-10 10:11:22,503 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 59 [2018-09-10 10:11:22,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:11:22,505 INFO L225 Difference]: With dead ends: 78 [2018-09-10 10:11:22,505 INFO L226 Difference]: Without dead ends: 73 [2018-09-10 10:11:22,507 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 193 SyntacticMatches, 3 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 816 ImplicationChecksByTransitivity, 30.3s TimeCoverageRelationStatistics Valid=1350, Invalid=5621, Unknown=1, NotChecked=0, Total=6972 [2018-09-10 10:11:22,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-09-10 10:11:22,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-09-10 10:11:22,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-09-10 10:11:22,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-09-10 10:11:22,514 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 59 [2018-09-10 10:11:22,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:11:22,514 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-09-10 10:11:22,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-09-10 10:11:22,514 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-09-10 10:11:22,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-09-10 10:11:22,516 INFO L368 BasicCegarLoop]: Found error trace [2018-09-10 10:11:22,516 INFO L376 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-10 10:11:22,516 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_diamond_true_unreach_call__i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-10 10:11:22,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1880745000, now seen corresponding path program 5 times [2018-09-10 10:11:22,516 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-10 10:11:22,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:11:22,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-10 10:11:22,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-10 10:11:22,518 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-10 10:11:22,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-10 10:11:23,162 WARN L175 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 18 [2018-09-10 10:11:25,220 WARN L175 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 40 DAG size of output: 19 [2018-09-10 10:11:25,411 WARN L175 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-09-10 10:11:27,667 WARN L175 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-09-10 10:11:29,807 WARN L175 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-09-10 10:11:31,884 WARN L175 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-09-10 10:11:33,963 WARN L175 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-09-10 10:11:36,067 WARN L175 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-09-10 10:11:40,161 WARN L175 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-09-10 10:11:42,256 WARN L175 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-09-10 10:11:46,357 WARN L175 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-09-10 10:11:50,780 WARN L175 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-09-10 10:11:52,900 WARN L175 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-09-10 10:11:55,009 WARN L175 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-09-10 10:11:59,177 WARN L175 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-09-10 10:12:01,297 WARN L1032 $PredicateComparison]: unable to prove that (let ((.cse9 (div c_main_~y~0 2))) (let ((.cse0 (* 2 .cse9))) (let ((.cse8 (* 4294967296 (div c_main_~y~0 4294967296))) (.cse7 (= c_main_~y~0 .cse0)) (.cse6 (* (- 2) .cse9))) (let ((.cse5 (* 4294967296 (div (+ c_main_~y~0 .cse6 (- 2)) 4294967296))) (.cse3 (not .cse7)) (.cse4 (< c_main_~y~0 .cse8)) (.cse2 (or .cse7 (<= .cse8 c_main_~y~0))) (.cse1 (* 4294967296 (div (+ c_main_~y~0 .cse6) 4294967296)))) (and (or (and (<= c_main_~y~0 (+ .cse0 .cse1)) .cse2) (and .cse3 .cse4 (<= c_main_~y~0 (+ .cse0 .cse5 2)))) (<= 46 c_main_~x~0) (or (and (<= (+ .cse0 c_main_~x~0 .cse5) (+ c_main_~y~0 44)) .cse3 .cse4) (and .cse2 (<= (+ .cse0 c_main_~x~0 .cse1) (+ c_main_~y~0 46))))))))) is different from true [2018-09-10 10:12:03,414 WARN L175 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-09-10 10:12:05,549 WARN L175 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-09-10 10:12:09,681 WARN L175 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-09-10 10:12:13,809 WARN L175 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-09-10 10:12:15,928 WARN L175 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-09-10 10:12:20,061 WARN L175 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-09-10 10:12:22,317 WARN L175 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-09-10 10:12:24,444 WARN L175 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-09-10 10:12:26,613 WARN L175 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-09-10 10:12:28,898 WARN L175 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-09-10 10:12:31,044 WARN L175 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-09-10 10:12:33,190 WARN L175 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-09-10 10:12:37,560 WARN L175 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-09-10 10:12:39,716 WARN L175 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-09-10 10:12:41,872 WARN L175 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-09-10 10:12:44,035 WARN L175 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-09-10 10:12:46,190 WARN L175 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-09-10 10:12:50,664 WARN L175 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-09-10 10:12:52,840 WARN L175 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-09-10 10:12:55,004 WARN L175 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-09-10 10:12:59,175 WARN L175 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-09-10 10:13:03,348 WARN L175 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 41 DAG size of output: 19 [2018-09-10 10:13:03,656 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2018-09-10 10:13:03,656 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:13:03,656 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 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-09-10 10:13:03,664 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-10 10:13:03,665 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-10 10:13:03,944 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-09-10 10:13:03,944 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:13:03,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:13:04,990 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:13:04,990 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:13:07,268 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-09-10 10:13:07,290 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-10 10:13:07,290 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 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-09-10 10:13:07,305 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-10 10:13:07,305 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-10 10:13:07,488 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-09-10 10:13:07,488 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-10 10:13:07,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-10 10:13:08,167 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-10 10:13:08,168 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-10 10:13:10,971 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 38 proven. 26 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-09-10 10:13:10,974 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-10 10:13:10,975 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 6, 55, 7] total 70 [2018-09-10 10:13:10,975 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-10 10:13:10,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-09-10 10:13:10,976 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-09-10 10:13:10,977 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=4375, Unknown=1, NotChecked=134, Total=4830 [2018-09-10 10:13:10,977 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 65 states. [2018-09-10 10:13:14,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-10 10:13:14,523 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2018-09-10 10:13:14,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-10 10:13:14,524 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 71 [2018-09-10 10:13:14,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-10 10:13:14,524 INFO L225 Difference]: With dead ends: 87 [2018-09-10 10:13:14,525 INFO L226 Difference]: Without dead ends: 0 [2018-09-10 10:13:14,527 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 247 SyntacticMatches, 24 SemanticMatches, 69 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 107.1s TimeCoverageRelationStatistics Valid=326, Invalid=4507, Unknown=1, NotChecked=136, Total=4970 [2018-09-10 10:13:14,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-10 10:13:14,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-10 10:13:14,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-10 10:13:14,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-10 10:13:14,528 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 71 [2018-09-10 10:13:14,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-10 10:13:14,528 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-10 10:13:14,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-09-10 10:13:14,528 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-10 10:13:14,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-10 10:13:14,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-10 10:13:14,748 WARN L175 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2018-09-10 10:13:14,772 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-09-10 10:13:14,773 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-10 10:13:14,773 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-10 10:13:14,773 INFO L429 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-09-10 10:13:14,773 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-10 10:13:14,773 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-10 10:13:14,773 INFO L422 ceAbstractionStarter]: At program point L31-1(lines 12 33) the Hoare annotation is: (let ((.cse5 (div main_~y~0 2))) (let ((.cse3 (* 2 .cse5)) (.cse4 (* 4294967296 (div (+ main_~y~0 (* (- 2) .cse5)) 4294967296)))) (let ((.cse1 (+ .cse3 main_~x~0 .cse4)) (.cse0 (= (+ .cse3 .cse4) main_~y~0))) (or (and (<= main_~x~0 0) (<= 0 main_~x~0)) (and (<= 20 main_~x~0) .cse0 (<= main_~x~0 20)) (and (<= .cse1 (+ main_~y~0 100)) .cse0 (<= 100 main_~x~0)) (and (<= main_~x~0 60) (<= 60 main_~x~0) .cse0) (let ((.cse2 (+ main_~x~0 5))) (and (<= 0 .cse2) (<= .cse2 0) (<= (+ .cse3 .cse4 1) main_~y~0))) (and (<= .cse1 (+ main_~y~0 40)) .cse0 (<= 40 main_~x~0)) (and (<= 80 main_~x~0) (<= main_~x~0 80) .cse0))))) [2018-09-10 10:13:14,773 INFO L426 ceAbstractionStarter]: For program point L27-1(lines 12 33) no Hoare annotation was computed. [2018-09-10 10:13:14,773 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 9 35) no Hoare annotation was computed. [2018-09-10 10:13:14,774 INFO L426 ceAbstractionStarter]: For program point L23-1(lines 12 33) no Hoare annotation was computed. [2018-09-10 10:13:14,774 INFO L426 ceAbstractionStarter]: For program point L19-1(lines 12 33) no Hoare annotation was computed. [2018-09-10 10:13:14,774 INFO L426 ceAbstractionStarter]: For program point L15-1(lines 12 33) no Hoare annotation was computed. [2018-09-10 10:13:14,774 INFO L426 ceAbstractionStarter]: For program point L12-1(lines 12 33) no Hoare annotation was computed. [2018-09-10 10:13:14,774 INFO L422 ceAbstractionStarter]: At program point L12-3(lines 12 33) the Hoare annotation is: (let ((.cse3 (div main_~y~0 2))) (let ((.cse0 (* 2 .cse3)) (.cse1 (* 4294967296 (div (+ main_~y~0 (* (- 2) .cse3)) 4294967296)))) (or (and (<= main_~y~0 (+ .cse0 .cse1)) (<= (+ .cse0 main_~x~0 .cse1) (+ main_~y~0 100)) (<= 100 main_~x~0)) (let ((.cse2 (+ main_~x~0 5))) (and (<= 0 .cse2) (<= .cse2 0) (<= (+ .cse0 .cse1 1) main_~y~0)))))) [2018-09-10 10:13:14,774 INFO L426 ceAbstractionStarter]: For program point L29-1(lines 12 33) no Hoare annotation was computed. [2018-09-10 10:13:14,774 INFO L426 ceAbstractionStarter]: For program point L25-1(lines 12 33) no Hoare annotation was computed. [2018-09-10 10:13:14,774 INFO L426 ceAbstractionStarter]: For program point L21-1(lines 12 33) no Hoare annotation was computed. [2018-09-10 10:13:14,774 INFO L426 ceAbstractionStarter]: For program point L17-1(lines 12 33) no Hoare annotation was computed. [2018-09-10 10:13:14,774 INFO L426 ceAbstractionStarter]: For program point L13(lines 13 14) no Hoare annotation was computed. [2018-09-10 10:13:14,775 INFO L426 ceAbstractionStarter]: For program point mainFINAL(lines 9 35) no Hoare annotation was computed. [2018-09-10 10:13:14,775 INFO L426 ceAbstractionStarter]: For program point L13-2(lines 12 33) no Hoare annotation was computed. [2018-09-10 10:13:14,775 INFO L429 ceAbstractionStarter]: At program point mainENTRY(lines 9 35) the Hoare annotation is: true [2018-09-10 10:13:14,775 INFO L429 ceAbstractionStarter]: At program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_diamond_true_unreach_call__i____VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-09-10 10:13:14,775 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_diamond_true_unreach_call__i____VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-09-10 10:13:14,775 INFO L426 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loop_acceleration_diamond_true_unreach_call__i____VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-09-10 10:13:14,775 INFO L426 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-09-10 10:13:14,775 INFO L426 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-09-10 10:13:14,776 INFO L426 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-09-10 10:13:14,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 10:13:14 BoogieIcfgContainer [2018-09-10 10:13:14,789 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-10 10:13:14,790 INFO L168 Benchmark]: Toolchain (without parser) took 238856.44 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 943.7 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -333.2 MB). Peak memory consumption was 610.6 MB. Max. memory is 7.1 GB. [2018-09-10 10:13:14,791 INFO L168 Benchmark]: CDTParser took 0.23 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:13:14,792 INFO L168 Benchmark]: CACSL2BoogieTranslator took 284.71 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-09-10 10:13:14,792 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.30 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:13:14,793 INFO L168 Benchmark]: Boogie Preprocessor took 26.93 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:13:14,793 INFO L168 Benchmark]: RCFGBuilder took 580.90 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 757.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -809.4 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. [2018-09-10 10:13:14,794 INFO L168 Benchmark]: TraceAbstraction took 237931.62 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 186.6 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 465.7 MB). Peak memory consumption was 652.3 MB. Max. memory is 7.1 GB. [2018-09-10 10:13:14,799 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.23 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 284.71 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 26.30 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.93 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 580.90 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 757.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -809.4 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 237931.62 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 186.6 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 465.7 MB). Peak memory consumption was 652.3 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: 12]: Loop Invariant Derived loop invariant: ((((((x <= 0 && 0 <= x) || ((20 <= x && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) && x <= 20)) || ((2 * (y / 2) + x + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) <= y + 100 && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) && 100 <= x)) || ((x <= 60 && 60 <= x) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y)) || ((0 <= x + 5 && x + 5 <= 0) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) + 1 <= y)) || ((2 * (y / 2) + x + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) <= y + 40 && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) && 40 <= x)) || ((80 <= x && x <= 80) && 2 * (y / 2) + 4294967296 * ((y + -2 * (y / 2)) / 4294967296) == y) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 28 locations, 1 error locations. SAFE Result, 237.8s OverallTime, 10 OverallIterations, 6 TraceHistogramMax, 27.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 211 SDtfs, 27 SDslu, 2081 SDs, 0 SdLazy, 7748 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1228 GetRequests, 875 SyntacticMatches, 51 SemanticMatches, 302 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1394 ImplicationChecksByTransitivity, 224.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred 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.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 7 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 18 PreInvPairs, 27 NumberOfFragments, 289 HoareAnnotationTreeSize, 18 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 184 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 208.4s InterpolantComputationTime, 841 NumberOfCodeBlocks, 841 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 1323 ConstructedInterpolants, 24 QuantifiedInterpolants, 910027 SizeOfPredicates, 20 NumberOfNonLiveVariables, 1624 ConjunctsInSsa, 706 ConjunctsInUnsatCore, 34 InterpolantComputations, 4 PerfectInterpolantSequences, 188/1364 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/diamond_true-unreach-call2.i_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-09-10_10-13-14-814.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/diamond_true-unreach-call2.i_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-10_10-13-14-814.csv Received shutdown request...