./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/termination-crafted-lit/genady_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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 -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/termination-crafted-lit/genady_true-termination_true-no-overflow.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6938b5c805400363799492c040263d9022406929 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 01:33:10,232 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 01:33:10,234 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 01:33:10,246 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 01:33:10,246 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 01:33:10,247 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 01:33:10,249 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 01:33:10,251 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 01:33:10,253 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 01:33:10,254 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 01:33:10,254 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 01:33:10,255 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 01:33:10,256 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 01:33:10,257 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 01:33:10,258 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 01:33:10,259 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 01:33:10,259 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 01:33:10,261 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 01:33:10,263 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 01:33:10,265 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 01:33:10,266 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 01:33:10,270 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 01:33:10,275 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 01:33:10,275 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 01:33:10,276 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 01:33:10,277 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 01:33:10,279 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 01:33:10,280 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 01:33:10,280 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 01:33:10,281 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 01:33:10,281 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 01:33:10,284 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 01:33:10,286 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 01:33:10,286 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 01:33:10,287 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 01:33:10,288 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 01:33:10,288 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-01-14 01:33:10,317 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 01:33:10,317 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 01:33:10,318 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 01:33:10,319 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 01:33:10,319 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 01:33:10,319 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 01:33:10,319 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 01:33:10,319 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 01:33:10,320 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 01:33:10,320 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 01:33:10,320 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 01:33:10,320 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 01:33:10,320 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-14 01:33:10,320 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 01:33:10,321 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 01:33:10,322 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 01:33:10,322 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 01:33:10,322 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 01:33:10,322 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 01:33:10,322 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 01:33:10,323 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 01:33:10,323 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 01:33:10,323 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 01:33:10,323 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 01:33:10,323 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 01:33:10,323 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 01:33:10,324 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 01:33:10,325 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6938b5c805400363799492c040263d9022406929 [2019-01-14 01:33:10,376 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 01:33:10,392 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 01:33:10,399 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 01:33:10,400 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 01:33:10,401 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 01:33:10,401 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/genady_true-termination_true-no-overflow.c [2019-01-14 01:33:10,478 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/888285942/3a0d020b9c9a4a38a525b1621d1c9bc2/FLAG3457ae956 [2019-01-14 01:33:10,903 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 01:33:10,904 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/genady_true-termination_true-no-overflow.c [2019-01-14 01:33:10,910 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/888285942/3a0d020b9c9a4a38a525b1621d1c9bc2/FLAG3457ae956 [2019-01-14 01:33:11,282 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/888285942/3a0d020b9c9a4a38a525b1621d1c9bc2 [2019-01-14 01:33:11,285 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 01:33:11,286 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 01:33:11,287 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 01:33:11,287 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 01:33:11,291 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 01:33:11,292 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 01:33:11" (1/1) ... [2019-01-14 01:33:11,294 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d04184c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:33:11, skipping insertion in model container [2019-01-14 01:33:11,295 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 01:33:11" (1/1) ... [2019-01-14 01:33:11,303 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 01:33:11,316 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 01:33:11,484 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 01:33:11,490 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 01:33:11,506 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 01:33:11,520 INFO L195 MainTranslator]: Completed translation [2019-01-14 01:33:11,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:33:11 WrapperNode [2019-01-14 01:33:11,521 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 01:33:11,522 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 01:33:11,523 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 01:33:11,523 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 01:33:11,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:33:11" (1/1) ... [2019-01-14 01:33:11,541 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:33:11" (1/1) ... [2019-01-14 01:33:11,567 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 01:33:11,569 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 01:33:11,570 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 01:33:11,570 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 01:33:11,581 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:33:11" (1/1) ... [2019-01-14 01:33:11,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:33:11" (1/1) ... [2019-01-14 01:33:11,582 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:33:11" (1/1) ... [2019-01-14 01:33:11,583 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:33:11" (1/1) ... [2019-01-14 01:33:11,589 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:33:11" (1/1) ... [2019-01-14 01:33:11,600 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:33:11" (1/1) ... [2019-01-14 01:33:11,601 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:33:11" (1/1) ... [2019-01-14 01:33:11,604 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 01:33:11,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 01:33:11,610 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 01:33:11,611 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 01:33:11,613 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:33:11" (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 [2019-01-14 01:33:11,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 01:33:11,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 01:33:12,044 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 01:33:12,044 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 01:33:12,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:33:12 BoogieIcfgContainer [2019-01-14 01:33:12,046 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 01:33:12,052 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 01:33:12,055 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 01:33:12,060 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 01:33:12,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 01:33:11" (1/3) ... [2019-01-14 01:33:12,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a44c274 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 01:33:12, skipping insertion in model container [2019-01-14 01:33:12,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 01:33:11" (2/3) ... [2019-01-14 01:33:12,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a44c274 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 01:33:12, skipping insertion in model container [2019-01-14 01:33:12,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:33:12" (3/3) ... [2019-01-14 01:33:12,074 INFO L112 eAbstractionObserver]: Analyzing ICFG genady_true-termination_true-no-overflow.c [2019-01-14 01:33:12,102 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 01:33:12,112 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-01-14 01:33:12,130 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-01-14 01:33:12,165 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 01:33:12,165 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 01:33:12,165 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 01:33:12,166 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 01:33:12,166 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 01:33:12,166 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 01:33:12,166 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 01:33:12,166 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 01:33:12,166 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 01:33:12,181 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-01-14 01:33:12,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-14 01:33:12,187 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:33:12,188 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-14 01:33:12,190 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:33:12,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:33:12,196 INFO L82 PathProgramCache]: Analyzing trace with hash 998, now seen corresponding path program 1 times [2019-01-14 01:33:12,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:33:12,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:33:12,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:12,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:33:12,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:12,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:12,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:33:12,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:33:12,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-14 01:33:12,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 01:33:12,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 01:33:12,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:33:12,368 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2019-01-14 01:33:12,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:33:12,468 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-01-14 01:33:12,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 01:33:12,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-14 01:33:12,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:33:12,479 INFO L225 Difference]: With dead ends: 22 [2019-01-14 01:33:12,479 INFO L226 Difference]: Without dead ends: 13 [2019-01-14 01:33:12,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:33:12,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-14 01:33:12,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-14 01:33:12,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-14 01:33:12,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-01-14 01:33:12,514 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 2 [2019-01-14 01:33:12,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:33:12,514 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-01-14 01:33:12,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 01:33:12,514 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-01-14 01:33:12,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-14 01:33:12,515 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:33:12,515 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-14 01:33:12,516 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:33:12,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:33:12,516 INFO L82 PathProgramCache]: Analyzing trace with hash 30977, now seen corresponding path program 1 times [2019-01-14 01:33:12,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:33:12,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:33:12,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:12,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:33:12,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:12,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:12,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:33:12,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:33:12,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-14 01:33:12,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 01:33:12,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 01:33:12,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:33:12,538 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 3 states. [2019-01-14 01:33:12,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:33:12,607 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-01-14 01:33:12,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 01:33:12,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-14 01:33:12,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:33:12,610 INFO L225 Difference]: With dead ends: 21 [2019-01-14 01:33:12,610 INFO L226 Difference]: Without dead ends: 20 [2019-01-14 01:33:12,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:33:12,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-14 01:33:12,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2019-01-14 01:33:12,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-14 01:33:12,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-01-14 01:33:12,619 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 3 [2019-01-14 01:33:12,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:33:12,620 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-01-14 01:33:12,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 01:33:12,620 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-01-14 01:33:12,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-14 01:33:12,621 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:33:12,621 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-14 01:33:12,621 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:33:12,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:33:12,622 INFO L82 PathProgramCache]: Analyzing trace with hash 29770307, now seen corresponding path program 1 times [2019-01-14 01:33:12,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:33:12,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:33:12,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:12,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:33:12,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:12,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:12,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:33:12,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:33:12,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-14 01:33:12,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 01:33:12,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 01:33:12,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:33:12,654 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 3 states. [2019-01-14 01:33:12,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:33:12,706 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-01-14 01:33:12,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 01:33:12,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-01-14 01:33:12,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:33:12,708 INFO L225 Difference]: With dead ends: 19 [2019-01-14 01:33:12,708 INFO L226 Difference]: Without dead ends: 18 [2019-01-14 01:33:12,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:33:12,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-01-14 01:33:12,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-01-14 01:33:12,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-14 01:33:12,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-01-14 01:33:12,717 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 5 [2019-01-14 01:33:12,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:33:12,721 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-01-14 01:33:12,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 01:33:12,721 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-01-14 01:33:12,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-14 01:33:12,721 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:33:12,722 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-14 01:33:12,723 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:33:12,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:33:12,723 INFO L82 PathProgramCache]: Analyzing trace with hash 922879565, now seen corresponding path program 1 times [2019-01-14 01:33:12,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:33:12,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:33:12,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:12,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:33:12,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:12,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:33:12,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:33:12,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-14 01:33:12,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 01:33:12,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 01:33:12,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:33:12,772 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 3 states. [2019-01-14 01:33:12,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:33:12,838 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-01-14 01:33:12,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 01:33:12,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-01-14 01:33:12,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:33:12,840 INFO L225 Difference]: With dead ends: 17 [2019-01-14 01:33:12,840 INFO L226 Difference]: Without dead ends: 16 [2019-01-14 01:33:12,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:33:12,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-14 01:33:12,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-01-14 01:33:12,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-14 01:33:12,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-01-14 01:33:12,845 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 6 [2019-01-14 01:33:12,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:33:12,845 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-01-14 01:33:12,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 01:33:12,845 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-01-14 01:33:12,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-14 01:33:12,846 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:33:12,846 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:33:12,846 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:33:12,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:33:12,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1455504507, now seen corresponding path program 1 times [2019-01-14 01:33:12,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:33:12,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:33:12,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:12,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:33:12,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:12,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:33:12,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:33:12,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-14 01:33:12,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 01:33:12,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 01:33:12,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:33:12,888 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 3 states. [2019-01-14 01:33:12,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:33:12,985 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-01-14 01:33:12,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 01:33:12,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-01-14 01:33:12,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:33:12,987 INFO L225 Difference]: With dead ends: 16 [2019-01-14 01:33:12,988 INFO L226 Difference]: Without dead ends: 15 [2019-01-14 01:33:12,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:33:12,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-14 01:33:12,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-14 01:33:12,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-14 01:33:12,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-01-14 01:33:12,992 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 7 [2019-01-14 01:33:12,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:33:12,993 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-01-14 01:33:12,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 01:33:12,994 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-01-14 01:33:12,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-14 01:33:12,994 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:33:12,994 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:33:12,995 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:33:12,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:33:12,995 INFO L82 PathProgramCache]: Analyzing trace with hash 2124000591, now seen corresponding path program 1 times [2019-01-14 01:33:12,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:33:12,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:33:12,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:12,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:33:12,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:13,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:13,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:33:13,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:33:13,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-14 01:33:13,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 01:33:13,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 01:33:13,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:33:13,078 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 3 states. [2019-01-14 01:33:13,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:33:13,160 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-01-14 01:33:13,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 01:33:13,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-01-14 01:33:13,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:33:13,162 INFO L225 Difference]: With dead ends: 19 [2019-01-14 01:33:13,162 INFO L226 Difference]: Without dead ends: 18 [2019-01-14 01:33:13,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 01:33:13,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-01-14 01:33:13,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-01-14 01:33:13,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-14 01:33:13,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-01-14 01:33:13,167 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 8 [2019-01-14 01:33:13,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:33:13,167 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-01-14 01:33:13,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 01:33:13,167 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-01-14 01:33:13,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 01:33:13,168 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:33:13,168 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 01:33:13,169 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:33:13,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:33:13,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1055103537, now seen corresponding path program 1 times [2019-01-14 01:33:13,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:33:13,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:33:13,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:13,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:33:13,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:13,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:13,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:33:13,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:33:13,253 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:33:13,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:33:13,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:13,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:33:13,443 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:33:13,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:33:13,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 7 [2019-01-14 01:33:13,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 01:33:13,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 01:33:13,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-01-14 01:33:13,480 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 9 states. [2019-01-14 01:33:13,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:33:13,823 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-01-14 01:33:13,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 01:33:13,824 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2019-01-14 01:33:13,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:33:13,825 INFO L225 Difference]: With dead ends: 25 [2019-01-14 01:33:13,825 INFO L226 Difference]: Without dead ends: 24 [2019-01-14 01:33:13,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-14 01:33:13,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-14 01:33:13,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2019-01-14 01:33:13,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-14 01:33:13,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-01-14 01:33:13,832 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 10 [2019-01-14 01:33:13,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:33:13,832 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-01-14 01:33:13,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 01:33:13,833 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-01-14 01:33:13,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 01:33:13,834 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:33:13,834 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-01-14 01:33:13,835 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:33:13,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:33:13,835 INFO L82 PathProgramCache]: Analyzing trace with hash 342218611, now seen corresponding path program 1 times [2019-01-14 01:33:13,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:33:13,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:33:13,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:13,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:33:13,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:13,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:13,897 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:33:13,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:33:13,897 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:33:13,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:33:13,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:13,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:33:13,928 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:33:13,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:33:13,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 2 [2019-01-14 01:33:13,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 01:33:13,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 01:33:13,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 01:33:13,951 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 4 states. [2019-01-14 01:33:14,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:33:14,012 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-01-14 01:33:14,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 01:33:14,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-01-14 01:33:14,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:33:14,014 INFO L225 Difference]: With dead ends: 24 [2019-01-14 01:33:14,014 INFO L226 Difference]: Without dead ends: 23 [2019-01-14 01:33:14,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 01:33:14,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-14 01:33:14,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-01-14 01:33:14,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-14 01:33:14,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-01-14 01:33:14,020 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 12 [2019-01-14 01:33:14,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:33:14,020 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-01-14 01:33:14,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 01:33:14,021 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-01-14 01:33:14,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 01:33:14,021 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:33:14,021 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1] [2019-01-14 01:33:14,022 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:33:14,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:33:14,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1217672673, now seen corresponding path program 1 times [2019-01-14 01:33:14,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:33:14,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:33:14,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:14,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:33:14,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:14,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:14,165 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:33:14,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:33:14,165 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:33:14,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:33:14,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:14,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:33:14,218 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:33:14,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:33:14,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 2 [2019-01-14 01:33:14,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 01:33:14,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 01:33:14,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 01:33:14,249 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 4 states. [2019-01-14 01:33:14,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:33:14,389 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-01-14 01:33:14,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 01:33:14,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-01-14 01:33:14,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:33:14,391 INFO L225 Difference]: With dead ends: 26 [2019-01-14 01:33:14,391 INFO L226 Difference]: Without dead ends: 25 [2019-01-14 01:33:14,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 01:33:14,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-14 01:33:14,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-14 01:33:14,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-14 01:33:14,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-01-14 01:33:14,396 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 15 [2019-01-14 01:33:14,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:33:14,397 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-01-14 01:33:14,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 01:33:14,397 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-01-14 01:33:14,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 01:33:14,397 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:33:14,398 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1] [2019-01-14 01:33:14,398 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:33:14,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:33:14,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1952333055, now seen corresponding path program 2 times [2019-01-14 01:33:14,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:33:14,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:33:14,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:14,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 01:33:14,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:14,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:14,522 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:33:14,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:33:14,523 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:33:14,535 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:33:14,561 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:33:14,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:33:14,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:33:14,877 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:33:14,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:33:14,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 11 [2019-01-14 01:33:14,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 01:33:14,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 01:33:14,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-01-14 01:33:14,904 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 13 states. [2019-01-14 01:33:15,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:33:15,225 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-01-14 01:33:15,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 01:33:15,226 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 17 [2019-01-14 01:33:15,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:33:15,228 INFO L225 Difference]: With dead ends: 32 [2019-01-14 01:33:15,228 INFO L226 Difference]: Without dead ends: 31 [2019-01-14 01:33:15,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=283, Unknown=0, NotChecked=0, Total=420 [2019-01-14 01:33:15,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-14 01:33:15,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2019-01-14 01:33:15,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-14 01:33:15,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-01-14 01:33:15,236 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 17 [2019-01-14 01:33:15,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:33:15,236 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-01-14 01:33:15,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 01:33:15,236 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-01-14 01:33:15,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 01:33:15,239 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:33:15,239 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1] [2019-01-14 01:33:15,239 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:33:15,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:33:15,241 INFO L82 PathProgramCache]: Analyzing trace with hash 708643907, now seen corresponding path program 2 times [2019-01-14 01:33:15,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:33:15,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:33:15,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:15,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:33:15,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:15,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:15,299 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:33:15,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:33:15,300 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:33:15,311 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:33:15,319 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:33:15,319 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:33:15,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:33:15,324 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:33:15,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:33:15,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-01-14 01:33:15,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:33:15,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:33:15,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:33:15,346 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 5 states. [2019-01-14 01:33:15,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:33:15,405 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-01-14 01:33:15,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 01:33:15,406 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-01-14 01:33:15,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:33:15,406 INFO L225 Difference]: With dead ends: 31 [2019-01-14 01:33:15,407 INFO L226 Difference]: Without dead ends: 30 [2019-01-14 01:33:15,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:33:15,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-14 01:33:15,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-01-14 01:33:15,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-14 01:33:15,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-01-14 01:33:15,412 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 19 [2019-01-14 01:33:15,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:33:15,412 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-01-14 01:33:15,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:33:15,412 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-01-14 01:33:15,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 01:33:15,413 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:33:15,413 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1] [2019-01-14 01:33:15,414 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:33:15,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:33:15,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1446421327, now seen corresponding path program 2 times [2019-01-14 01:33:15,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:33:15,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:33:15,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:15,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:33:15,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:15,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:15,506 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:33:15,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 01:33:15,506 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 01:33:15,518 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 01:33:15,530 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 01:33:15,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 01:33:15,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 01:33:15,620 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 01:33:15,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 01:33:15,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 7 [2019-01-14 01:33:15,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 01:33:15,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 01:33:15,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-01-14 01:33:15,639 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 9 states. [2019-01-14 01:33:15,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:33:15,812 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2019-01-14 01:33:15,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 01:33:15,812 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-01-14 01:33:15,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:33:15,813 INFO L225 Difference]: With dead ends: 35 [2019-01-14 01:33:15,813 INFO L226 Difference]: Without dead ends: 34 [2019-01-14 01:33:15,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-01-14 01:33:15,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-14 01:33:15,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2019-01-14 01:33:15,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-14 01:33:15,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-01-14 01:33:15,818 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 22 [2019-01-14 01:33:15,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:33:15,819 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-01-14 01:33:15,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 01:33:15,819 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-01-14 01:33:15,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-14 01:33:15,820 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:33:15,820 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1] [2019-01-14 01:33:15,820 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:33:15,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:33:15,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1558507471, now seen corresponding path program 3 times [2019-01-14 01:33:15,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:33:15,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:33:15,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:15,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:33:15,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:15,996 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-01-14 01:33:15,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:33:15,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 01:33:15,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:33:15,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:33:15,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:33:15,998 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 5 states. [2019-01-14 01:33:16,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:33:16,067 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-01-14 01:33:16,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 01:33:16,068 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-01-14 01:33:16,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:33:16,069 INFO L225 Difference]: With dead ends: 28 [2019-01-14 01:33:16,069 INFO L226 Difference]: Without dead ends: 27 [2019-01-14 01:33:16,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:33:16,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-14 01:33:16,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-14 01:33:16,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-14 01:33:16,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-01-14 01:33:16,073 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2019-01-14 01:33:16,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:33:16,074 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-01-14 01:33:16,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:33:16,074 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-01-14 01:33:16,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 01:33:16,075 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 01:33:16,075 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1] [2019-01-14 01:33:16,075 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 01:33:16,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 01:33:16,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1217908083, now seen corresponding path program 3 times [2019-01-14 01:33:16,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 01:33:16,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 01:33:16,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:16,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 01:33:16,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 01:33:16,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 01:33:16,180 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-01-14 01:33:16,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 01:33:16,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 01:33:16,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 01:33:16,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 01:33:16,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 01:33:16,182 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 5 states. [2019-01-14 01:33:16,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 01:33:16,209 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-01-14 01:33:16,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 01:33:16,210 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-01-14 01:33:16,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 01:33:16,211 INFO L225 Difference]: With dead ends: 27 [2019-01-14 01:33:16,211 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 01:33:16,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-14 01:33:16,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 01:33:16,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 01:33:16,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 01:33:16,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 01:33:16,214 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2019-01-14 01:33:16,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 01:33:16,214 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 01:33:16,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 01:33:16,214 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 01:33:16,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 01:33:16,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 01:33:16,387 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 24 [2019-01-14 01:33:16,392 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 01:33:16,392 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 16) no Hoare annotation was computed. [2019-01-14 01:33:16,392 INFO L444 ceAbstractionStarter]: At program point L19(lines 11 20) the Hoare annotation is: (<= ULTIMATE.start_main_~i~0 (+ ULTIMATE.start_main_~j~0 9999)) [2019-01-14 01:33:16,392 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2019-01-14 01:33:16,393 INFO L448 ceAbstractionStarter]: For program point L17-1(line 17) no Hoare annotation was computed. [2019-01-14 01:33:16,393 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 17) no Hoare annotation was computed. [2019-01-14 01:33:16,393 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. [2019-01-14 01:33:16,393 INFO L448 ceAbstractionStarter]: For program point L15-2(lines 15 18) no Hoare annotation was computed. [2019-01-14 01:33:16,393 INFO L444 ceAbstractionStarter]: At program point L15-4(lines 15 18) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_main_~i~0 10000))) (or (and (<= ULTIMATE.start_main_~j~0 (+ ULTIMATE.start_main_~i~0 1)) (<= 3 ULTIMATE.start_main_~j~0) .cse0) (and .cse0 (<= 10000 ULTIMATE.start_main_~i~0) (<= (+ ULTIMATE.start_main_~j~0 1) ULTIMATE.start_main_~i~0) (<= ULTIMATE.start_main_~i~0 (+ ULTIMATE.start_main_~j~0 9999))) (and (<= (+ ULTIMATE.start_main_~j~0 9997) ULTIMATE.start_main_~i~0) .cse0 (<= 2 ULTIMATE.start_main_~j~0)))) [2019-01-14 01:33:16,393 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2019-01-14 01:33:16,393 INFO L448 ceAbstractionStarter]: For program point L15-5(lines 15 18) no Hoare annotation was computed. [2019-01-14 01:33:16,393 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 01:33:16,394 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 01:33:16,394 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 16) no Hoare annotation was computed. [2019-01-14 01:33:16,394 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 17) no Hoare annotation was computed. [2019-01-14 01:33:16,394 INFO L448 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2019-01-14 01:33:16,394 INFO L448 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. [2019-01-14 01:33:16,394 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 15) no Hoare annotation was computed. [2019-01-14 01:33:16,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 01:33:16 BoogieIcfgContainer [2019-01-14 01:33:16,411 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 01:33:16,411 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 01:33:16,411 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 01:33:16,412 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 01:33:16,412 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 01:33:12" (3/4) ... [2019-01-14 01:33:16,417 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 01:33:16,427 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-14 01:33:16,427 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 01:33:16,475 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 01:33:16,475 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 01:33:16,476 INFO L168 Benchmark]: Toolchain (without parser) took 5190.72 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 951.4 MB in the beginning and 830.5 MB in the end (delta: 120.9 MB). Peak memory consumption was 232.0 MB. Max. memory is 11.5 GB. [2019-01-14 01:33:16,477 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 01:33:16,477 INFO L168 Benchmark]: CACSL2BoogieTranslator took 234.41 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 01:33:16,478 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.43 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 01:33:16,478 INFO L168 Benchmark]: Boogie Preprocessor took 40.25 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 01:33:16,479 INFO L168 Benchmark]: RCFGBuilder took 435.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -144.0 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2019-01-14 01:33:16,479 INFO L168 Benchmark]: TraceAbstraction took 4359.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 830.5 MB in the end (delta: 254.1 MB). Peak memory consumption was 254.1 MB. Max. memory is 11.5 GB. [2019-01-14 01:33:16,480 INFO L168 Benchmark]: Witness Printer took 64.01 ms. Allocated memory is still 1.1 GB. Free memory is still 830.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 01:33:16,483 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 234.41 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.43 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.25 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 435.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -144.0 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4359.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 830.5 MB in the end (delta: 254.1 MB). Peak memory consumption was 254.1 MB. Max. memory is 11.5 GB. * Witness Printer took 64.01 ms. Allocated memory is still 1.1 GB. Free memory is still 830.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 17]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 16]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 16]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 17]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: (((j <= i + 1 && 3 <= j) && i <= 10000) || (((i <= 10000 && 10000 <= i) && j + 1 <= i) && i <= j + 9999)) || ((j + 9997 <= i && i <= 10000) && 2 <= j) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: i <= j + 9999 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 6 error locations. SAFE Result, 4.2s OverallTime, 14 OverallIterations, 4 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 59 SDtfs, 133 SDslu, 30 SDs, 0 SdLazy, 395 SolverSat, 52 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 141 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=11, 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, 14 MinimizatonAttempts, 22 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 6 NumberOfFragments, 47 HoareAnnotationTreeSize, 2 FomulaSimplifications, 58 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 53 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 271 NumberOfCodeBlocks, 271 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 251 ConstructedInterpolants, 0 QuantifiedInterpolants, 12613 SizeOfPredicates, 1 NumberOfNonLiveVariables, 165 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 20 InterpolantComputations, 8 PerfectInterpolantSequences, 71/180 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...