./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/BrockschmidtCookFuhs-CAV2013-Introduction.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-crafted-lit/BrockschmidtCookFuhs-CAV2013-Introduction.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 cf5951cf7c939342bb5d014c8a7a12e4f95042e50c8d2f477b21d0a3234d49fe --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:04:27,515 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:04:27,517 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:04:27,559 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:04:27,560 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:04:27,563 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:04:27,564 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:04:27,566 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:04:27,569 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:04:27,572 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:04:27,573 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:04:27,574 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:04:27,575 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:04:27,577 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:04:27,578 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:04:27,580 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:04:27,581 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:04:27,582 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:04:27,584 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:04:27,589 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:04:27,590 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:04:27,590 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:04:27,592 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:04:27,593 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:04:27,599 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:04:27,599 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:04:27,599 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:04:27,600 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:04:27,601 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:04:27,602 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:04:27,602 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:04:27,603 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:04:27,604 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:04:27,605 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:04:27,606 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:04:27,606 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:04:27,607 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:04:27,607 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:04:27,607 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:04:27,608 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:04:27,608 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:04:27,609 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-02-21 03:04:27,641 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:04:27,641 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:04:27,642 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:04:27,642 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:04:27,643 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:04:27,643 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:04:27,643 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:04:27,643 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:04:27,644 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:04:27,644 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:04:27,645 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:04:27,645 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:04:27,645 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:04:27,645 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:04:27,645 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:04:27,646 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:04:27,646 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:04:27,646 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:04:27,646 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:04:27,646 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:04:27,647 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:04:27,647 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:04:27,647 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:04:27,647 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:04:27,647 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:04:27,648 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:04:27,648 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:04:27,649 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:04:27,649 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:04:27,649 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:04:27,649 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> cf5951cf7c939342bb5d014c8a7a12e4f95042e50c8d2f477b21d0a3234d49fe [2022-02-21 03:04:27,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:04:27,890 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:04:27,892 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:04:27,894 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:04:27,895 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:04:27,896 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/BrockschmidtCookFuhs-CAV2013-Introduction.c [2022-02-21 03:04:27,959 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/591fac164/01e77caabced47569c420780b9cb36f2/FLAG5fa2b89df [2022-02-21 03:04:28,391 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:04:28,392 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/BrockschmidtCookFuhs-CAV2013-Introduction.c [2022-02-21 03:04:28,400 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/591fac164/01e77caabced47569c420780b9cb36f2/FLAG5fa2b89df [2022-02-21 03:04:28,411 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/591fac164/01e77caabced47569c420780b9cb36f2 [2022-02-21 03:04:28,414 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:04:28,416 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:04:28,419 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:04:28,419 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:04:28,422 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:04:28,423 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:04:28" (1/1) ... [2022-02-21 03:04:28,424 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b6bc0e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:28, skipping insertion in model container [2022-02-21 03:04:28,424 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:04:28" (1/1) ... [2022-02-21 03:04:28,430 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:04:28,441 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:04:28,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:04:28,555 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:04:28,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:04:28,592 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:04:28,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:28 WrapperNode [2022-02-21 03:04:28,593 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:04:28,595 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:04:28,595 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:04:28,595 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:04:28,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:28" (1/1) ... [2022-02-21 03:04:28,606 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:28" (1/1) ... [2022-02-21 03:04:28,619 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2022-02-21 03:04:28,620 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:04:28,620 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:04:28,621 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:04:28,621 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:04:28,627 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:28" (1/1) ... [2022-02-21 03:04:28,627 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:28" (1/1) ... [2022-02-21 03:04:28,628 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:28" (1/1) ... [2022-02-21 03:04:28,628 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:28" (1/1) ... [2022-02-21 03:04:28,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:28" (1/1) ... [2022-02-21 03:04:28,634 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:28" (1/1) ... [2022-02-21 03:04:28,635 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:28" (1/1) ... [2022-02-21 03:04:28,635 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:04:28,637 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:04:28,637 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:04:28,637 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:04:28,639 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:28" (1/1) ... [2022-02-21 03:04:28,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:04:28,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:04:28,668 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-21 03:04:28,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-21 03:04:28,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:04:28,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:04:28,759 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:04:28,760 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:04:28,847 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:04:28,853 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:04:28,853 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:04:28,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:04:28 BoogieIcfgContainer [2022-02-21 03:04:28,855 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:04:28,857 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:04:28,857 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:04:28,862 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:04:28,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:04:28" (1/3) ... [2022-02-21 03:04:28,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bb6c763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:04:28, skipping insertion in model container [2022-02-21 03:04:28,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:28" (2/3) ... [2022-02-21 03:04:28,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bb6c763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:04:28, skipping insertion in model container [2022-02-21 03:04:28,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:04:28" (3/3) ... [2022-02-21 03:04:28,867 INFO L111 eAbstractionObserver]: Analyzing ICFG BrockschmidtCookFuhs-CAV2013-Introduction.c [2022-02-21 03:04:28,871 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:04:28,871 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-02-21 03:04:28,922 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:04:28,930 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-21 03:04:28,930 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-02-21 03:04:28,954 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 10 states have (on average 1.6) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:28,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-21 03:04:28,961 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:28,961 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-21 03:04:28,963 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:04:28,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:28,968 INFO L85 PathProgramCache]: Analyzing trace with hash 925796, now seen corresponding path program 1 times [2022-02-21 03:04:28,976 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:28,977 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81528744] [2022-02-21 03:04:28,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:28,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:29,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:29,151 INFO L290 TraceCheckUtils]: 0: Hoare triple {18#true} assume { :begin_inline_ULTIMATE.init } true; {18#true} is VALID [2022-02-21 03:04:29,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {18#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := 1; {20#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~y~0#1| 2147483646))} is VALID [2022-02-21 03:04:29,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {20#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~y~0#1| 2147483646))} assume !!(main_~x~0#1 > 0); {20#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~y~0#1| 2147483646))} is VALID [2022-02-21 03:04:29,154 INFO L290 TraceCheckUtils]: 3: Hoare triple {20#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~y~0#1| 2147483646))} assume !(main_~x~0#1 - main_~y~0#1 <= 2147483647); {19#false} is VALID [2022-02-21 03:04:29,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:29,156 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:29,159 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81528744] [2022-02-21 03:04:29,160 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81528744] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:04:29,160 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:04:29,160 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:04:29,161 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008021787] [2022-02-21 03:04:29,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:04:29,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-21 03:04:29,183 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:29,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:29,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:29,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:04:29,193 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:29,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:04:29,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:04:29,235 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.6) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:29,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:29,321 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-02-21 03:04:29,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:04:29,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-21 03:04:29,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:29,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:29,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-02-21 03:04:29,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:29,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-02-21 03:04:29,339 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 29 transitions. [2022-02-21 03:04:29,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:29,390 INFO L225 Difference]: With dead ends: 27 [2022-02-21 03:04:29,391 INFO L226 Difference]: Without dead ends: 14 [2022-02-21 03:04:29,393 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:04:29,399 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:29,400 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 14 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:29,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-02-21 03:04:29,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2022-02-21 03:04:29,427 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:29,428 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 13 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:29,429 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 13 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:29,429 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 13 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:29,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:29,434 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-02-21 03:04:29,434 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-02-21 03:04:29,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:29,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:29,435 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 14 states. [2022-02-21 03:04:29,435 INFO L87 Difference]: Start difference. First operand has 13 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 14 states. [2022-02-21 03:04:29,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:29,437 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-02-21 03:04:29,437 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-02-21 03:04:29,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:29,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:29,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:29,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:29,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:29,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-02-21 03:04:29,447 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 4 [2022-02-21 03:04:29,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:29,448 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-02-21 03:04:29,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:29,449 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-02-21 03:04:29,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-21 03:04:29,450 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:29,450 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-21 03:04:29,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:04:29,450 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:04:29,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:29,453 INFO L85 PathProgramCache]: Analyzing trace with hash 28699721, now seen corresponding path program 1 times [2022-02-21 03:04:29,453 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:29,454 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894911902] [2022-02-21 03:04:29,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:29,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:29,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:29,521 INFO L290 TraceCheckUtils]: 0: Hoare triple {98#true} assume { :begin_inline_ULTIMATE.init } true; {98#true} is VALID [2022-02-21 03:04:29,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {98#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := 1; {100#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:04:29,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {100#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume !!(main_~x~0#1 > 0); {101#(<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:04:29,523 INFO L290 TraceCheckUtils]: 3: Hoare triple {101#(<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~x~0#1|)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {101#(<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:04:29,524 INFO L290 TraceCheckUtils]: 4: Hoare triple {101#(<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~x~0#1|)} assume !(main_~x~0#1 - main_~y~0#1 >= -2147483648); {99#false} is VALID [2022-02-21 03:04:29,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:29,524 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:29,525 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894911902] [2022-02-21 03:04:29,525 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894911902] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:04:29,525 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:04:29,525 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:04:29,525 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564248608] [2022-02-21 03:04:29,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:04:29,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-21 03:04:29,529 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:29,529 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:29,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:29,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:04:29,538 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:29,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:04:29,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:04:29,539 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:29,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:29,610 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-02-21 03:04:29,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:04:29,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-02-21 03:04:29,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:29,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:29,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-02-21 03:04:29,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:29,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-02-21 03:04:29,614 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2022-02-21 03:04:29,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:29,638 INFO L225 Difference]: With dead ends: 18 [2022-02-21 03:04:29,638 INFO L226 Difference]: Without dead ends: 16 [2022-02-21 03:04:29,639 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:04:29,645 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 4 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:29,646 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 9 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:29,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-02-21 03:04:29,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-02-21 03:04:29,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:29,652 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 15 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:29,652 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 15 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:29,653 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 15 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:29,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:29,654 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-02-21 03:04:29,655 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-02-21 03:04:29,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:29,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:29,655 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 16 states. [2022-02-21 03:04:29,656 INFO L87 Difference]: Start difference. First operand has 15 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 16 states. [2022-02-21 03:04:29,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:29,657 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-02-21 03:04:29,657 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-02-21 03:04:29,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:29,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:29,658 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:29,658 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:29,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:29,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-02-21 03:04:29,659 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 5 [2022-02-21 03:04:29,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:29,660 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-02-21 03:04:29,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:29,660 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-02-21 03:04:29,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-21 03:04:29,661 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:29,661 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:04:29,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 03:04:29,662 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:04:29,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:29,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1810629611, now seen corresponding path program 1 times [2022-02-21 03:04:29,663 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:29,663 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6099281] [2022-02-21 03:04:29,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:29,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:29,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:29,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {175#true} assume { :begin_inline_ULTIMATE.init } true; {175#true} is VALID [2022-02-21 03:04:29,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {175#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := 1; {177#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:04:29,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {177#(<= 1 |ULTIMATE.start_main_~y~0#1|)} assume !!(main_~x~0#1 > 0); {177#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:04:29,714 INFO L290 TraceCheckUtils]: 3: Hoare triple {177#(<= 1 |ULTIMATE.start_main_~y~0#1|)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {177#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:04:29,715 INFO L290 TraceCheckUtils]: 4: Hoare triple {177#(<= 1 |ULTIMATE.start_main_~y~0#1|)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {177#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:04:29,715 INFO L290 TraceCheckUtils]: 5: Hoare triple {177#(<= 1 |ULTIMATE.start_main_~y~0#1|)} assume 1 + main_~y~0#1 <= 2147483647; {177#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:04:29,716 INFO L290 TraceCheckUtils]: 6: Hoare triple {177#(<= 1 |ULTIMATE.start_main_~y~0#1|)} assume !(1 + main_~y~0#1 >= -2147483648); {176#false} is VALID [2022-02-21 03:04:29,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:29,718 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:29,718 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6099281] [2022-02-21 03:04:29,718 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6099281] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:04:29,718 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:04:29,719 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:04:29,719 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508751797] [2022-02-21 03:04:29,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:04:29,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-21 03:04:29,721 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:29,721 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:29,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:29,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:04:29,742 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:29,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:04:29,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:04:29,743 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:29,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:29,770 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-02-21 03:04:29,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:04:29,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-21 03:04:29,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:29,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:29,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2022-02-21 03:04:29,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:29,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2022-02-21 03:04:29,772 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 11 transitions. [2022-02-21 03:04:29,785 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:29,786 INFO L225 Difference]: With dead ends: 15 [2022-02-21 03:04:29,787 INFO L226 Difference]: Without dead ends: 14 [2022-02-21 03:04:29,787 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:04:29,795 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 3 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:29,797 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 4 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:29,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-02-21 03:04:29,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-02-21 03:04:29,805 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:29,806 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:29,806 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:29,806 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:29,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:29,807 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-02-21 03:04:29,807 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-02-21 03:04:29,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:29,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:29,808 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 14 states. [2022-02-21 03:04:29,808 INFO L87 Difference]: Start difference. First operand has 14 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 14 states. [2022-02-21 03:04:29,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:29,809 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-02-21 03:04:29,809 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-02-21 03:04:29,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:29,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:29,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:29,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:29,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:29,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-02-21 03:04:29,811 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 7 [2022-02-21 03:04:29,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:29,812 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-02-21 03:04:29,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:29,812 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-02-21 03:04:29,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-21 03:04:29,812 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:29,813 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:04:29,813 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 03:04:29,813 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:04:29,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:29,814 INFO L85 PathProgramCache]: Analyzing trace with hash 553302605, now seen corresponding path program 1 times [2022-02-21 03:04:29,814 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:29,814 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936178645] [2022-02-21 03:04:29,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:29,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:29,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:29,901 INFO L290 TraceCheckUtils]: 0: Hoare triple {241#true} assume { :begin_inline_ULTIMATE.init } true; {241#true} is VALID [2022-02-21 03:04:29,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {241#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := 1; {243#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483645 (* 2 |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-21 03:04:29,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {243#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483645 (* 2 |ULTIMATE.start_main_~y~0#1|)))} assume !!(main_~x~0#1 > 0); {243#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483645 (* 2 |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-21 03:04:29,904 INFO L290 TraceCheckUtils]: 3: Hoare triple {243#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483645 (* 2 |ULTIMATE.start_main_~y~0#1|)))} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {243#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483645 (* 2 |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-21 03:04:29,906 INFO L290 TraceCheckUtils]: 4: Hoare triple {243#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483645 (* 2 |ULTIMATE.start_main_~y~0#1|)))} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {244#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483645 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:04:29,908 INFO L290 TraceCheckUtils]: 5: Hoare triple {244#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483645 |ULTIMATE.start_main_~y~0#1|))} assume 1 + main_~y~0#1 <= 2147483647; {244#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483645 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:04:29,909 INFO L290 TraceCheckUtils]: 6: Hoare triple {244#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483645 |ULTIMATE.start_main_~y~0#1|))} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {245#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~y~0#1| 2147483644))} is VALID [2022-02-21 03:04:29,910 INFO L290 TraceCheckUtils]: 7: Hoare triple {245#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~y~0#1| 2147483644))} assume !!(main_~x~0#1 > 0); {245#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~y~0#1| 2147483644))} is VALID [2022-02-21 03:04:29,910 INFO L290 TraceCheckUtils]: 8: Hoare triple {245#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~y~0#1| 2147483644))} assume !(main_~x~0#1 - main_~y~0#1 <= 2147483647); {242#false} is VALID [2022-02-21 03:04:29,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:29,911 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:29,911 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936178645] [2022-02-21 03:04:29,911 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936178645] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:04:29,912 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701999292] [2022-02-21 03:04:29,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:29,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:04:29,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:04:29,914 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:04:29,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-21 03:04:29,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:29,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:04:29,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:29,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:04:30,137 INFO L290 TraceCheckUtils]: 0: Hoare triple {241#true} assume { :begin_inline_ULTIMATE.init } true; {241#true} is VALID [2022-02-21 03:04:30,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {241#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := 1; {252#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2147483647))} is VALID [2022-02-21 03:04:30,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {252#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2147483647))} assume !!(main_~x~0#1 > 0); {252#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2147483647))} is VALID [2022-02-21 03:04:30,139 INFO L290 TraceCheckUtils]: 3: Hoare triple {252#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2147483647))} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {252#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2147483647))} is VALID [2022-02-21 03:04:30,140 INFO L290 TraceCheckUtils]: 4: Hoare triple {252#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2147483647))} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {262#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483647))} is VALID [2022-02-21 03:04:30,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {262#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483647))} assume 1 + main_~y~0#1 <= 2147483647; {262#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483647))} is VALID [2022-02-21 03:04:30,142 INFO L290 TraceCheckUtils]: 6: Hoare triple {262#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483647))} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {269#(and (<= 2 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2147483646))} is VALID [2022-02-21 03:04:30,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {269#(and (<= 2 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2147483646))} assume !!(main_~x~0#1 > 0); {269#(and (<= 2 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2147483646))} is VALID [2022-02-21 03:04:30,143 INFO L290 TraceCheckUtils]: 8: Hoare triple {269#(and (<= 2 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2147483646))} assume !(main_~x~0#1 - main_~y~0#1 <= 2147483647); {242#false} is VALID [2022-02-21 03:04:30,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:30,143 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:04:30,144 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701999292] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:04:30,144 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:04:30,144 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2022-02-21 03:04:30,144 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645789389] [2022-02-21 03:04:30,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:04:30,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-21 03:04:30,145 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:30,145 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:30,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:30,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:04:30,154 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:30,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:04:30,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:04:30,155 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:30,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:30,224 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-02-21 03:04:30,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:04:30,224 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-21 03:04:30,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:30,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:30,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2022-02-21 03:04:30,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:30,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2022-02-21 03:04:30,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 15 transitions. [2022-02-21 03:04:30,239 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:30,240 INFO L225 Difference]: With dead ends: 15 [2022-02-21 03:04:30,240 INFO L226 Difference]: Without dead ends: 14 [2022-02-21 03:04:30,241 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-02-21 03:04:30,247 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 6 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:30,248 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 5 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:30,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-02-21 03:04:30,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2022-02-21 03:04:30,254 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:30,254 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 13 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:30,255 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 13 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:30,255 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 13 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:30,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:30,256 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-02-21 03:04:30,256 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-02-21 03:04:30,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:30,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:30,257 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 14 states. [2022-02-21 03:04:30,257 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 14 states. [2022-02-21 03:04:30,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:30,258 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-02-21 03:04:30,258 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-02-21 03:04:30,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:30,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:30,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:30,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:30,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:30,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-02-21 03:04:30,260 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 9 [2022-02-21 03:04:30,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:30,260 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-02-21 03:04:30,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:30,260 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-02-21 03:04:30,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-21 03:04:30,261 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:30,261 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2022-02-21 03:04:30,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-21 03:04:30,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:04:30,478 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:04:30,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:30,479 INFO L85 PathProgramCache]: Analyzing trace with hash -27488384, now seen corresponding path program 1 times [2022-02-21 03:04:30,479 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:30,479 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383029036] [2022-02-21 03:04:30,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:30,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:30,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:30,517 INFO L290 TraceCheckUtils]: 0: Hoare triple {337#true} assume { :begin_inline_ULTIMATE.init } true; {337#true} is VALID [2022-02-21 03:04:30,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {337#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := 1; {339#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:04:30,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {339#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume !!(main_~x~0#1 > 0); {339#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:04:30,519 INFO L290 TraceCheckUtils]: 3: Hoare triple {339#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {339#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:04:30,519 INFO L290 TraceCheckUtils]: 4: Hoare triple {339#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {339#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:04:30,520 INFO L290 TraceCheckUtils]: 5: Hoare triple {339#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume 1 + main_~y~0#1 <= 2147483647; {339#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:04:30,521 INFO L290 TraceCheckUtils]: 6: Hoare triple {339#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {340#(<= |ULTIMATE.start_main_~y~0#1| 2)} is VALID [2022-02-21 03:04:30,521 INFO L290 TraceCheckUtils]: 7: Hoare triple {340#(<= |ULTIMATE.start_main_~y~0#1| 2)} assume !!(main_~x~0#1 > 0); {341#(<= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-21 03:04:30,522 INFO L290 TraceCheckUtils]: 8: Hoare triple {341#(<= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~x~0#1| 1))} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {341#(<= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-21 03:04:30,522 INFO L290 TraceCheckUtils]: 9: Hoare triple {341#(<= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~x~0#1| 1))} assume !(main_~x~0#1 - main_~y~0#1 >= -2147483648); {338#false} is VALID [2022-02-21 03:04:30,523 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:30,523 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:30,523 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383029036] [2022-02-21 03:04:30,523 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383029036] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:04:30,523 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212081444] [2022-02-21 03:04:30,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:30,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:04:30,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:04:30,525 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:04:30,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-21 03:04:30,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:30,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:04:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:30,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:04:30,621 INFO L290 TraceCheckUtils]: 0: Hoare triple {337#true} assume { :begin_inline_ULTIMATE.init } true; {337#true} is VALID [2022-02-21 03:04:30,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {337#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := 1; {339#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:04:30,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {339#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume !!(main_~x~0#1 > 0); {339#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:04:30,623 INFO L290 TraceCheckUtils]: 3: Hoare triple {339#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {339#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:04:30,624 INFO L290 TraceCheckUtils]: 4: Hoare triple {339#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {339#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:04:30,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {339#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume 1 + main_~y~0#1 <= 2147483647; {339#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:04:30,625 INFO L290 TraceCheckUtils]: 6: Hoare triple {339#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {340#(<= |ULTIMATE.start_main_~y~0#1| 2)} is VALID [2022-02-21 03:04:30,626 INFO L290 TraceCheckUtils]: 7: Hoare triple {340#(<= |ULTIMATE.start_main_~y~0#1| 2)} assume !!(main_~x~0#1 > 0); {366#(and (< 0 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 2))} is VALID [2022-02-21 03:04:30,626 INFO L290 TraceCheckUtils]: 8: Hoare triple {366#(and (< 0 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 2))} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {366#(and (< 0 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 2))} is VALID [2022-02-21 03:04:30,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {366#(and (< 0 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 2))} assume !(main_~x~0#1 - main_~y~0#1 >= -2147483648); {338#false} is VALID [2022-02-21 03:04:30,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:30,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:04:30,707 INFO L290 TraceCheckUtils]: 9: Hoare triple {373#(<= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~x~0#1| 2147483648))} assume !(main_~x~0#1 - main_~y~0#1 >= -2147483648); {338#false} is VALID [2022-02-21 03:04:30,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {373#(<= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~x~0#1| 2147483648))} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {373#(<= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~x~0#1| 2147483648))} is VALID [2022-02-21 03:04:30,708 INFO L290 TraceCheckUtils]: 7: Hoare triple {380#(<= |ULTIMATE.start_main_~y~0#1| 2147483649)} assume !!(main_~x~0#1 > 0); {373#(<= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~x~0#1| 2147483648))} is VALID [2022-02-21 03:04:30,709 INFO L290 TraceCheckUtils]: 6: Hoare triple {384#(<= |ULTIMATE.start_main_~y~0#1| 2147483648)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {380#(<= |ULTIMATE.start_main_~y~0#1| 2147483649)} is VALID [2022-02-21 03:04:30,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {384#(<= |ULTIMATE.start_main_~y~0#1| 2147483648)} assume 1 + main_~y~0#1 <= 2147483647; {384#(<= |ULTIMATE.start_main_~y~0#1| 2147483648)} is VALID [2022-02-21 03:04:30,710 INFO L290 TraceCheckUtils]: 4: Hoare triple {384#(<= |ULTIMATE.start_main_~y~0#1| 2147483648)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {384#(<= |ULTIMATE.start_main_~y~0#1| 2147483648)} is VALID [2022-02-21 03:04:30,710 INFO L290 TraceCheckUtils]: 3: Hoare triple {384#(<= |ULTIMATE.start_main_~y~0#1| 2147483648)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {384#(<= |ULTIMATE.start_main_~y~0#1| 2147483648)} is VALID [2022-02-21 03:04:30,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {384#(<= |ULTIMATE.start_main_~y~0#1| 2147483648)} assume !!(main_~x~0#1 > 0); {384#(<= |ULTIMATE.start_main_~y~0#1| 2147483648)} is VALID [2022-02-21 03:04:30,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {337#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := 1; {384#(<= |ULTIMATE.start_main_~y~0#1| 2147483648)} is VALID [2022-02-21 03:04:30,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {337#true} assume { :begin_inline_ULTIMATE.init } true; {337#true} is VALID [2022-02-21 03:04:30,712 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:30,712 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212081444] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:04:30,712 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:04:30,713 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-02-21 03:04:30,713 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166383402] [2022-02-21 03:04:30,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:04:30,713 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-21 03:04:30,714 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:30,714 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:30,737 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:30,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-21 03:04:30,738 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:30,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-21 03:04:30,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-21 03:04:30,739 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:30,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:30,907 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-02-21 03:04:30,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-21 03:04:30,907 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-21 03:04:30,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:30,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:30,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 27 transitions. [2022-02-21 03:04:30,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:30,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 27 transitions. [2022-02-21 03:04:30,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 27 transitions. [2022-02-21 03:04:30,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:30,948 INFO L225 Difference]: With dead ends: 25 [2022-02-21 03:04:30,948 INFO L226 Difference]: Without dead ends: 23 [2022-02-21 03:04:30,949 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2022-02-21 03:04:30,949 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 24 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:30,950 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 7 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:30,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-21 03:04:30,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 17. [2022-02-21 03:04:30,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:30,960 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:30,960 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:30,961 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:30,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:30,962 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-02-21 03:04:30,962 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-02-21 03:04:30,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:30,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:30,962 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 23 states. [2022-02-21 03:04:30,963 INFO L87 Difference]: Start difference. First operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 23 states. [2022-02-21 03:04:30,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:30,964 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-02-21 03:04:30,964 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-02-21 03:04:30,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:30,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:30,964 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:30,965 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:30,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:30,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-02-21 03:04:30,966 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 10 [2022-02-21 03:04:30,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:30,966 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-02-21 03:04:30,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:30,966 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-02-21 03:04:30,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-21 03:04:30,967 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:30,967 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1] [2022-02-21 03:04:30,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:04:31,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:04:31,182 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:04:31,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:31,182 INFO L85 PathProgramCache]: Analyzing trace with hash 713850534, now seen corresponding path program 1 times [2022-02-21 03:04:31,182 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:31,183 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612025627] [2022-02-21 03:04:31,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:31,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:31,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:31,229 INFO L290 TraceCheckUtils]: 0: Hoare triple {507#true} assume { :begin_inline_ULTIMATE.init } true; {507#true} is VALID [2022-02-21 03:04:31,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {507#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := 1; {509#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:04:31,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {509#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume !!(main_~x~0#1 > 0); {509#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:04:31,231 INFO L290 TraceCheckUtils]: 3: Hoare triple {509#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {509#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:04:31,231 INFO L290 TraceCheckUtils]: 4: Hoare triple {509#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {509#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:04:31,232 INFO L290 TraceCheckUtils]: 5: Hoare triple {509#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume 1 + main_~y~0#1 <= 2147483647; {509#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:04:31,232 INFO L290 TraceCheckUtils]: 6: Hoare triple {509#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {510#(<= |ULTIMATE.start_main_~y~0#1| 2)} is VALID [2022-02-21 03:04:31,233 INFO L290 TraceCheckUtils]: 7: Hoare triple {510#(<= |ULTIMATE.start_main_~y~0#1| 2)} assume !!(main_~x~0#1 > 0); {510#(<= |ULTIMATE.start_main_~y~0#1| 2)} is VALID [2022-02-21 03:04:31,233 INFO L290 TraceCheckUtils]: 8: Hoare triple {510#(<= |ULTIMATE.start_main_~y~0#1| 2)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {510#(<= |ULTIMATE.start_main_~y~0#1| 2)} is VALID [2022-02-21 03:04:31,234 INFO L290 TraceCheckUtils]: 9: Hoare triple {510#(<= |ULTIMATE.start_main_~y~0#1| 2)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {510#(<= |ULTIMATE.start_main_~y~0#1| 2)} is VALID [2022-02-21 03:04:31,234 INFO L290 TraceCheckUtils]: 10: Hoare triple {510#(<= |ULTIMATE.start_main_~y~0#1| 2)} assume 1 + main_~y~0#1 <= 2147483647; {510#(<= |ULTIMATE.start_main_~y~0#1| 2)} is VALID [2022-02-21 03:04:31,235 INFO L290 TraceCheckUtils]: 11: Hoare triple {510#(<= |ULTIMATE.start_main_~y~0#1| 2)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {511#(<= |ULTIMATE.start_main_~y~0#1| 3)} is VALID [2022-02-21 03:04:31,235 INFO L290 TraceCheckUtils]: 12: Hoare triple {511#(<= |ULTIMATE.start_main_~y~0#1| 3)} assume !!(main_~x~0#1 > 0); {511#(<= |ULTIMATE.start_main_~y~0#1| 3)} is VALID [2022-02-21 03:04:31,236 INFO L290 TraceCheckUtils]: 13: Hoare triple {511#(<= |ULTIMATE.start_main_~y~0#1| 3)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {511#(<= |ULTIMATE.start_main_~y~0#1| 3)} is VALID [2022-02-21 03:04:31,236 INFO L290 TraceCheckUtils]: 14: Hoare triple {511#(<= |ULTIMATE.start_main_~y~0#1| 3)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {511#(<= |ULTIMATE.start_main_~y~0#1| 3)} is VALID [2022-02-21 03:04:31,237 INFO L290 TraceCheckUtils]: 15: Hoare triple {511#(<= |ULTIMATE.start_main_~y~0#1| 3)} assume !(1 + main_~y~0#1 <= 2147483647); {508#false} is VALID [2022-02-21 03:04:31,237 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:31,237 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:31,237 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612025627] [2022-02-21 03:04:31,237 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612025627] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:04:31,237 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642272194] [2022-02-21 03:04:31,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:31,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:04:31,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:04:31,239 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:04:31,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-21 03:04:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:31,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:04:31,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:31,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:04:31,410 INFO L290 TraceCheckUtils]: 0: Hoare triple {507#true} assume { :begin_inline_ULTIMATE.init } true; {507#true} is VALID [2022-02-21 03:04:31,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {507#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := 1; {509#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:04:31,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {509#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume !!(main_~x~0#1 > 0); {509#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:04:31,412 INFO L290 TraceCheckUtils]: 3: Hoare triple {509#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {509#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:04:31,412 INFO L290 TraceCheckUtils]: 4: Hoare triple {509#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {509#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:04:31,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {509#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume 1 + main_~y~0#1 <= 2147483647; {509#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:04:31,414 INFO L290 TraceCheckUtils]: 6: Hoare triple {509#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {510#(<= |ULTIMATE.start_main_~y~0#1| 2)} is VALID [2022-02-21 03:04:31,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {510#(<= |ULTIMATE.start_main_~y~0#1| 2)} assume !!(main_~x~0#1 > 0); {510#(<= |ULTIMATE.start_main_~y~0#1| 2)} is VALID [2022-02-21 03:04:31,415 INFO L290 TraceCheckUtils]: 8: Hoare triple {510#(<= |ULTIMATE.start_main_~y~0#1| 2)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {510#(<= |ULTIMATE.start_main_~y~0#1| 2)} is VALID [2022-02-21 03:04:31,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {510#(<= |ULTIMATE.start_main_~y~0#1| 2)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {510#(<= |ULTIMATE.start_main_~y~0#1| 2)} is VALID [2022-02-21 03:04:31,416 INFO L290 TraceCheckUtils]: 10: Hoare triple {510#(<= |ULTIMATE.start_main_~y~0#1| 2)} assume 1 + main_~y~0#1 <= 2147483647; {510#(<= |ULTIMATE.start_main_~y~0#1| 2)} is VALID [2022-02-21 03:04:31,416 INFO L290 TraceCheckUtils]: 11: Hoare triple {510#(<= |ULTIMATE.start_main_~y~0#1| 2)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {511#(<= |ULTIMATE.start_main_~y~0#1| 3)} is VALID [2022-02-21 03:04:31,417 INFO L290 TraceCheckUtils]: 12: Hoare triple {511#(<= |ULTIMATE.start_main_~y~0#1| 3)} assume !!(main_~x~0#1 > 0); {511#(<= |ULTIMATE.start_main_~y~0#1| 3)} is VALID [2022-02-21 03:04:31,417 INFO L290 TraceCheckUtils]: 13: Hoare triple {511#(<= |ULTIMATE.start_main_~y~0#1| 3)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {511#(<= |ULTIMATE.start_main_~y~0#1| 3)} is VALID [2022-02-21 03:04:31,418 INFO L290 TraceCheckUtils]: 14: Hoare triple {511#(<= |ULTIMATE.start_main_~y~0#1| 3)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {511#(<= |ULTIMATE.start_main_~y~0#1| 3)} is VALID [2022-02-21 03:04:31,418 INFO L290 TraceCheckUtils]: 15: Hoare triple {511#(<= |ULTIMATE.start_main_~y~0#1| 3)} assume !(1 + main_~y~0#1 <= 2147483647); {508#false} is VALID [2022-02-21 03:04:31,418 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:31,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:04:31,528 INFO L290 TraceCheckUtils]: 15: Hoare triple {560#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} assume !(1 + main_~y~0#1 <= 2147483647); {508#false} is VALID [2022-02-21 03:04:31,528 INFO L290 TraceCheckUtils]: 14: Hoare triple {560#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {560#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} is VALID [2022-02-21 03:04:31,544 INFO L290 TraceCheckUtils]: 13: Hoare triple {560#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {560#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} is VALID [2022-02-21 03:04:31,544 INFO L290 TraceCheckUtils]: 12: Hoare triple {560#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} assume !!(main_~x~0#1 > 0); {560#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} is VALID [2022-02-21 03:04:31,545 INFO L290 TraceCheckUtils]: 11: Hoare triple {573#(<= |ULTIMATE.start_main_~y~0#1| 2147483645)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {560#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} is VALID [2022-02-21 03:04:31,546 INFO L290 TraceCheckUtils]: 10: Hoare triple {573#(<= |ULTIMATE.start_main_~y~0#1| 2147483645)} assume 1 + main_~y~0#1 <= 2147483647; {573#(<= |ULTIMATE.start_main_~y~0#1| 2147483645)} is VALID [2022-02-21 03:04:31,546 INFO L290 TraceCheckUtils]: 9: Hoare triple {573#(<= |ULTIMATE.start_main_~y~0#1| 2147483645)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {573#(<= |ULTIMATE.start_main_~y~0#1| 2147483645)} is VALID [2022-02-21 03:04:31,546 INFO L290 TraceCheckUtils]: 8: Hoare triple {573#(<= |ULTIMATE.start_main_~y~0#1| 2147483645)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {573#(<= |ULTIMATE.start_main_~y~0#1| 2147483645)} is VALID [2022-02-21 03:04:31,547 INFO L290 TraceCheckUtils]: 7: Hoare triple {573#(<= |ULTIMATE.start_main_~y~0#1| 2147483645)} assume !!(main_~x~0#1 > 0); {573#(<= |ULTIMATE.start_main_~y~0#1| 2147483645)} is VALID [2022-02-21 03:04:31,547 INFO L290 TraceCheckUtils]: 6: Hoare triple {589#(<= |ULTIMATE.start_main_~y~0#1| 2147483644)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {573#(<= |ULTIMATE.start_main_~y~0#1| 2147483645)} is VALID [2022-02-21 03:04:31,548 INFO L290 TraceCheckUtils]: 5: Hoare triple {589#(<= |ULTIMATE.start_main_~y~0#1| 2147483644)} assume 1 + main_~y~0#1 <= 2147483647; {589#(<= |ULTIMATE.start_main_~y~0#1| 2147483644)} is VALID [2022-02-21 03:04:31,548 INFO L290 TraceCheckUtils]: 4: Hoare triple {589#(<= |ULTIMATE.start_main_~y~0#1| 2147483644)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {589#(<= |ULTIMATE.start_main_~y~0#1| 2147483644)} is VALID [2022-02-21 03:04:31,549 INFO L290 TraceCheckUtils]: 3: Hoare triple {589#(<= |ULTIMATE.start_main_~y~0#1| 2147483644)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {589#(<= |ULTIMATE.start_main_~y~0#1| 2147483644)} is VALID [2022-02-21 03:04:31,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {589#(<= |ULTIMATE.start_main_~y~0#1| 2147483644)} assume !!(main_~x~0#1 > 0); {589#(<= |ULTIMATE.start_main_~y~0#1| 2147483644)} is VALID [2022-02-21 03:04:31,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {507#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := 1; {589#(<= |ULTIMATE.start_main_~y~0#1| 2147483644)} is VALID [2022-02-21 03:04:31,550 INFO L290 TraceCheckUtils]: 0: Hoare triple {507#true} assume { :begin_inline_ULTIMATE.init } true; {507#true} is VALID [2022-02-21 03:04:31,550 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:31,551 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642272194] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:04:31,551 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:04:31,551 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-21 03:04:31,551 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50962200] [2022-02-21 03:04:31,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:04:31,552 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-21 03:04:31,552 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:31,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:31,575 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:31,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-21 03:04:31,575 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:31,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-21 03:04:31,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:04:31,576 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:31,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:31,658 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-02-21 03:04:31,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 03:04:31,659 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-21 03:04:31,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:31,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:31,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-02-21 03:04:31,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:31,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-02-21 03:04:31,662 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 41 transitions. [2022-02-21 03:04:31,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:31,703 INFO L225 Difference]: With dead ends: 38 [2022-02-21 03:04:31,703 INFO L226 Difference]: Without dead ends: 37 [2022-02-21 03:04:31,703 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:04:31,704 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 9 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:31,704 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 11 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:31,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-02-21 03:04:31,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-02-21 03:04:31,740 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:31,740 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:31,740 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:31,741 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:31,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:31,742 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-02-21 03:04:31,742 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-02-21 03:04:31,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:31,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:31,743 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 37 states. [2022-02-21 03:04:31,743 INFO L87 Difference]: Start difference. First operand has 37 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 37 states. [2022-02-21 03:04:31,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:31,744 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-02-21 03:04:31,745 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-02-21 03:04:31,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:31,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:31,745 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:31,745 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:31,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:31,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2022-02-21 03:04:31,747 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 16 [2022-02-21 03:04:31,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:31,747 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2022-02-21 03:04:31,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:31,747 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-02-21 03:04:31,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-21 03:04:31,748 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:31,748 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1] [2022-02-21 03:04:31,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-02-21 03:04:31,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:04:31,954 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:04:31,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:31,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1979689446, now seen corresponding path program 2 times [2022-02-21 03:04:31,954 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:31,954 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024489899] [2022-02-21 03:04:31,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:31,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:32,070 INFO L290 TraceCheckUtils]: 0: Hoare triple {770#true} assume { :begin_inline_ULTIMATE.init } true; {770#true} is VALID [2022-02-21 03:04:32,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {770#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := 1; {772#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:04:32,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {772#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume !!(main_~x~0#1 > 0); {772#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:04:32,072 INFO L290 TraceCheckUtils]: 3: Hoare triple {772#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {772#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:04:32,072 INFO L290 TraceCheckUtils]: 4: Hoare triple {772#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {772#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:04:32,072 INFO L290 TraceCheckUtils]: 5: Hoare triple {772#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume 1 + main_~y~0#1 <= 2147483647; {772#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:04:32,073 INFO L290 TraceCheckUtils]: 6: Hoare triple {772#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {773#(<= |ULTIMATE.start_main_~y~0#1| 2)} is VALID [2022-02-21 03:04:32,073 INFO L290 TraceCheckUtils]: 7: Hoare triple {773#(<= |ULTIMATE.start_main_~y~0#1| 2)} assume !!(main_~x~0#1 > 0); {773#(<= |ULTIMATE.start_main_~y~0#1| 2)} is VALID [2022-02-21 03:04:32,074 INFO L290 TraceCheckUtils]: 8: Hoare triple {773#(<= |ULTIMATE.start_main_~y~0#1| 2)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {773#(<= |ULTIMATE.start_main_~y~0#1| 2)} is VALID [2022-02-21 03:04:32,074 INFO L290 TraceCheckUtils]: 9: Hoare triple {773#(<= |ULTIMATE.start_main_~y~0#1| 2)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {773#(<= |ULTIMATE.start_main_~y~0#1| 2)} is VALID [2022-02-21 03:04:32,074 INFO L290 TraceCheckUtils]: 10: Hoare triple {773#(<= |ULTIMATE.start_main_~y~0#1| 2)} assume 1 + main_~y~0#1 <= 2147483647; {773#(<= |ULTIMATE.start_main_~y~0#1| 2)} is VALID [2022-02-21 03:04:32,075 INFO L290 TraceCheckUtils]: 11: Hoare triple {773#(<= |ULTIMATE.start_main_~y~0#1| 2)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {774#(<= |ULTIMATE.start_main_~y~0#1| 3)} is VALID [2022-02-21 03:04:32,075 INFO L290 TraceCheckUtils]: 12: Hoare triple {774#(<= |ULTIMATE.start_main_~y~0#1| 3)} assume !!(main_~x~0#1 > 0); {774#(<= |ULTIMATE.start_main_~y~0#1| 3)} is VALID [2022-02-21 03:04:32,076 INFO L290 TraceCheckUtils]: 13: Hoare triple {774#(<= |ULTIMATE.start_main_~y~0#1| 3)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {774#(<= |ULTIMATE.start_main_~y~0#1| 3)} is VALID [2022-02-21 03:04:32,076 INFO L290 TraceCheckUtils]: 14: Hoare triple {774#(<= |ULTIMATE.start_main_~y~0#1| 3)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {774#(<= |ULTIMATE.start_main_~y~0#1| 3)} is VALID [2022-02-21 03:04:32,076 INFO L290 TraceCheckUtils]: 15: Hoare triple {774#(<= |ULTIMATE.start_main_~y~0#1| 3)} assume 1 + main_~y~0#1 <= 2147483647; {774#(<= |ULTIMATE.start_main_~y~0#1| 3)} is VALID [2022-02-21 03:04:32,077 INFO L290 TraceCheckUtils]: 16: Hoare triple {774#(<= |ULTIMATE.start_main_~y~0#1| 3)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {775#(<= |ULTIMATE.start_main_~y~0#1| 4)} is VALID [2022-02-21 03:04:32,077 INFO L290 TraceCheckUtils]: 17: Hoare triple {775#(<= |ULTIMATE.start_main_~y~0#1| 4)} assume !!(main_~x~0#1 > 0); {775#(<= |ULTIMATE.start_main_~y~0#1| 4)} is VALID [2022-02-21 03:04:32,078 INFO L290 TraceCheckUtils]: 18: Hoare triple {775#(<= |ULTIMATE.start_main_~y~0#1| 4)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {775#(<= |ULTIMATE.start_main_~y~0#1| 4)} is VALID [2022-02-21 03:04:32,078 INFO L290 TraceCheckUtils]: 19: Hoare triple {775#(<= |ULTIMATE.start_main_~y~0#1| 4)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {775#(<= |ULTIMATE.start_main_~y~0#1| 4)} is VALID [2022-02-21 03:04:32,078 INFO L290 TraceCheckUtils]: 20: Hoare triple {775#(<= |ULTIMATE.start_main_~y~0#1| 4)} assume 1 + main_~y~0#1 <= 2147483647; {775#(<= |ULTIMATE.start_main_~y~0#1| 4)} is VALID [2022-02-21 03:04:32,079 INFO L290 TraceCheckUtils]: 21: Hoare triple {775#(<= |ULTIMATE.start_main_~y~0#1| 4)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {776#(<= |ULTIMATE.start_main_~y~0#1| 5)} is VALID [2022-02-21 03:04:32,079 INFO L290 TraceCheckUtils]: 22: Hoare triple {776#(<= |ULTIMATE.start_main_~y~0#1| 5)} assume !!(main_~x~0#1 > 0); {776#(<= |ULTIMATE.start_main_~y~0#1| 5)} is VALID [2022-02-21 03:04:32,080 INFO L290 TraceCheckUtils]: 23: Hoare triple {776#(<= |ULTIMATE.start_main_~y~0#1| 5)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {776#(<= |ULTIMATE.start_main_~y~0#1| 5)} is VALID [2022-02-21 03:04:32,080 INFO L290 TraceCheckUtils]: 24: Hoare triple {776#(<= |ULTIMATE.start_main_~y~0#1| 5)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {776#(<= |ULTIMATE.start_main_~y~0#1| 5)} is VALID [2022-02-21 03:04:32,080 INFO L290 TraceCheckUtils]: 25: Hoare triple {776#(<= |ULTIMATE.start_main_~y~0#1| 5)} assume 1 + main_~y~0#1 <= 2147483647; {776#(<= |ULTIMATE.start_main_~y~0#1| 5)} is VALID [2022-02-21 03:04:32,081 INFO L290 TraceCheckUtils]: 26: Hoare triple {776#(<= |ULTIMATE.start_main_~y~0#1| 5)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {777#(<= |ULTIMATE.start_main_~y~0#1| 6)} is VALID [2022-02-21 03:04:32,081 INFO L290 TraceCheckUtils]: 27: Hoare triple {777#(<= |ULTIMATE.start_main_~y~0#1| 6)} assume !!(main_~x~0#1 > 0); {777#(<= |ULTIMATE.start_main_~y~0#1| 6)} is VALID [2022-02-21 03:04:32,082 INFO L290 TraceCheckUtils]: 28: Hoare triple {777#(<= |ULTIMATE.start_main_~y~0#1| 6)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {777#(<= |ULTIMATE.start_main_~y~0#1| 6)} is VALID [2022-02-21 03:04:32,082 INFO L290 TraceCheckUtils]: 29: Hoare triple {777#(<= |ULTIMATE.start_main_~y~0#1| 6)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {777#(<= |ULTIMATE.start_main_~y~0#1| 6)} is VALID [2022-02-21 03:04:32,082 INFO L290 TraceCheckUtils]: 30: Hoare triple {777#(<= |ULTIMATE.start_main_~y~0#1| 6)} assume 1 + main_~y~0#1 <= 2147483647; {777#(<= |ULTIMATE.start_main_~y~0#1| 6)} is VALID [2022-02-21 03:04:32,083 INFO L290 TraceCheckUtils]: 31: Hoare triple {777#(<= |ULTIMATE.start_main_~y~0#1| 6)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {778#(<= |ULTIMATE.start_main_~y~0#1| 7)} is VALID [2022-02-21 03:04:32,083 INFO L290 TraceCheckUtils]: 32: Hoare triple {778#(<= |ULTIMATE.start_main_~y~0#1| 7)} assume !!(main_~x~0#1 > 0); {778#(<= |ULTIMATE.start_main_~y~0#1| 7)} is VALID [2022-02-21 03:04:32,084 INFO L290 TraceCheckUtils]: 33: Hoare triple {778#(<= |ULTIMATE.start_main_~y~0#1| 7)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {778#(<= |ULTIMATE.start_main_~y~0#1| 7)} is VALID [2022-02-21 03:04:32,084 INFO L290 TraceCheckUtils]: 34: Hoare triple {778#(<= |ULTIMATE.start_main_~y~0#1| 7)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {778#(<= |ULTIMATE.start_main_~y~0#1| 7)} is VALID [2022-02-21 03:04:32,084 INFO L290 TraceCheckUtils]: 35: Hoare triple {778#(<= |ULTIMATE.start_main_~y~0#1| 7)} assume !(1 + main_~y~0#1 <= 2147483647); {771#false} is VALID [2022-02-21 03:04:32,085 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:32,085 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:32,085 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024489899] [2022-02-21 03:04:32,085 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024489899] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:04:32,085 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798633892] [2022-02-21 03:04:32,085 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:04:32,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:04:32,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:04:32,087 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:04:32,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-21 03:04:32,128 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:04:32,128 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:04:32,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:04:32,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:32,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:04:32,350 INFO L290 TraceCheckUtils]: 0: Hoare triple {770#true} assume { :begin_inline_ULTIMATE.init } true; {770#true} is VALID [2022-02-21 03:04:32,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {770#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := 1; {772#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:04:32,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {772#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume !!(main_~x~0#1 > 0); {772#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:04:32,352 INFO L290 TraceCheckUtils]: 3: Hoare triple {772#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {772#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:04:32,352 INFO L290 TraceCheckUtils]: 4: Hoare triple {772#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {772#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:04:32,353 INFO L290 TraceCheckUtils]: 5: Hoare triple {772#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume 1 + main_~y~0#1 <= 2147483647; {772#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:04:32,353 INFO L290 TraceCheckUtils]: 6: Hoare triple {772#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {773#(<= |ULTIMATE.start_main_~y~0#1| 2)} is VALID [2022-02-21 03:04:32,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {773#(<= |ULTIMATE.start_main_~y~0#1| 2)} assume !!(main_~x~0#1 > 0); {773#(<= |ULTIMATE.start_main_~y~0#1| 2)} is VALID [2022-02-21 03:04:32,354 INFO L290 TraceCheckUtils]: 8: Hoare triple {773#(<= |ULTIMATE.start_main_~y~0#1| 2)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {773#(<= |ULTIMATE.start_main_~y~0#1| 2)} is VALID [2022-02-21 03:04:32,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {773#(<= |ULTIMATE.start_main_~y~0#1| 2)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {773#(<= |ULTIMATE.start_main_~y~0#1| 2)} is VALID [2022-02-21 03:04:32,355 INFO L290 TraceCheckUtils]: 10: Hoare triple {773#(<= |ULTIMATE.start_main_~y~0#1| 2)} assume 1 + main_~y~0#1 <= 2147483647; {773#(<= |ULTIMATE.start_main_~y~0#1| 2)} is VALID [2022-02-21 03:04:32,356 INFO L290 TraceCheckUtils]: 11: Hoare triple {773#(<= |ULTIMATE.start_main_~y~0#1| 2)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {774#(<= |ULTIMATE.start_main_~y~0#1| 3)} is VALID [2022-02-21 03:04:32,356 INFO L290 TraceCheckUtils]: 12: Hoare triple {774#(<= |ULTIMATE.start_main_~y~0#1| 3)} assume !!(main_~x~0#1 > 0); {774#(<= |ULTIMATE.start_main_~y~0#1| 3)} is VALID [2022-02-21 03:04:32,357 INFO L290 TraceCheckUtils]: 13: Hoare triple {774#(<= |ULTIMATE.start_main_~y~0#1| 3)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {774#(<= |ULTIMATE.start_main_~y~0#1| 3)} is VALID [2022-02-21 03:04:32,357 INFO L290 TraceCheckUtils]: 14: Hoare triple {774#(<= |ULTIMATE.start_main_~y~0#1| 3)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {774#(<= |ULTIMATE.start_main_~y~0#1| 3)} is VALID [2022-02-21 03:04:32,357 INFO L290 TraceCheckUtils]: 15: Hoare triple {774#(<= |ULTIMATE.start_main_~y~0#1| 3)} assume 1 + main_~y~0#1 <= 2147483647; {774#(<= |ULTIMATE.start_main_~y~0#1| 3)} is VALID [2022-02-21 03:04:32,358 INFO L290 TraceCheckUtils]: 16: Hoare triple {774#(<= |ULTIMATE.start_main_~y~0#1| 3)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {775#(<= |ULTIMATE.start_main_~y~0#1| 4)} is VALID [2022-02-21 03:04:32,358 INFO L290 TraceCheckUtils]: 17: Hoare triple {775#(<= |ULTIMATE.start_main_~y~0#1| 4)} assume !!(main_~x~0#1 > 0); {775#(<= |ULTIMATE.start_main_~y~0#1| 4)} is VALID [2022-02-21 03:04:32,358 INFO L290 TraceCheckUtils]: 18: Hoare triple {775#(<= |ULTIMATE.start_main_~y~0#1| 4)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {775#(<= |ULTIMATE.start_main_~y~0#1| 4)} is VALID [2022-02-21 03:04:32,371 INFO L290 TraceCheckUtils]: 19: Hoare triple {775#(<= |ULTIMATE.start_main_~y~0#1| 4)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {775#(<= |ULTIMATE.start_main_~y~0#1| 4)} is VALID [2022-02-21 03:04:32,372 INFO L290 TraceCheckUtils]: 20: Hoare triple {775#(<= |ULTIMATE.start_main_~y~0#1| 4)} assume 1 + main_~y~0#1 <= 2147483647; {775#(<= |ULTIMATE.start_main_~y~0#1| 4)} is VALID [2022-02-21 03:04:32,372 INFO L290 TraceCheckUtils]: 21: Hoare triple {775#(<= |ULTIMATE.start_main_~y~0#1| 4)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {776#(<= |ULTIMATE.start_main_~y~0#1| 5)} is VALID [2022-02-21 03:04:32,373 INFO L290 TraceCheckUtils]: 22: Hoare triple {776#(<= |ULTIMATE.start_main_~y~0#1| 5)} assume !!(main_~x~0#1 > 0); {776#(<= |ULTIMATE.start_main_~y~0#1| 5)} is VALID [2022-02-21 03:04:32,373 INFO L290 TraceCheckUtils]: 23: Hoare triple {776#(<= |ULTIMATE.start_main_~y~0#1| 5)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {776#(<= |ULTIMATE.start_main_~y~0#1| 5)} is VALID [2022-02-21 03:04:32,373 INFO L290 TraceCheckUtils]: 24: Hoare triple {776#(<= |ULTIMATE.start_main_~y~0#1| 5)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {776#(<= |ULTIMATE.start_main_~y~0#1| 5)} is VALID [2022-02-21 03:04:32,374 INFO L290 TraceCheckUtils]: 25: Hoare triple {776#(<= |ULTIMATE.start_main_~y~0#1| 5)} assume 1 + main_~y~0#1 <= 2147483647; {776#(<= |ULTIMATE.start_main_~y~0#1| 5)} is VALID [2022-02-21 03:04:32,374 INFO L290 TraceCheckUtils]: 26: Hoare triple {776#(<= |ULTIMATE.start_main_~y~0#1| 5)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {777#(<= |ULTIMATE.start_main_~y~0#1| 6)} is VALID [2022-02-21 03:04:32,374 INFO L290 TraceCheckUtils]: 27: Hoare triple {777#(<= |ULTIMATE.start_main_~y~0#1| 6)} assume !!(main_~x~0#1 > 0); {777#(<= |ULTIMATE.start_main_~y~0#1| 6)} is VALID [2022-02-21 03:04:32,375 INFO L290 TraceCheckUtils]: 28: Hoare triple {777#(<= |ULTIMATE.start_main_~y~0#1| 6)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {777#(<= |ULTIMATE.start_main_~y~0#1| 6)} is VALID [2022-02-21 03:04:32,375 INFO L290 TraceCheckUtils]: 29: Hoare triple {777#(<= |ULTIMATE.start_main_~y~0#1| 6)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {777#(<= |ULTIMATE.start_main_~y~0#1| 6)} is VALID [2022-02-21 03:04:32,376 INFO L290 TraceCheckUtils]: 30: Hoare triple {777#(<= |ULTIMATE.start_main_~y~0#1| 6)} assume 1 + main_~y~0#1 <= 2147483647; {777#(<= |ULTIMATE.start_main_~y~0#1| 6)} is VALID [2022-02-21 03:04:32,376 INFO L290 TraceCheckUtils]: 31: Hoare triple {777#(<= |ULTIMATE.start_main_~y~0#1| 6)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {778#(<= |ULTIMATE.start_main_~y~0#1| 7)} is VALID [2022-02-21 03:04:32,376 INFO L290 TraceCheckUtils]: 32: Hoare triple {778#(<= |ULTIMATE.start_main_~y~0#1| 7)} assume !!(main_~x~0#1 > 0); {778#(<= |ULTIMATE.start_main_~y~0#1| 7)} is VALID [2022-02-21 03:04:32,377 INFO L290 TraceCheckUtils]: 33: Hoare triple {778#(<= |ULTIMATE.start_main_~y~0#1| 7)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {778#(<= |ULTIMATE.start_main_~y~0#1| 7)} is VALID [2022-02-21 03:04:32,380 INFO L290 TraceCheckUtils]: 34: Hoare triple {778#(<= |ULTIMATE.start_main_~y~0#1| 7)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {778#(<= |ULTIMATE.start_main_~y~0#1| 7)} is VALID [2022-02-21 03:04:32,380 INFO L290 TraceCheckUtils]: 35: Hoare triple {778#(<= |ULTIMATE.start_main_~y~0#1| 7)} assume !(1 + main_~y~0#1 <= 2147483647); {771#false} is VALID [2022-02-21 03:04:32,381 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:32,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:04:32,647 INFO L290 TraceCheckUtils]: 35: Hoare triple {887#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} assume !(1 + main_~y~0#1 <= 2147483647); {771#false} is VALID [2022-02-21 03:04:32,648 INFO L290 TraceCheckUtils]: 34: Hoare triple {887#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {887#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} is VALID [2022-02-21 03:04:32,648 INFO L290 TraceCheckUtils]: 33: Hoare triple {887#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {887#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} is VALID [2022-02-21 03:04:32,649 INFO L290 TraceCheckUtils]: 32: Hoare triple {887#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} assume !!(main_~x~0#1 > 0); {887#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} is VALID [2022-02-21 03:04:32,650 INFO L290 TraceCheckUtils]: 31: Hoare triple {900#(<= |ULTIMATE.start_main_~y~0#1| 2147483645)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {887#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} is VALID [2022-02-21 03:04:32,650 INFO L290 TraceCheckUtils]: 30: Hoare triple {900#(<= |ULTIMATE.start_main_~y~0#1| 2147483645)} assume 1 + main_~y~0#1 <= 2147483647; {900#(<= |ULTIMATE.start_main_~y~0#1| 2147483645)} is VALID [2022-02-21 03:04:32,651 INFO L290 TraceCheckUtils]: 29: Hoare triple {900#(<= |ULTIMATE.start_main_~y~0#1| 2147483645)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {900#(<= |ULTIMATE.start_main_~y~0#1| 2147483645)} is VALID [2022-02-21 03:04:32,652 INFO L290 TraceCheckUtils]: 28: Hoare triple {900#(<= |ULTIMATE.start_main_~y~0#1| 2147483645)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {900#(<= |ULTIMATE.start_main_~y~0#1| 2147483645)} is VALID [2022-02-21 03:04:32,652 INFO L290 TraceCheckUtils]: 27: Hoare triple {900#(<= |ULTIMATE.start_main_~y~0#1| 2147483645)} assume !!(main_~x~0#1 > 0); {900#(<= |ULTIMATE.start_main_~y~0#1| 2147483645)} is VALID [2022-02-21 03:04:32,653 INFO L290 TraceCheckUtils]: 26: Hoare triple {916#(<= |ULTIMATE.start_main_~y~0#1| 2147483644)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {900#(<= |ULTIMATE.start_main_~y~0#1| 2147483645)} is VALID [2022-02-21 03:04:32,653 INFO L290 TraceCheckUtils]: 25: Hoare triple {916#(<= |ULTIMATE.start_main_~y~0#1| 2147483644)} assume 1 + main_~y~0#1 <= 2147483647; {916#(<= |ULTIMATE.start_main_~y~0#1| 2147483644)} is VALID [2022-02-21 03:04:32,654 INFO L290 TraceCheckUtils]: 24: Hoare triple {916#(<= |ULTIMATE.start_main_~y~0#1| 2147483644)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {916#(<= |ULTIMATE.start_main_~y~0#1| 2147483644)} is VALID [2022-02-21 03:04:32,654 INFO L290 TraceCheckUtils]: 23: Hoare triple {916#(<= |ULTIMATE.start_main_~y~0#1| 2147483644)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {916#(<= |ULTIMATE.start_main_~y~0#1| 2147483644)} is VALID [2022-02-21 03:04:32,654 INFO L290 TraceCheckUtils]: 22: Hoare triple {916#(<= |ULTIMATE.start_main_~y~0#1| 2147483644)} assume !!(main_~x~0#1 > 0); {916#(<= |ULTIMATE.start_main_~y~0#1| 2147483644)} is VALID [2022-02-21 03:04:32,655 INFO L290 TraceCheckUtils]: 21: Hoare triple {932#(<= |ULTIMATE.start_main_~y~0#1| 2147483643)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {916#(<= |ULTIMATE.start_main_~y~0#1| 2147483644)} is VALID [2022-02-21 03:04:32,655 INFO L290 TraceCheckUtils]: 20: Hoare triple {932#(<= |ULTIMATE.start_main_~y~0#1| 2147483643)} assume 1 + main_~y~0#1 <= 2147483647; {932#(<= |ULTIMATE.start_main_~y~0#1| 2147483643)} is VALID [2022-02-21 03:04:32,656 INFO L290 TraceCheckUtils]: 19: Hoare triple {932#(<= |ULTIMATE.start_main_~y~0#1| 2147483643)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {932#(<= |ULTIMATE.start_main_~y~0#1| 2147483643)} is VALID [2022-02-21 03:04:32,656 INFO L290 TraceCheckUtils]: 18: Hoare triple {932#(<= |ULTIMATE.start_main_~y~0#1| 2147483643)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {932#(<= |ULTIMATE.start_main_~y~0#1| 2147483643)} is VALID [2022-02-21 03:04:32,657 INFO L290 TraceCheckUtils]: 17: Hoare triple {932#(<= |ULTIMATE.start_main_~y~0#1| 2147483643)} assume !!(main_~x~0#1 > 0); {932#(<= |ULTIMATE.start_main_~y~0#1| 2147483643)} is VALID [2022-02-21 03:04:32,661 INFO L290 TraceCheckUtils]: 16: Hoare triple {948#(<= |ULTIMATE.start_main_~y~0#1| 2147483642)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {932#(<= |ULTIMATE.start_main_~y~0#1| 2147483643)} is VALID [2022-02-21 03:04:32,662 INFO L290 TraceCheckUtils]: 15: Hoare triple {948#(<= |ULTIMATE.start_main_~y~0#1| 2147483642)} assume 1 + main_~y~0#1 <= 2147483647; {948#(<= |ULTIMATE.start_main_~y~0#1| 2147483642)} is VALID [2022-02-21 03:04:32,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {948#(<= |ULTIMATE.start_main_~y~0#1| 2147483642)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {948#(<= |ULTIMATE.start_main_~y~0#1| 2147483642)} is VALID [2022-02-21 03:04:32,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {948#(<= |ULTIMATE.start_main_~y~0#1| 2147483642)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {948#(<= |ULTIMATE.start_main_~y~0#1| 2147483642)} is VALID [2022-02-21 03:04:32,663 INFO L290 TraceCheckUtils]: 12: Hoare triple {948#(<= |ULTIMATE.start_main_~y~0#1| 2147483642)} assume !!(main_~x~0#1 > 0); {948#(<= |ULTIMATE.start_main_~y~0#1| 2147483642)} is VALID [2022-02-21 03:04:32,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {964#(<= |ULTIMATE.start_main_~y~0#1| 2147483641)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {948#(<= |ULTIMATE.start_main_~y~0#1| 2147483642)} is VALID [2022-02-21 03:04:32,664 INFO L290 TraceCheckUtils]: 10: Hoare triple {964#(<= |ULTIMATE.start_main_~y~0#1| 2147483641)} assume 1 + main_~y~0#1 <= 2147483647; {964#(<= |ULTIMATE.start_main_~y~0#1| 2147483641)} is VALID [2022-02-21 03:04:32,664 INFO L290 TraceCheckUtils]: 9: Hoare triple {964#(<= |ULTIMATE.start_main_~y~0#1| 2147483641)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {964#(<= |ULTIMATE.start_main_~y~0#1| 2147483641)} is VALID [2022-02-21 03:04:32,665 INFO L290 TraceCheckUtils]: 8: Hoare triple {964#(<= |ULTIMATE.start_main_~y~0#1| 2147483641)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {964#(<= |ULTIMATE.start_main_~y~0#1| 2147483641)} is VALID [2022-02-21 03:04:32,665 INFO L290 TraceCheckUtils]: 7: Hoare triple {964#(<= |ULTIMATE.start_main_~y~0#1| 2147483641)} assume !!(main_~x~0#1 > 0); {964#(<= |ULTIMATE.start_main_~y~0#1| 2147483641)} is VALID [2022-02-21 03:04:32,666 INFO L290 TraceCheckUtils]: 6: Hoare triple {980#(<= |ULTIMATE.start_main_~y~0#1| 2147483640)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {964#(<= |ULTIMATE.start_main_~y~0#1| 2147483641)} is VALID [2022-02-21 03:04:32,666 INFO L290 TraceCheckUtils]: 5: Hoare triple {980#(<= |ULTIMATE.start_main_~y~0#1| 2147483640)} assume 1 + main_~y~0#1 <= 2147483647; {980#(<= |ULTIMATE.start_main_~y~0#1| 2147483640)} is VALID [2022-02-21 03:04:32,667 INFO L290 TraceCheckUtils]: 4: Hoare triple {980#(<= |ULTIMATE.start_main_~y~0#1| 2147483640)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {980#(<= |ULTIMATE.start_main_~y~0#1| 2147483640)} is VALID [2022-02-21 03:04:32,667 INFO L290 TraceCheckUtils]: 3: Hoare triple {980#(<= |ULTIMATE.start_main_~y~0#1| 2147483640)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {980#(<= |ULTIMATE.start_main_~y~0#1| 2147483640)} is VALID [2022-02-21 03:04:32,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {980#(<= |ULTIMATE.start_main_~y~0#1| 2147483640)} assume !!(main_~x~0#1 > 0); {980#(<= |ULTIMATE.start_main_~y~0#1| 2147483640)} is VALID [2022-02-21 03:04:32,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {770#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := 1; {980#(<= |ULTIMATE.start_main_~y~0#1| 2147483640)} is VALID [2022-02-21 03:04:32,668 INFO L290 TraceCheckUtils]: 0: Hoare triple {770#true} assume { :begin_inline_ULTIMATE.init } true; {770#true} is VALID [2022-02-21 03:04:32,669 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:32,669 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798633892] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:04:32,670 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:04:32,670 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2022-02-21 03:04:32,670 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28088008] [2022-02-21 03:04:32,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:04:32,671 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.733333333333333) internal successors, (71), 16 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-02-21 03:04:32,672 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:32,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 4.733333333333333) internal successors, (71), 16 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:32,737 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:32,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-21 03:04:32,738 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:32,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-21 03:04:32,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2022-02-21 03:04:32,739 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand has 16 states, 15 states have (on average 4.733333333333333) internal successors, (71), 16 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:32,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:32,921 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2022-02-21 03:04:32,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-21 03:04:32,922 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.733333333333333) internal successors, (71), 16 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-02-21 03:04:32,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:32,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 4.733333333333333) internal successors, (71), 16 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:32,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 85 transitions. [2022-02-21 03:04:32,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 4.733333333333333) internal successors, (71), 16 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:32,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 85 transitions. [2022-02-21 03:04:32,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 85 transitions. [2022-02-21 03:04:32,992 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:32,993 INFO L225 Difference]: With dead ends: 78 [2022-02-21 03:04:32,993 INFO L226 Difference]: Without dead ends: 77 [2022-02-21 03:04:32,993 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2022-02-21 03:04:32,994 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 14 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:32,994 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 22 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:04:32,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-02-21 03:04:33,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-02-21 03:04:33,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:33,066 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 77 states, 76 states have (on average 1.013157894736842) internal successors, (77), 76 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:33,067 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 77 states, 76 states have (on average 1.013157894736842) internal successors, (77), 76 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:33,067 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 77 states, 76 states have (on average 1.013157894736842) internal successors, (77), 76 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:33,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:33,070 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2022-02-21 03:04:33,070 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2022-02-21 03:04:33,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:33,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:33,070 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 76 states have (on average 1.013157894736842) internal successors, (77), 76 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 77 states. [2022-02-21 03:04:33,071 INFO L87 Difference]: Start difference. First operand has 77 states, 76 states have (on average 1.013157894736842) internal successors, (77), 76 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 77 states. [2022-02-21 03:04:33,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:33,073 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2022-02-21 03:04:33,073 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2022-02-21 03:04:33,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:33,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:33,073 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:33,073 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:33,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.013157894736842) internal successors, (77), 76 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:33,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2022-02-21 03:04:33,082 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 36 [2022-02-21 03:04:33,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:33,084 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2022-02-21 03:04:33,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.733333333333333) internal successors, (71), 16 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:33,084 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2022-02-21 03:04:33,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-21 03:04:33,091 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:33,091 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 1, 1, 1] [2022-02-21 03:04:33,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:04:33,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:04:33,305 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-02-21 03:04:33,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:33,306 INFO L85 PathProgramCache]: Analyzing trace with hash 220438630, now seen corresponding path program 3 times [2022-02-21 03:04:33,306 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:33,306 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795276844] [2022-02-21 03:04:33,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:33,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:33,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:33,565 INFO L290 TraceCheckUtils]: 0: Hoare triple {1337#true} assume { :begin_inline_ULTIMATE.init } true; {1337#true} is VALID [2022-02-21 03:04:33,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {1337#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := 1; {1339#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:04:33,566 INFO L290 TraceCheckUtils]: 2: Hoare triple {1339#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume !!(main_~x~0#1 > 0); {1339#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:04:33,567 INFO L290 TraceCheckUtils]: 3: Hoare triple {1339#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1339#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:04:33,567 INFO L290 TraceCheckUtils]: 4: Hoare triple {1339#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {1339#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:04:33,567 INFO L290 TraceCheckUtils]: 5: Hoare triple {1339#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume 1 + main_~y~0#1 <= 2147483647; {1339#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:04:33,568 INFO L290 TraceCheckUtils]: 6: Hoare triple {1339#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1340#(<= |ULTIMATE.start_main_~y~0#1| 2)} is VALID [2022-02-21 03:04:33,568 INFO L290 TraceCheckUtils]: 7: Hoare triple {1340#(<= |ULTIMATE.start_main_~y~0#1| 2)} assume !!(main_~x~0#1 > 0); {1340#(<= |ULTIMATE.start_main_~y~0#1| 2)} is VALID [2022-02-21 03:04:33,569 INFO L290 TraceCheckUtils]: 8: Hoare triple {1340#(<= |ULTIMATE.start_main_~y~0#1| 2)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1340#(<= |ULTIMATE.start_main_~y~0#1| 2)} is VALID [2022-02-21 03:04:33,569 INFO L290 TraceCheckUtils]: 9: Hoare triple {1340#(<= |ULTIMATE.start_main_~y~0#1| 2)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {1340#(<= |ULTIMATE.start_main_~y~0#1| 2)} is VALID [2022-02-21 03:04:33,570 INFO L290 TraceCheckUtils]: 10: Hoare triple {1340#(<= |ULTIMATE.start_main_~y~0#1| 2)} assume 1 + main_~y~0#1 <= 2147483647; {1340#(<= |ULTIMATE.start_main_~y~0#1| 2)} is VALID [2022-02-21 03:04:33,570 INFO L290 TraceCheckUtils]: 11: Hoare triple {1340#(<= |ULTIMATE.start_main_~y~0#1| 2)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1341#(<= |ULTIMATE.start_main_~y~0#1| 3)} is VALID [2022-02-21 03:04:33,571 INFO L290 TraceCheckUtils]: 12: Hoare triple {1341#(<= |ULTIMATE.start_main_~y~0#1| 3)} assume !!(main_~x~0#1 > 0); {1341#(<= |ULTIMATE.start_main_~y~0#1| 3)} is VALID [2022-02-21 03:04:33,571 INFO L290 TraceCheckUtils]: 13: Hoare triple {1341#(<= |ULTIMATE.start_main_~y~0#1| 3)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1341#(<= |ULTIMATE.start_main_~y~0#1| 3)} is VALID [2022-02-21 03:04:33,571 INFO L290 TraceCheckUtils]: 14: Hoare triple {1341#(<= |ULTIMATE.start_main_~y~0#1| 3)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {1341#(<= |ULTIMATE.start_main_~y~0#1| 3)} is VALID [2022-02-21 03:04:33,572 INFO L290 TraceCheckUtils]: 15: Hoare triple {1341#(<= |ULTIMATE.start_main_~y~0#1| 3)} assume 1 + main_~y~0#1 <= 2147483647; {1341#(<= |ULTIMATE.start_main_~y~0#1| 3)} is VALID [2022-02-21 03:04:33,572 INFO L290 TraceCheckUtils]: 16: Hoare triple {1341#(<= |ULTIMATE.start_main_~y~0#1| 3)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1342#(<= |ULTIMATE.start_main_~y~0#1| 4)} is VALID [2022-02-21 03:04:33,572 INFO L290 TraceCheckUtils]: 17: Hoare triple {1342#(<= |ULTIMATE.start_main_~y~0#1| 4)} assume !!(main_~x~0#1 > 0); {1342#(<= |ULTIMATE.start_main_~y~0#1| 4)} is VALID [2022-02-21 03:04:33,573 INFO L290 TraceCheckUtils]: 18: Hoare triple {1342#(<= |ULTIMATE.start_main_~y~0#1| 4)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1342#(<= |ULTIMATE.start_main_~y~0#1| 4)} is VALID [2022-02-21 03:04:33,573 INFO L290 TraceCheckUtils]: 19: Hoare triple {1342#(<= |ULTIMATE.start_main_~y~0#1| 4)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {1342#(<= |ULTIMATE.start_main_~y~0#1| 4)} is VALID [2022-02-21 03:04:33,578 INFO L290 TraceCheckUtils]: 20: Hoare triple {1342#(<= |ULTIMATE.start_main_~y~0#1| 4)} assume 1 + main_~y~0#1 <= 2147483647; {1342#(<= |ULTIMATE.start_main_~y~0#1| 4)} is VALID [2022-02-21 03:04:33,579 INFO L290 TraceCheckUtils]: 21: Hoare triple {1342#(<= |ULTIMATE.start_main_~y~0#1| 4)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1343#(<= |ULTIMATE.start_main_~y~0#1| 5)} is VALID [2022-02-21 03:04:33,579 INFO L290 TraceCheckUtils]: 22: Hoare triple {1343#(<= |ULTIMATE.start_main_~y~0#1| 5)} assume !!(main_~x~0#1 > 0); {1343#(<= |ULTIMATE.start_main_~y~0#1| 5)} is VALID [2022-02-21 03:04:33,579 INFO L290 TraceCheckUtils]: 23: Hoare triple {1343#(<= |ULTIMATE.start_main_~y~0#1| 5)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1343#(<= |ULTIMATE.start_main_~y~0#1| 5)} is VALID [2022-02-21 03:04:33,580 INFO L290 TraceCheckUtils]: 24: Hoare triple {1343#(<= |ULTIMATE.start_main_~y~0#1| 5)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {1343#(<= |ULTIMATE.start_main_~y~0#1| 5)} is VALID [2022-02-21 03:04:33,580 INFO L290 TraceCheckUtils]: 25: Hoare triple {1343#(<= |ULTIMATE.start_main_~y~0#1| 5)} assume 1 + main_~y~0#1 <= 2147483647; {1343#(<= |ULTIMATE.start_main_~y~0#1| 5)} is VALID [2022-02-21 03:04:33,581 INFO L290 TraceCheckUtils]: 26: Hoare triple {1343#(<= |ULTIMATE.start_main_~y~0#1| 5)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1344#(<= |ULTIMATE.start_main_~y~0#1| 6)} is VALID [2022-02-21 03:04:33,581 INFO L290 TraceCheckUtils]: 27: Hoare triple {1344#(<= |ULTIMATE.start_main_~y~0#1| 6)} assume !!(main_~x~0#1 > 0); {1344#(<= |ULTIMATE.start_main_~y~0#1| 6)} is VALID [2022-02-21 03:04:33,581 INFO L290 TraceCheckUtils]: 28: Hoare triple {1344#(<= |ULTIMATE.start_main_~y~0#1| 6)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1344#(<= |ULTIMATE.start_main_~y~0#1| 6)} is VALID [2022-02-21 03:04:33,582 INFO L290 TraceCheckUtils]: 29: Hoare triple {1344#(<= |ULTIMATE.start_main_~y~0#1| 6)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {1344#(<= |ULTIMATE.start_main_~y~0#1| 6)} is VALID [2022-02-21 03:04:33,582 INFO L290 TraceCheckUtils]: 30: Hoare triple {1344#(<= |ULTIMATE.start_main_~y~0#1| 6)} assume 1 + main_~y~0#1 <= 2147483647; {1344#(<= |ULTIMATE.start_main_~y~0#1| 6)} is VALID [2022-02-21 03:04:33,583 INFO L290 TraceCheckUtils]: 31: Hoare triple {1344#(<= |ULTIMATE.start_main_~y~0#1| 6)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1345#(<= |ULTIMATE.start_main_~y~0#1| 7)} is VALID [2022-02-21 03:04:33,583 INFO L290 TraceCheckUtils]: 32: Hoare triple {1345#(<= |ULTIMATE.start_main_~y~0#1| 7)} assume !!(main_~x~0#1 > 0); {1345#(<= |ULTIMATE.start_main_~y~0#1| 7)} is VALID [2022-02-21 03:04:33,583 INFO L290 TraceCheckUtils]: 33: Hoare triple {1345#(<= |ULTIMATE.start_main_~y~0#1| 7)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1345#(<= |ULTIMATE.start_main_~y~0#1| 7)} is VALID [2022-02-21 03:04:33,584 INFO L290 TraceCheckUtils]: 34: Hoare triple {1345#(<= |ULTIMATE.start_main_~y~0#1| 7)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {1345#(<= |ULTIMATE.start_main_~y~0#1| 7)} is VALID [2022-02-21 03:04:33,584 INFO L290 TraceCheckUtils]: 35: Hoare triple {1345#(<= |ULTIMATE.start_main_~y~0#1| 7)} assume 1 + main_~y~0#1 <= 2147483647; {1345#(<= |ULTIMATE.start_main_~y~0#1| 7)} is VALID [2022-02-21 03:04:33,585 INFO L290 TraceCheckUtils]: 36: Hoare triple {1345#(<= |ULTIMATE.start_main_~y~0#1| 7)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1346#(<= |ULTIMATE.start_main_~y~0#1| 8)} is VALID [2022-02-21 03:04:33,585 INFO L290 TraceCheckUtils]: 37: Hoare triple {1346#(<= |ULTIMATE.start_main_~y~0#1| 8)} assume !!(main_~x~0#1 > 0); {1346#(<= |ULTIMATE.start_main_~y~0#1| 8)} is VALID [2022-02-21 03:04:33,585 INFO L290 TraceCheckUtils]: 38: Hoare triple {1346#(<= |ULTIMATE.start_main_~y~0#1| 8)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1346#(<= |ULTIMATE.start_main_~y~0#1| 8)} is VALID [2022-02-21 03:04:33,586 INFO L290 TraceCheckUtils]: 39: Hoare triple {1346#(<= |ULTIMATE.start_main_~y~0#1| 8)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {1346#(<= |ULTIMATE.start_main_~y~0#1| 8)} is VALID [2022-02-21 03:04:33,586 INFO L290 TraceCheckUtils]: 40: Hoare triple {1346#(<= |ULTIMATE.start_main_~y~0#1| 8)} assume 1 + main_~y~0#1 <= 2147483647; {1346#(<= |ULTIMATE.start_main_~y~0#1| 8)} is VALID [2022-02-21 03:04:33,587 INFO L290 TraceCheckUtils]: 41: Hoare triple {1346#(<= |ULTIMATE.start_main_~y~0#1| 8)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1347#(<= |ULTIMATE.start_main_~y~0#1| 9)} is VALID [2022-02-21 03:04:33,587 INFO L290 TraceCheckUtils]: 42: Hoare triple {1347#(<= |ULTIMATE.start_main_~y~0#1| 9)} assume !!(main_~x~0#1 > 0); {1347#(<= |ULTIMATE.start_main_~y~0#1| 9)} is VALID [2022-02-21 03:04:33,587 INFO L290 TraceCheckUtils]: 43: Hoare triple {1347#(<= |ULTIMATE.start_main_~y~0#1| 9)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1347#(<= |ULTIMATE.start_main_~y~0#1| 9)} is VALID [2022-02-21 03:04:33,588 INFO L290 TraceCheckUtils]: 44: Hoare triple {1347#(<= |ULTIMATE.start_main_~y~0#1| 9)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {1347#(<= |ULTIMATE.start_main_~y~0#1| 9)} is VALID [2022-02-21 03:04:33,588 INFO L290 TraceCheckUtils]: 45: Hoare triple {1347#(<= |ULTIMATE.start_main_~y~0#1| 9)} assume 1 + main_~y~0#1 <= 2147483647; {1347#(<= |ULTIMATE.start_main_~y~0#1| 9)} is VALID [2022-02-21 03:04:33,588 INFO L290 TraceCheckUtils]: 46: Hoare triple {1347#(<= |ULTIMATE.start_main_~y~0#1| 9)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1348#(<= |ULTIMATE.start_main_~y~0#1| 10)} is VALID [2022-02-21 03:04:33,589 INFO L290 TraceCheckUtils]: 47: Hoare triple {1348#(<= |ULTIMATE.start_main_~y~0#1| 10)} assume !!(main_~x~0#1 > 0); {1348#(<= |ULTIMATE.start_main_~y~0#1| 10)} is VALID [2022-02-21 03:04:33,589 INFO L290 TraceCheckUtils]: 48: Hoare triple {1348#(<= |ULTIMATE.start_main_~y~0#1| 10)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1348#(<= |ULTIMATE.start_main_~y~0#1| 10)} is VALID [2022-02-21 03:04:33,589 INFO L290 TraceCheckUtils]: 49: Hoare triple {1348#(<= |ULTIMATE.start_main_~y~0#1| 10)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {1348#(<= |ULTIMATE.start_main_~y~0#1| 10)} is VALID [2022-02-21 03:04:33,590 INFO L290 TraceCheckUtils]: 50: Hoare triple {1348#(<= |ULTIMATE.start_main_~y~0#1| 10)} assume 1 + main_~y~0#1 <= 2147483647; {1348#(<= |ULTIMATE.start_main_~y~0#1| 10)} is VALID [2022-02-21 03:04:33,590 INFO L290 TraceCheckUtils]: 51: Hoare triple {1348#(<= |ULTIMATE.start_main_~y~0#1| 10)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1349#(<= |ULTIMATE.start_main_~y~0#1| 11)} is VALID [2022-02-21 03:04:33,591 INFO L290 TraceCheckUtils]: 52: Hoare triple {1349#(<= |ULTIMATE.start_main_~y~0#1| 11)} assume !!(main_~x~0#1 > 0); {1349#(<= |ULTIMATE.start_main_~y~0#1| 11)} is VALID [2022-02-21 03:04:33,591 INFO L290 TraceCheckUtils]: 53: Hoare triple {1349#(<= |ULTIMATE.start_main_~y~0#1| 11)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1349#(<= |ULTIMATE.start_main_~y~0#1| 11)} is VALID [2022-02-21 03:04:33,591 INFO L290 TraceCheckUtils]: 54: Hoare triple {1349#(<= |ULTIMATE.start_main_~y~0#1| 11)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {1349#(<= |ULTIMATE.start_main_~y~0#1| 11)} is VALID [2022-02-21 03:04:33,592 INFO L290 TraceCheckUtils]: 55: Hoare triple {1349#(<= |ULTIMATE.start_main_~y~0#1| 11)} assume 1 + main_~y~0#1 <= 2147483647; {1349#(<= |ULTIMATE.start_main_~y~0#1| 11)} is VALID [2022-02-21 03:04:33,592 INFO L290 TraceCheckUtils]: 56: Hoare triple {1349#(<= |ULTIMATE.start_main_~y~0#1| 11)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1350#(<= |ULTIMATE.start_main_~y~0#1| 12)} is VALID [2022-02-21 03:04:33,593 INFO L290 TraceCheckUtils]: 57: Hoare triple {1350#(<= |ULTIMATE.start_main_~y~0#1| 12)} assume !!(main_~x~0#1 > 0); {1350#(<= |ULTIMATE.start_main_~y~0#1| 12)} is VALID [2022-02-21 03:04:33,593 INFO L290 TraceCheckUtils]: 58: Hoare triple {1350#(<= |ULTIMATE.start_main_~y~0#1| 12)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1350#(<= |ULTIMATE.start_main_~y~0#1| 12)} is VALID [2022-02-21 03:04:33,593 INFO L290 TraceCheckUtils]: 59: Hoare triple {1350#(<= |ULTIMATE.start_main_~y~0#1| 12)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {1350#(<= |ULTIMATE.start_main_~y~0#1| 12)} is VALID [2022-02-21 03:04:33,594 INFO L290 TraceCheckUtils]: 60: Hoare triple {1350#(<= |ULTIMATE.start_main_~y~0#1| 12)} assume 1 + main_~y~0#1 <= 2147483647; {1350#(<= |ULTIMATE.start_main_~y~0#1| 12)} is VALID [2022-02-21 03:04:33,594 INFO L290 TraceCheckUtils]: 61: Hoare triple {1350#(<= |ULTIMATE.start_main_~y~0#1| 12)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1351#(<= |ULTIMATE.start_main_~y~0#1| 13)} is VALID [2022-02-21 03:04:33,594 INFO L290 TraceCheckUtils]: 62: Hoare triple {1351#(<= |ULTIMATE.start_main_~y~0#1| 13)} assume !!(main_~x~0#1 > 0); {1351#(<= |ULTIMATE.start_main_~y~0#1| 13)} is VALID [2022-02-21 03:04:33,595 INFO L290 TraceCheckUtils]: 63: Hoare triple {1351#(<= |ULTIMATE.start_main_~y~0#1| 13)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1351#(<= |ULTIMATE.start_main_~y~0#1| 13)} is VALID [2022-02-21 03:04:33,595 INFO L290 TraceCheckUtils]: 64: Hoare triple {1351#(<= |ULTIMATE.start_main_~y~0#1| 13)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {1351#(<= |ULTIMATE.start_main_~y~0#1| 13)} is VALID [2022-02-21 03:04:33,595 INFO L290 TraceCheckUtils]: 65: Hoare triple {1351#(<= |ULTIMATE.start_main_~y~0#1| 13)} assume 1 + main_~y~0#1 <= 2147483647; {1351#(<= |ULTIMATE.start_main_~y~0#1| 13)} is VALID [2022-02-21 03:04:33,596 INFO L290 TraceCheckUtils]: 66: Hoare triple {1351#(<= |ULTIMATE.start_main_~y~0#1| 13)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1352#(<= |ULTIMATE.start_main_~y~0#1| 14)} is VALID [2022-02-21 03:04:33,596 INFO L290 TraceCheckUtils]: 67: Hoare triple {1352#(<= |ULTIMATE.start_main_~y~0#1| 14)} assume !!(main_~x~0#1 > 0); {1352#(<= |ULTIMATE.start_main_~y~0#1| 14)} is VALID [2022-02-21 03:04:33,596 INFO L290 TraceCheckUtils]: 68: Hoare triple {1352#(<= |ULTIMATE.start_main_~y~0#1| 14)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1352#(<= |ULTIMATE.start_main_~y~0#1| 14)} is VALID [2022-02-21 03:04:33,597 INFO L290 TraceCheckUtils]: 69: Hoare triple {1352#(<= |ULTIMATE.start_main_~y~0#1| 14)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {1352#(<= |ULTIMATE.start_main_~y~0#1| 14)} is VALID [2022-02-21 03:04:33,597 INFO L290 TraceCheckUtils]: 70: Hoare triple {1352#(<= |ULTIMATE.start_main_~y~0#1| 14)} assume 1 + main_~y~0#1 <= 2147483647; {1352#(<= |ULTIMATE.start_main_~y~0#1| 14)} is VALID [2022-02-21 03:04:33,598 INFO L290 TraceCheckUtils]: 71: Hoare triple {1352#(<= |ULTIMATE.start_main_~y~0#1| 14)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1353#(<= |ULTIMATE.start_main_~y~0#1| 15)} is VALID [2022-02-21 03:04:33,598 INFO L290 TraceCheckUtils]: 72: Hoare triple {1353#(<= |ULTIMATE.start_main_~y~0#1| 15)} assume !!(main_~x~0#1 > 0); {1353#(<= |ULTIMATE.start_main_~y~0#1| 15)} is VALID [2022-02-21 03:04:33,598 INFO L290 TraceCheckUtils]: 73: Hoare triple {1353#(<= |ULTIMATE.start_main_~y~0#1| 15)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1353#(<= |ULTIMATE.start_main_~y~0#1| 15)} is VALID [2022-02-21 03:04:33,598 INFO L290 TraceCheckUtils]: 74: Hoare triple {1353#(<= |ULTIMATE.start_main_~y~0#1| 15)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {1353#(<= |ULTIMATE.start_main_~y~0#1| 15)} is VALID [2022-02-21 03:04:33,599 INFO L290 TraceCheckUtils]: 75: Hoare triple {1353#(<= |ULTIMATE.start_main_~y~0#1| 15)} assume !(1 + main_~y~0#1 <= 2147483647); {1338#false} is VALID [2022-02-21 03:04:33,599 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:33,600 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:33,600 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795276844] [2022-02-21 03:04:33,600 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795276844] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:04:33,600 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288062976] [2022-02-21 03:04:33,600 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 03:04:33,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:04:33,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:04:33,612 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:04:33,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-21 03:04:33,682 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-02-21 03:04:33,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:04:33,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:04:33,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:33,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:04:49,391 INFO L290 TraceCheckUtils]: 0: Hoare triple {1337#true} assume { :begin_inline_ULTIMATE.init } true; {1337#true} is VALID [2022-02-21 03:04:49,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {1337#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := 1; {1337#true} is VALID [2022-02-21 03:04:49,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {1337#true} assume !!(main_~x~0#1 > 0); {1337#true} is VALID [2022-02-21 03:04:49,392 INFO L290 TraceCheckUtils]: 3: Hoare triple {1337#true} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:04:49,392 INFO L290 TraceCheckUtils]: 4: Hoare triple {1337#true} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {1337#true} is VALID [2022-02-21 03:04:49,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {1337#true} assume 1 + main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:04:49,392 INFO L290 TraceCheckUtils]: 6: Hoare triple {1337#true} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1337#true} is VALID [2022-02-21 03:04:49,392 INFO L290 TraceCheckUtils]: 7: Hoare triple {1337#true} assume !!(main_~x~0#1 > 0); {1337#true} is VALID [2022-02-21 03:04:49,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {1337#true} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:04:49,393 INFO L290 TraceCheckUtils]: 9: Hoare triple {1337#true} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {1337#true} is VALID [2022-02-21 03:04:49,393 INFO L290 TraceCheckUtils]: 10: Hoare triple {1337#true} assume 1 + main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:04:49,393 INFO L290 TraceCheckUtils]: 11: Hoare triple {1337#true} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1337#true} is VALID [2022-02-21 03:04:49,393 INFO L290 TraceCheckUtils]: 12: Hoare triple {1337#true} assume !!(main_~x~0#1 > 0); {1337#true} is VALID [2022-02-21 03:04:49,393 INFO L290 TraceCheckUtils]: 13: Hoare triple {1337#true} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:04:49,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {1337#true} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {1337#true} is VALID [2022-02-21 03:04:49,393 INFO L290 TraceCheckUtils]: 15: Hoare triple {1337#true} assume 1 + main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:04:49,394 INFO L290 TraceCheckUtils]: 16: Hoare triple {1337#true} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1337#true} is VALID [2022-02-21 03:04:49,394 INFO L290 TraceCheckUtils]: 17: Hoare triple {1337#true} assume !!(main_~x~0#1 > 0); {1337#true} is VALID [2022-02-21 03:04:49,394 INFO L290 TraceCheckUtils]: 18: Hoare triple {1337#true} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:04:49,394 INFO L290 TraceCheckUtils]: 19: Hoare triple {1337#true} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {1337#true} is VALID [2022-02-21 03:04:49,394 INFO L290 TraceCheckUtils]: 20: Hoare triple {1337#true} assume 1 + main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:04:49,394 INFO L290 TraceCheckUtils]: 21: Hoare triple {1337#true} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1337#true} is VALID [2022-02-21 03:04:49,394 INFO L290 TraceCheckUtils]: 22: Hoare triple {1337#true} assume !!(main_~x~0#1 > 0); {1337#true} is VALID [2022-02-21 03:04:49,395 INFO L290 TraceCheckUtils]: 23: Hoare triple {1337#true} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:04:49,395 INFO L290 TraceCheckUtils]: 24: Hoare triple {1337#true} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {1337#true} is VALID [2022-02-21 03:04:49,395 INFO L290 TraceCheckUtils]: 25: Hoare triple {1337#true} assume 1 + main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:04:49,395 INFO L290 TraceCheckUtils]: 26: Hoare triple {1337#true} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1337#true} is VALID [2022-02-21 03:04:49,395 INFO L290 TraceCheckUtils]: 27: Hoare triple {1337#true} assume !!(main_~x~0#1 > 0); {1337#true} is VALID [2022-02-21 03:04:49,395 INFO L290 TraceCheckUtils]: 28: Hoare triple {1337#true} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:04:49,396 INFO L290 TraceCheckUtils]: 29: Hoare triple {1337#true} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {1337#true} is VALID [2022-02-21 03:04:49,396 INFO L290 TraceCheckUtils]: 30: Hoare triple {1337#true} assume 1 + main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:04:49,396 INFO L290 TraceCheckUtils]: 31: Hoare triple {1337#true} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1337#true} is VALID [2022-02-21 03:04:49,396 INFO L290 TraceCheckUtils]: 32: Hoare triple {1337#true} assume !!(main_~x~0#1 > 0); {1337#true} is VALID [2022-02-21 03:04:49,396 INFO L290 TraceCheckUtils]: 33: Hoare triple {1337#true} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:04:49,396 INFO L290 TraceCheckUtils]: 34: Hoare triple {1337#true} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {1337#true} is VALID [2022-02-21 03:04:49,396 INFO L290 TraceCheckUtils]: 35: Hoare triple {1337#true} assume 1 + main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:04:49,397 INFO L290 TraceCheckUtils]: 36: Hoare triple {1337#true} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1337#true} is VALID [2022-02-21 03:04:49,397 INFO L290 TraceCheckUtils]: 37: Hoare triple {1337#true} assume !!(main_~x~0#1 > 0); {1337#true} is VALID [2022-02-21 03:04:49,397 INFO L290 TraceCheckUtils]: 38: Hoare triple {1337#true} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:04:49,397 INFO L290 TraceCheckUtils]: 39: Hoare triple {1337#true} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {1337#true} is VALID [2022-02-21 03:04:49,397 INFO L290 TraceCheckUtils]: 40: Hoare triple {1337#true} assume 1 + main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:04:49,397 INFO L290 TraceCheckUtils]: 41: Hoare triple {1337#true} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1337#true} is VALID [2022-02-21 03:04:49,397 INFO L290 TraceCheckUtils]: 42: Hoare triple {1337#true} assume !!(main_~x~0#1 > 0); {1337#true} is VALID [2022-02-21 03:04:49,398 INFO L290 TraceCheckUtils]: 43: Hoare triple {1337#true} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:04:49,398 INFO L290 TraceCheckUtils]: 44: Hoare triple {1337#true} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {1337#true} is VALID [2022-02-21 03:04:49,398 INFO L290 TraceCheckUtils]: 45: Hoare triple {1337#true} assume 1 + main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:04:49,398 INFO L290 TraceCheckUtils]: 46: Hoare triple {1337#true} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1337#true} is VALID [2022-02-21 03:04:49,398 INFO L290 TraceCheckUtils]: 47: Hoare triple {1337#true} assume !!(main_~x~0#1 > 0); {1337#true} is VALID [2022-02-21 03:04:49,398 INFO L290 TraceCheckUtils]: 48: Hoare triple {1337#true} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:04:49,398 INFO L290 TraceCheckUtils]: 49: Hoare triple {1337#true} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {1337#true} is VALID [2022-02-21 03:04:49,399 INFO L290 TraceCheckUtils]: 50: Hoare triple {1337#true} assume 1 + main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:04:49,399 INFO L290 TraceCheckUtils]: 51: Hoare triple {1337#true} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1337#true} is VALID [2022-02-21 03:04:49,399 INFO L290 TraceCheckUtils]: 52: Hoare triple {1337#true} assume !!(main_~x~0#1 > 0); {1337#true} is VALID [2022-02-21 03:04:49,399 INFO L290 TraceCheckUtils]: 53: Hoare triple {1337#true} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:04:49,399 INFO L290 TraceCheckUtils]: 54: Hoare triple {1337#true} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {1337#true} is VALID [2022-02-21 03:04:49,399 INFO L290 TraceCheckUtils]: 55: Hoare triple {1337#true} assume 1 + main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:04:49,399 INFO L290 TraceCheckUtils]: 56: Hoare triple {1337#true} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1337#true} is VALID [2022-02-21 03:04:49,400 INFO L290 TraceCheckUtils]: 57: Hoare triple {1337#true} assume !!(main_~x~0#1 > 0); {1337#true} is VALID [2022-02-21 03:04:49,400 INFO L290 TraceCheckUtils]: 58: Hoare triple {1337#true} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1531#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483647 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:04:49,401 INFO L290 TraceCheckUtils]: 59: Hoare triple {1531#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483647 |ULTIMATE.start_main_~y~0#1|))} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {1535#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} is VALID [2022-02-21 03:04:49,401 INFO L290 TraceCheckUtils]: 60: Hoare triple {1535#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} assume 1 + main_~y~0#1 <= 2147483647; {1535#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} is VALID [2022-02-21 03:04:49,402 INFO L290 TraceCheckUtils]: 61: Hoare triple {1535#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1535#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} is VALID [2022-02-21 03:04:49,402 INFO L290 TraceCheckUtils]: 62: Hoare triple {1535#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} assume !!(main_~x~0#1 > 0); {1535#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} is VALID [2022-02-21 03:04:49,403 INFO L290 TraceCheckUtils]: 63: Hoare triple {1535#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1535#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} is VALID [2022-02-21 03:04:49,403 INFO L290 TraceCheckUtils]: 64: Hoare triple {1535#(<= |ULTIMATE.start_main_~x~0#1| 2147483647)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {1551#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483647)} is VALID [2022-02-21 03:04:49,404 INFO L290 TraceCheckUtils]: 65: Hoare triple {1551#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483647)} assume 1 + main_~y~0#1 <= 2147483647; {1551#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483647)} is VALID [2022-02-21 03:04:49,405 INFO L290 TraceCheckUtils]: 66: Hoare triple {1551#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483647)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1558#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483648)} is VALID [2022-02-21 03:04:49,405 INFO L290 TraceCheckUtils]: 67: Hoare triple {1558#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483648)} assume !!(main_~x~0#1 > 0); {1558#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483648)} is VALID [2022-02-21 03:04:49,406 INFO L290 TraceCheckUtils]: 68: Hoare triple {1558#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483648)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1558#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483648)} is VALID [2022-02-21 03:04:49,406 INFO L290 TraceCheckUtils]: 69: Hoare triple {1558#(<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483648)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {1568#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|) 2147483648)} is VALID [2022-02-21 03:04:49,407 INFO L290 TraceCheckUtils]: 70: Hoare triple {1568#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|) 2147483648)} assume 1 + main_~y~0#1 <= 2147483647; {1568#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|) 2147483648)} is VALID [2022-02-21 03:04:49,408 INFO L290 TraceCheckUtils]: 71: Hoare triple {1568#(<= (+ (* 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|) 2147483648)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1575#(<= |ULTIMATE.start_main_~y~0#1| (+ (div (+ (* (- 1) |ULTIMATE.start_main_~x~0#1|) 2147483648) 2) 1))} is VALID [2022-02-21 03:04:49,408 INFO L290 TraceCheckUtils]: 72: Hoare triple {1575#(<= |ULTIMATE.start_main_~y~0#1| (+ (div (+ (* (- 1) |ULTIMATE.start_main_~x~0#1|) 2147483648) 2) 1))} assume !!(main_~x~0#1 > 0); {1579#(< |ULTIMATE.start_main_~y~0#1| 1073741825)} is VALID [2022-02-21 03:04:49,409 INFO L290 TraceCheckUtils]: 73: Hoare triple {1579#(< |ULTIMATE.start_main_~y~0#1| 1073741825)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1579#(< |ULTIMATE.start_main_~y~0#1| 1073741825)} is VALID [2022-02-21 03:04:49,409 INFO L290 TraceCheckUtils]: 74: Hoare triple {1579#(< |ULTIMATE.start_main_~y~0#1| 1073741825)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {1579#(< |ULTIMATE.start_main_~y~0#1| 1073741825)} is VALID [2022-02-21 03:04:49,410 INFO L290 TraceCheckUtils]: 75: Hoare triple {1579#(< |ULTIMATE.start_main_~y~0#1| 1073741825)} assume !(1 + main_~y~0#1 <= 2147483647); {1338#false} is VALID [2022-02-21 03:04:49,410 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 193 proven. 21 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2022-02-21 03:04:49,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:04:49,905 INFO L290 TraceCheckUtils]: 75: Hoare triple {1589#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} assume !(1 + main_~y~0#1 <= 2147483647); {1338#false} is VALID [2022-02-21 03:04:49,906 INFO L290 TraceCheckUtils]: 74: Hoare triple {1589#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {1589#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} is VALID [2022-02-21 03:04:49,906 INFO L290 TraceCheckUtils]: 73: Hoare triple {1589#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1589#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} is VALID [2022-02-21 03:04:49,907 INFO L290 TraceCheckUtils]: 72: Hoare triple {1599#(or (<= |ULTIMATE.start_main_~y~0#1| 2147483646) (not (< 0 |ULTIMATE.start_main_~x~0#1|)))} assume !!(main_~x~0#1 > 0); {1589#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} is VALID [2022-02-21 03:04:49,908 INFO L290 TraceCheckUtils]: 71: Hoare triple {1603#(or (<= |ULTIMATE.start_main_~y~0#1| 2147483645) (not (< 0 |ULTIMATE.start_main_~x~0#1|)))} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1599#(or (<= |ULTIMATE.start_main_~y~0#1| 2147483646) (not (< 0 |ULTIMATE.start_main_~x~0#1|)))} is VALID [2022-02-21 03:04:49,912 INFO L290 TraceCheckUtils]: 70: Hoare triple {1603#(or (<= |ULTIMATE.start_main_~y~0#1| 2147483645) (not (< 0 |ULTIMATE.start_main_~x~0#1|)))} assume 1 + main_~y~0#1 <= 2147483647; {1603#(or (<= |ULTIMATE.start_main_~y~0#1| 2147483645) (not (< 0 |ULTIMATE.start_main_~x~0#1|)))} is VALID [2022-02-21 03:04:49,913 INFO L290 TraceCheckUtils]: 69: Hoare triple {1610#(or (<= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 2147483645))} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {1603#(or (<= |ULTIMATE.start_main_~y~0#1| 2147483645) (not (< 0 |ULTIMATE.start_main_~x~0#1|)))} is VALID [2022-02-21 03:04:49,914 INFO L290 TraceCheckUtils]: 68: Hoare triple {1610#(or (<= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 2147483645))} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1610#(or (<= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 2147483645))} is VALID [2022-02-21 03:04:49,914 INFO L290 TraceCheckUtils]: 67: Hoare triple {1610#(or (<= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 2147483645))} assume !!(main_~x~0#1 > 0); {1610#(or (<= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 2147483645))} is VALID [2022-02-21 03:04:49,915 INFO L290 TraceCheckUtils]: 66: Hoare triple {1620#(or (<= |ULTIMATE.start_main_~x~0#1| 2147483646) (<= |ULTIMATE.start_main_~y~0#1| 2147483644))} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1610#(or (<= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 2147483645))} is VALID [2022-02-21 03:04:49,915 INFO L290 TraceCheckUtils]: 65: Hoare triple {1620#(or (<= |ULTIMATE.start_main_~x~0#1| 2147483646) (<= |ULTIMATE.start_main_~y~0#1| 2147483644))} assume 1 + main_~y~0#1 <= 2147483647; {1620#(or (<= |ULTIMATE.start_main_~x~0#1| 2147483646) (<= |ULTIMATE.start_main_~y~0#1| 2147483644))} is VALID [2022-02-21 03:04:49,916 INFO L290 TraceCheckUtils]: 64: Hoare triple {1627#(<= |ULTIMATE.start_main_~x~0#1| 4294967291)} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {1620#(or (<= |ULTIMATE.start_main_~x~0#1| 2147483646) (<= |ULTIMATE.start_main_~y~0#1| 2147483644))} is VALID [2022-02-21 03:04:49,916 INFO L290 TraceCheckUtils]: 63: Hoare triple {1627#(<= |ULTIMATE.start_main_~x~0#1| 4294967291)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1627#(<= |ULTIMATE.start_main_~x~0#1| 4294967291)} is VALID [2022-02-21 03:04:49,916 INFO L290 TraceCheckUtils]: 62: Hoare triple {1627#(<= |ULTIMATE.start_main_~x~0#1| 4294967291)} assume !!(main_~x~0#1 > 0); {1627#(<= |ULTIMATE.start_main_~x~0#1| 4294967291)} is VALID [2022-02-21 03:04:49,917 INFO L290 TraceCheckUtils]: 61: Hoare triple {1627#(<= |ULTIMATE.start_main_~x~0#1| 4294967291)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1627#(<= |ULTIMATE.start_main_~x~0#1| 4294967291)} is VALID [2022-02-21 03:04:49,917 INFO L290 TraceCheckUtils]: 60: Hoare triple {1627#(<= |ULTIMATE.start_main_~x~0#1| 4294967291)} assume 1 + main_~y~0#1 <= 2147483647; {1627#(<= |ULTIMATE.start_main_~x~0#1| 4294967291)} is VALID [2022-02-21 03:04:49,918 INFO L290 TraceCheckUtils]: 59: Hoare triple {1643#(<= |ULTIMATE.start_main_~x~0#1| (+ 4294967291 |ULTIMATE.start_main_~y~0#1|))} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {1627#(<= |ULTIMATE.start_main_~x~0#1| 4294967291)} is VALID [2022-02-21 03:04:49,918 INFO L290 TraceCheckUtils]: 58: Hoare triple {1337#true} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1643#(<= |ULTIMATE.start_main_~x~0#1| (+ 4294967291 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:04:49,918 INFO L290 TraceCheckUtils]: 57: Hoare triple {1337#true} assume !!(main_~x~0#1 > 0); {1337#true} is VALID [2022-02-21 03:04:49,918 INFO L290 TraceCheckUtils]: 56: Hoare triple {1337#true} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1337#true} is VALID [2022-02-21 03:04:49,919 INFO L290 TraceCheckUtils]: 55: Hoare triple {1337#true} assume 1 + main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:04:49,919 INFO L290 TraceCheckUtils]: 54: Hoare triple {1337#true} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {1337#true} is VALID [2022-02-21 03:04:49,919 INFO L290 TraceCheckUtils]: 53: Hoare triple {1337#true} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:04:49,919 INFO L290 TraceCheckUtils]: 52: Hoare triple {1337#true} assume !!(main_~x~0#1 > 0); {1337#true} is VALID [2022-02-21 03:04:49,919 INFO L290 TraceCheckUtils]: 51: Hoare triple {1337#true} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1337#true} is VALID [2022-02-21 03:04:49,919 INFO L290 TraceCheckUtils]: 50: Hoare triple {1337#true} assume 1 + main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:04:49,920 INFO L290 TraceCheckUtils]: 49: Hoare triple {1337#true} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {1337#true} is VALID [2022-02-21 03:04:49,920 INFO L290 TraceCheckUtils]: 48: Hoare triple {1337#true} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:04:49,920 INFO L290 TraceCheckUtils]: 47: Hoare triple {1337#true} assume !!(main_~x~0#1 > 0); {1337#true} is VALID [2022-02-21 03:04:49,920 INFO L290 TraceCheckUtils]: 46: Hoare triple {1337#true} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1337#true} is VALID [2022-02-21 03:04:49,920 INFO L290 TraceCheckUtils]: 45: Hoare triple {1337#true} assume 1 + main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:04:49,920 INFO L290 TraceCheckUtils]: 44: Hoare triple {1337#true} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {1337#true} is VALID [2022-02-21 03:04:49,920 INFO L290 TraceCheckUtils]: 43: Hoare triple {1337#true} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:04:49,921 INFO L290 TraceCheckUtils]: 42: Hoare triple {1337#true} assume !!(main_~x~0#1 > 0); {1337#true} is VALID [2022-02-21 03:04:49,921 INFO L290 TraceCheckUtils]: 41: Hoare triple {1337#true} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1337#true} is VALID [2022-02-21 03:04:49,921 INFO L290 TraceCheckUtils]: 40: Hoare triple {1337#true} assume 1 + main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:04:49,921 INFO L290 TraceCheckUtils]: 39: Hoare triple {1337#true} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {1337#true} is VALID [2022-02-21 03:04:49,921 INFO L290 TraceCheckUtils]: 38: Hoare triple {1337#true} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:04:49,921 INFO L290 TraceCheckUtils]: 37: Hoare triple {1337#true} assume !!(main_~x~0#1 > 0); {1337#true} is VALID [2022-02-21 03:04:49,921 INFO L290 TraceCheckUtils]: 36: Hoare triple {1337#true} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1337#true} is VALID [2022-02-21 03:04:49,922 INFO L290 TraceCheckUtils]: 35: Hoare triple {1337#true} assume 1 + main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:04:49,922 INFO L290 TraceCheckUtils]: 34: Hoare triple {1337#true} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {1337#true} is VALID [2022-02-21 03:04:49,922 INFO L290 TraceCheckUtils]: 33: Hoare triple {1337#true} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:04:49,922 INFO L290 TraceCheckUtils]: 32: Hoare triple {1337#true} assume !!(main_~x~0#1 > 0); {1337#true} is VALID [2022-02-21 03:04:49,922 INFO L290 TraceCheckUtils]: 31: Hoare triple {1337#true} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1337#true} is VALID [2022-02-21 03:04:49,922 INFO L290 TraceCheckUtils]: 30: Hoare triple {1337#true} assume 1 + main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:04:49,922 INFO L290 TraceCheckUtils]: 29: Hoare triple {1337#true} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {1337#true} is VALID [2022-02-21 03:04:49,923 INFO L290 TraceCheckUtils]: 28: Hoare triple {1337#true} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:04:49,923 INFO L290 TraceCheckUtils]: 27: Hoare triple {1337#true} assume !!(main_~x~0#1 > 0); {1337#true} is VALID [2022-02-21 03:04:49,923 INFO L290 TraceCheckUtils]: 26: Hoare triple {1337#true} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1337#true} is VALID [2022-02-21 03:04:49,924 INFO L290 TraceCheckUtils]: 25: Hoare triple {1337#true} assume 1 + main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:04:49,924 INFO L290 TraceCheckUtils]: 24: Hoare triple {1337#true} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {1337#true} is VALID [2022-02-21 03:04:49,924 INFO L290 TraceCheckUtils]: 23: Hoare triple {1337#true} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:04:49,924 INFO L290 TraceCheckUtils]: 22: Hoare triple {1337#true} assume !!(main_~x~0#1 > 0); {1337#true} is VALID [2022-02-21 03:04:49,924 INFO L290 TraceCheckUtils]: 21: Hoare triple {1337#true} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1337#true} is VALID [2022-02-21 03:04:49,924 INFO L290 TraceCheckUtils]: 20: Hoare triple {1337#true} assume 1 + main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:04:49,924 INFO L290 TraceCheckUtils]: 19: Hoare triple {1337#true} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {1337#true} is VALID [2022-02-21 03:04:49,924 INFO L290 TraceCheckUtils]: 18: Hoare triple {1337#true} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:04:49,925 INFO L290 TraceCheckUtils]: 17: Hoare triple {1337#true} assume !!(main_~x~0#1 > 0); {1337#true} is VALID [2022-02-21 03:04:49,925 INFO L290 TraceCheckUtils]: 16: Hoare triple {1337#true} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1337#true} is VALID [2022-02-21 03:04:49,925 INFO L290 TraceCheckUtils]: 15: Hoare triple {1337#true} assume 1 + main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:04:49,925 INFO L290 TraceCheckUtils]: 14: Hoare triple {1337#true} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {1337#true} is VALID [2022-02-21 03:04:49,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {1337#true} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:04:49,926 INFO L290 TraceCheckUtils]: 12: Hoare triple {1337#true} assume !!(main_~x~0#1 > 0); {1337#true} is VALID [2022-02-21 03:04:49,926 INFO L290 TraceCheckUtils]: 11: Hoare triple {1337#true} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1337#true} is VALID [2022-02-21 03:04:49,926 INFO L290 TraceCheckUtils]: 10: Hoare triple {1337#true} assume 1 + main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:04:49,926 INFO L290 TraceCheckUtils]: 9: Hoare triple {1337#true} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {1337#true} is VALID [2022-02-21 03:04:49,926 INFO L290 TraceCheckUtils]: 8: Hoare triple {1337#true} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:04:49,926 INFO L290 TraceCheckUtils]: 7: Hoare triple {1337#true} assume !!(main_~x~0#1 > 0); {1337#true} is VALID [2022-02-21 03:04:49,926 INFO L290 TraceCheckUtils]: 6: Hoare triple {1337#true} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1337#true} is VALID [2022-02-21 03:04:49,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {1337#true} assume 1 + main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:04:49,927 INFO L290 TraceCheckUtils]: 4: Hoare triple {1337#true} assume main_~x~0#1 - main_~y~0#1 >= -2147483648;main_~x~0#1 := main_~x~0#1 - main_~y~0#1; {1337#true} is VALID [2022-02-21 03:04:49,927 INFO L290 TraceCheckUtils]: 3: Hoare triple {1337#true} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:04:49,927 INFO L290 TraceCheckUtils]: 2: Hoare triple {1337#true} assume !!(main_~x~0#1 > 0); {1337#true} is VALID [2022-02-21 03:04:49,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {1337#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := 1; {1337#true} is VALID [2022-02-21 03:04:49,927 INFO L290 TraceCheckUtils]: 0: Hoare triple {1337#true} assume { :begin_inline_ULTIMATE.init } true; {1337#true} is VALID [2022-02-21 03:04:49,929 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 193 proven. 21 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2022-02-21 03:04:49,930 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288062976] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:04:49,930 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:04:49,930 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8, 8] total 30 [2022-02-21 03:04:49,930 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921827372] [2022-02-21 03:04:49,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:04:49,932 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.933333333333333) internal successors, (118), 31 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2022-02-21 03:04:49,933 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:49,934 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 31 states, 30 states have (on average 3.933333333333333) internal successors, (118), 31 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:50,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:50,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-02-21 03:04:50,018 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:50,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-02-21 03:04:50,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=650, Unknown=0, NotChecked=0, Total=930 [2022-02-21 03:04:50,020 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand has 31 states, 30 states have (on average 3.933333333333333) internal successors, (118), 31 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:52,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:52,117 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2022-02-21 03:04:52,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-02-21 03:04:52,117 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.933333333333333) internal successors, (118), 31 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2022-02-21 03:04:52,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:52,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 3.933333333333333) internal successors, (118), 31 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:52,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 85 transitions. [2022-02-21 03:04:52,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 3.933333333333333) internal successors, (118), 31 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:52,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 85 transitions. [2022-02-21 03:04:52,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states and 85 transitions. [2022-02-21 03:04:52,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:52,198 INFO L225 Difference]: With dead ends: 84 [2022-02-21 03:04:52,198 INFO L226 Difference]: Without dead ends: 0 [2022-02-21 03:04:52,201 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1484 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1926, Invalid=4236, Unknown=0, NotChecked=0, Total=6162 [2022-02-21 03:04:52,202 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 166 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:52,202 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 10 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-21 03:04:52,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-21 03:04:52,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-21 03:04:52,203 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:52,203 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:52,203 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:52,203 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:52,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:52,203 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 03:04:52,204 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:04:52,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:52,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:52,204 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-21 03:04:52,204 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-21 03:04:52,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:52,204 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 03:04:52,204 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:04:52,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:52,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:52,205 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:52,205 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:52,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:52,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 03:04:52,205 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 76 [2022-02-21 03:04:52,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:52,206 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:04:52,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.933333333333333) internal successors, (118), 31 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:52,206 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:04:52,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:52,209 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2022-02-21 03:04:52,209 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2022-02-21 03:04:52,209 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2022-02-21 03:04:52,209 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2022-02-21 03:04:52,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:04:52,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:04:52,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-21 03:04:52,630 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 19) no Hoare annotation was computed. [2022-02-21 03:04:52,631 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-21 03:04:52,631 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2022-02-21 03:04:52,631 INFO L858 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-02-21 03:04:52,631 INFO L858 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2022-02-21 03:04:52,631 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-21 03:04:52,631 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 19) no Hoare annotation was computed. [2022-02-21 03:04:52,631 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2022-02-21 03:04:52,631 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-21 03:04:52,632 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-21 03:04:52,632 INFO L861 garLoopResultBuilder]: At program point L22(lines 14 23) the Hoare annotation is: true [2022-02-21 03:04:52,632 INFO L858 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2022-02-21 03:04:52,632 INFO L858 garLoopResultBuilder]: For program point L20-1(line 20) no Hoare annotation was computed. [2022-02-21 03:04:52,632 INFO L854 garLoopResultBuilder]: At program point L18-2(lines 18 21) the Hoare annotation is: (or (and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~y~0#1| 2147483646))) (and (<= |ULTIMATE.start_main_~y~0#1| 2147483646) (<= |ULTIMATE.start_main_~y~0#1| (+ (div (+ (* (- 1) |ULTIMATE.start_main_~x~0#1|) 2147483648) 2) 1)) (<= 2 |ULTIMATE.start_main_~y~0#1|))) [2022-02-21 03:04:52,632 INFO L858 garLoopResultBuilder]: For program point L18-3(lines 18 21) no Hoare annotation was computed. [2022-02-21 03:04:52,635 INFO L732 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2022-02-21 03:04:52,636 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-21 03:04:52,639 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-21 03:04:52,639 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-21 03:04:52,639 WARN L170 areAnnotationChecker]: L18-3 has no Hoare annotation [2022-02-21 03:04:52,639 WARN L170 areAnnotationChecker]: L18-3 has no Hoare annotation [2022-02-21 03:04:52,639 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-02-21 03:04:52,639 WARN L170 areAnnotationChecker]: L18-3 has no Hoare annotation [2022-02-21 03:04:52,640 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-02-21 03:04:52,640 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-02-21 03:04:52,640 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-21 03:04:52,640 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2022-02-21 03:04:52,640 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2022-02-21 03:04:52,640 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-21 03:04:52,640 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-02-21 03:04:52,640 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-02-21 03:04:52,640 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2022-02-21 03:04:52,640 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2022-02-21 03:04:52,641 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-21 03:04:52,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.02 03:04:52 BoogieIcfgContainer [2022-02-21 03:04:52,649 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-21 03:04:52,649 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:04:52,649 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:04:52,650 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:04:52,650 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:04:28" (3/4) ... [2022-02-21 03:04:52,652 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-21 03:04:52,660 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-21 03:04:52,661 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-02-21 03:04:52,661 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-21 03:04:52,692 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 03:04:52,692 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:04:52,693 INFO L158 Benchmark]: Toolchain (without parser) took 24277.31ms. Allocated memory was 86.0MB in the beginning and 138.4MB in the end (delta: 52.4MB). Free memory was 51.6MB in the beginning and 113.6MB in the end (delta: -62.0MB). Peak memory consumption was 66.5MB. Max. memory is 16.1GB. [2022-02-21 03:04:52,693 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 86.0MB. Free memory was 59.2MB in the beginning and 59.1MB in the end (delta: 23.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:04:52,694 INFO L158 Benchmark]: CACSL2BoogieTranslator took 174.51ms. Allocated memory was 86.0MB in the beginning and 115.3MB in the end (delta: 29.4MB). Free memory was 51.4MB in the beginning and 92.2MB in the end (delta: -40.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:04:52,694 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.29ms. Allocated memory is still 115.3MB. Free memory was 92.2MB in the beginning and 91.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:04:52,694 INFO L158 Benchmark]: Boogie Preprocessor took 15.34ms. Allocated memory is still 115.3MB. Free memory was 91.0MB in the beginning and 90.1MB in the end (delta: 831.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:04:52,695 INFO L158 Benchmark]: RCFGBuilder took 218.69ms. Allocated memory is still 115.3MB. Free memory was 90.1MB in the beginning and 80.5MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:04:52,695 INFO L158 Benchmark]: TraceAbstraction took 23792.17ms. Allocated memory was 115.3MB in the beginning and 138.4MB in the end (delta: 23.1MB). Free memory was 80.2MB in the beginning and 40.3MB in the end (delta: 39.9MB). Peak memory consumption was 66.1MB. Max. memory is 16.1GB. [2022-02-21 03:04:52,695 INFO L158 Benchmark]: Witness Printer took 42.75ms. Allocated memory is still 138.4MB. Free memory was 40.3MB in the beginning and 114.6MB in the end (delta: -74.3MB). Peak memory consumption was 3.3MB. Max. memory is 16.1GB. [2022-02-21 03:04:52,697 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 86.0MB. Free memory was 59.2MB in the beginning and 59.1MB in the end (delta: 23.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 174.51ms. Allocated memory was 86.0MB in the beginning and 115.3MB in the end (delta: 29.4MB). Free memory was 51.4MB in the beginning and 92.2MB in the end (delta: -40.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.29ms. Allocated memory is still 115.3MB. Free memory was 92.2MB in the beginning and 91.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 15.34ms. Allocated memory is still 115.3MB. Free memory was 91.0MB in the beginning and 90.1MB in the end (delta: 831.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 218.69ms. Allocated memory is still 115.3MB. Free memory was 90.1MB in the beginning and 80.5MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 23792.17ms. Allocated memory was 115.3MB in the beginning and 138.4MB in the end (delta: 23.1MB). Free memory was 80.2MB in the beginning and 40.3MB in the end (delta: 39.9MB). Peak memory consumption was 66.1MB. Max. memory is 16.1GB. * Witness Printer took 42.75ms. Allocated memory is still 138.4MB. Free memory was 40.3MB in the beginning and 114.6MB in the end (delta: -74.3MB). Peak memory consumption was 3.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 19]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 15 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 23.7s, OverallIterations: 8, TraceHistogramMax: 15, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 232 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 232 mSDsluCounter, 82 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 48 mSDsCounter, 177 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 289 IncrementalHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 177 mSolverCounterUnsat, 34 mSDtfsCounter, 289 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 374 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1512 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=7, InterpolantAutomatonStates: 102, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 9 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 20 NumberOfFragments, 32 HoareAnnotationTreeSize, 2 FomulaSimplifications, 131 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 2 FomulaSimplificationsInter, 595 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 18.0s InterpolantComputationTime, 310 NumberOfCodeBlocks, 260 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 431 ConstructedInterpolants, 0 QuantifiedInterpolants, 1168 SizeOfPredicates, 3 NumberOfNonLiveVariables, 184 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 17 InterpolantComputations, 4 PerfectInterpolantSequences, 982/1882 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: ((1 <= y && y <= 1) && x <= y + 2147483646) || ((y <= 2147483646 && y <= (-1 * x + 2147483648) / 2 + 1) && 2 <= y) RESULT: Ultimate proved your program to be correct! [2022-02-21 03:04:52,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE