./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/HeizmannHoenickeLeikePodelski-ATVA2013-Fig1.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/HeizmannHoenickeLeikePodelski-ATVA2013-Fig1.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 033772d605bbfacd7bdbacf0756e3bc9cfb2f8cbffe91002f61ae4b41e344064 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:05:24,152 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:05:24,154 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:05:24,186 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:05:24,187 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:05:24,188 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:05:24,189 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:05:24,191 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:05:24,193 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:05:24,196 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:05:24,196 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:05:24,197 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:05:24,197 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:05:24,199 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:05:24,200 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:05:24,202 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:05:24,203 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:05:24,203 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:05:24,205 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:05:24,209 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:05:24,209 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:05:24,210 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:05:24,211 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:05:24,212 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:05:24,216 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:05:24,217 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:05:24,217 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:05:24,218 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:05:24,218 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:05:24,219 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:05:24,219 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:05:24,220 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:05:24,221 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:05:24,221 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:05:24,222 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:05:24,222 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:05:24,223 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:05:24,223 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:05:24,223 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:05:24,224 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:05:24,224 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:05:24,225 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:05:24,246 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:05:24,247 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:05:24,247 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:05:24,247 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:05:24,248 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:05:24,248 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:05:24,248 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:05:24,249 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:05:24,249 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:05:24,249 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:05:24,250 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:05:24,250 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:05:24,250 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:05:24,250 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:05:24,250 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:05:24,250 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:05:24,250 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:05:24,250 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:05:24,251 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:05:24,251 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:05:24,251 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:05:24,251 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:05:24,251 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:05:24,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:05:24,251 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:05:24,252 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:05:24,252 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:05:24,252 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:05:24,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:05:24,252 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:05:24,252 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 -> 033772d605bbfacd7bdbacf0756e3bc9cfb2f8cbffe91002f61ae4b41e344064 [2022-02-21 03:05:24,446 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:05:24,463 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:05:24,465 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:05:24,466 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:05:24,466 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:05:24,467 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/HeizmannHoenickeLeikePodelski-ATVA2013-Fig1.c [2022-02-21 03:05:24,521 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02b09a9ad/35abd4af870b426e8bad24d2c3070181/FLAG6d1e7d62e [2022-02-21 03:05:24,826 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:05:24,827 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/HeizmannHoenickeLeikePodelski-ATVA2013-Fig1.c [2022-02-21 03:05:24,834 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02b09a9ad/35abd4af870b426e8bad24d2c3070181/FLAG6d1e7d62e [2022-02-21 03:05:25,261 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02b09a9ad/35abd4af870b426e8bad24d2c3070181 [2022-02-21 03:05:25,263 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:05:25,264 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:05:25,267 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:05:25,267 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:05:25,269 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:05:25,270 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:05:25" (1/1) ... [2022-02-21 03:05:25,271 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13114c09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:25, skipping insertion in model container [2022-02-21 03:05:25,271 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:05:25" (1/1) ... [2022-02-21 03:05:25,277 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:05:25,286 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:05:25,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:05:25,426 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:05:25,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:05:25,455 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:05:25,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:25 WrapperNode [2022-02-21 03:05:25,457 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:05:25,458 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:05:25,458 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:05:25,458 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:05:25,464 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:05:25" (1/1) ... [2022-02-21 03:05:25,467 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:05:25" (1/1) ... [2022-02-21 03:05:25,482 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2022-02-21 03:05:25,482 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:05:25,483 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:05:25,483 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:05:25,483 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:05:25,488 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:25" (1/1) ... [2022-02-21 03:05:25,488 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:25" (1/1) ... [2022-02-21 03:05:25,489 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:25" (1/1) ... [2022-02-21 03:05:25,489 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:25" (1/1) ... [2022-02-21 03:05:25,491 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:25" (1/1) ... [2022-02-21 03:05:25,494 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:25" (1/1) ... [2022-02-21 03:05:25,495 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:25" (1/1) ... [2022-02-21 03:05:25,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:05:25,496 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:05:25,496 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:05:25,497 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:05:25,497 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:25" (1/1) ... [2022-02-21 03:05:25,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:05:25,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:05:25,535 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:05:25,553 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:05:25,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:05:25,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:05:25,608 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:05:25,610 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:05:25,773 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:05:25,779 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:05:25,780 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:05:25,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:05:25 BoogieIcfgContainer [2022-02-21 03:05:25,781 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:05:25,782 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:05:25,782 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:05:25,785 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:05:25,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:05:25" (1/3) ... [2022-02-21 03:05:25,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b69a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:05:25, skipping insertion in model container [2022-02-21 03:05:25,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:05:25" (2/3) ... [2022-02-21 03:05:25,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b69a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:05:25, skipping insertion in model container [2022-02-21 03:05:25,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:05:25" (3/3) ... [2022-02-21 03:05:25,787 INFO L111 eAbstractionObserver]: Analyzing ICFG HeizmannHoenickeLeikePodelski-ATVA2013-Fig1.c [2022-02-21 03:05:25,791 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:05:25,791 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-02-21 03:05:25,826 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:05:25,831 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:05:25,831 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-02-21 03:05:25,850 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:05:25,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-21 03:05:25,853 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:25,853 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-21 03:05:25,854 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:05:25,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:25,861 INFO L85 PathProgramCache]: Analyzing trace with hash 925796, now seen corresponding path program 1 times [2022-02-21 03:05:25,868 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:25,869 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293182558] [2022-02-21 03:05:25,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:25,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:25,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:25,997 INFO L290 TraceCheckUtils]: 0: Hoare triple {18#true} assume { :begin_inline_ULTIMATE.init } true; {18#true} is VALID [2022-02-21 03:05:26,002 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 := 23; {20#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483624 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:26,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {20#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483624 |ULTIMATE.start_main_~y~0#1|))} assume !!(main_~x~0#1 >= 0); {20#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483624 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:26,005 INFO L290 TraceCheckUtils]: 3: Hoare triple {20#(<= |ULTIMATE.start_main_~x~0#1| (+ 2147483624 |ULTIMATE.start_main_~y~0#1|))} assume !(main_~x~0#1 - main_~y~0#1 <= 2147483647); {19#false} is VALID [2022-02-21 03:05:26,006 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:05:26,006 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:26,007 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293182558] [2022-02-21 03:05:26,007 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293182558] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:05:26,007 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:05:26,008 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:05:26,010 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013485593] [2022-02-21 03:05:26,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:05:26,015 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:05:26,016 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:26,018 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:05:26,025 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:05:26,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:05:26,026 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:26,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:05:26,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:05:26,046 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:05:26,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:26,105 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-02-21 03:05:26,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:05:26,105 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:05:26,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:05:26,106 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:05:26,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-02-21 03:05:26,114 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:05:26,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-02-21 03:05:26,117 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 29 transitions. [2022-02-21 03:05:26,150 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:05:26,161 INFO L225 Difference]: With dead ends: 27 [2022-02-21 03:05:26,161 INFO L226 Difference]: Without dead ends: 14 [2022-02-21 03:05:26,163 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:05:26,170 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:05:26,171 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:05:26,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-02-21 03:05:26,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2022-02-21 03:05:26,194 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:05:26,195 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:05:26,195 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:05:26,196 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:05:26,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:26,202 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-02-21 03:05:26,202 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-02-21 03:05:26,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:26,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:26,203 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:05:26,203 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:05:26,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:26,205 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-02-21 03:05:26,205 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-02-21 03:05:26,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:26,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:26,206 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:05:26,206 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:05:26,207 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:05:26,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-02-21 03:05:26,215 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 4 [2022-02-21 03:05:26,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:26,216 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-02-21 03:05:26,216 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:05:26,217 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-02-21 03:05:26,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-21 03:05:26,217 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:26,217 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-21 03:05:26,218 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:05:26,218 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:05:26,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:26,222 INFO L85 PathProgramCache]: Analyzing trace with hash 28699721, now seen corresponding path program 1 times [2022-02-21 03:05:26,222 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:26,223 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244990675] [2022-02-21 03:05:26,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:26,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:26,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:26,286 INFO L290 TraceCheckUtils]: 0: Hoare triple {98#true} assume { :begin_inline_ULTIMATE.init } true; {98#true} is VALID [2022-02-21 03:05:26,287 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 := 23; {100#(<= |ULTIMATE.start_main_~y~0#1| 23)} is VALID [2022-02-21 03:05:26,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {100#(<= |ULTIMATE.start_main_~y~0#1| 23)} assume !!(main_~x~0#1 >= 0); {101#(<= |ULTIMATE.start_main_~y~0#1| (+ 23 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:05:26,288 INFO L290 TraceCheckUtils]: 3: Hoare triple {101#(<= |ULTIMATE.start_main_~y~0#1| (+ 23 |ULTIMATE.start_main_~x~0#1|))} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {101#(<= |ULTIMATE.start_main_~y~0#1| (+ 23 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:05:26,289 INFO L290 TraceCheckUtils]: 4: Hoare triple {101#(<= |ULTIMATE.start_main_~y~0#1| (+ 23 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 - main_~y~0#1 >= -2147483648); {99#false} is VALID [2022-02-21 03:05:26,289 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:05:26,289 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:26,290 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244990675] [2022-02-21 03:05:26,290 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244990675] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:05:26,290 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:05:26,290 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:05:26,290 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625593746] [2022-02-21 03:05:26,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:05:26,291 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:05:26,292 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:26,292 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:05:26,298 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:05:26,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:05:26,298 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:26,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:05:26,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:05:26,300 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:05:26,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:26,368 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-02-21 03:05:26,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:05:26,369 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:05:26,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:05:26,370 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:05:26,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-02-21 03:05:26,371 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:05:26,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-02-21 03:05:26,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2022-02-21 03:05:26,393 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:05:26,396 INFO L225 Difference]: With dead ends: 18 [2022-02-21 03:05:26,396 INFO L226 Difference]: Without dead ends: 16 [2022-02-21 03:05:26,396 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:05:26,401 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:05:26,402 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:05:26,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-02-21 03:05:26,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-02-21 03:05:26,407 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:05:26,408 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:05:26,408 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:05:26,409 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:05:26,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:26,410 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-02-21 03:05:26,410 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-02-21 03:05:26,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:26,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:26,411 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:05:26,411 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:05:26,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:26,412 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-02-21 03:05:26,413 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-02-21 03:05:26,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:26,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:26,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:05:26,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:05:26,414 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:05:26,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-02-21 03:05:26,415 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 5 [2022-02-21 03:05:26,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:26,415 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-02-21 03:05:26,415 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:05:26,416 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-02-21 03:05:26,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-21 03:05:26,417 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:26,417 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:05:26,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 03:05:26,417 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:05:26,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:26,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1810629611, now seen corresponding path program 1 times [2022-02-21 03:05:26,418 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:26,418 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162617098] [2022-02-21 03:05:26,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:26,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:26,468 INFO L290 TraceCheckUtils]: 0: Hoare triple {175#true} assume { :begin_inline_ULTIMATE.init } true; {175#true} is VALID [2022-02-21 03:05:26,469 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 := 23; {177#(<= 23 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:05:26,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {177#(<= 23 |ULTIMATE.start_main_~y~0#1|)} assume !!(main_~x~0#1 >= 0); {177#(<= 23 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:05:26,484 INFO L290 TraceCheckUtils]: 3: Hoare triple {177#(<= 23 |ULTIMATE.start_main_~y~0#1|)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {177#(<= 23 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:05:26,485 INFO L290 TraceCheckUtils]: 4: Hoare triple {177#(<= 23 |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#(<= 23 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:05:26,485 INFO L290 TraceCheckUtils]: 5: Hoare triple {177#(<= 23 |ULTIMATE.start_main_~y~0#1|)} assume 1 + main_~y~0#1 <= 2147483647; {177#(<= 23 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:05:26,486 INFO L290 TraceCheckUtils]: 6: Hoare triple {177#(<= 23 |ULTIMATE.start_main_~y~0#1|)} assume !(1 + main_~y~0#1 >= -2147483648); {176#false} is VALID [2022-02-21 03:05:26,486 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:05:26,486 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:26,486 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162617098] [2022-02-21 03:05:26,486 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162617098] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:05:26,486 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:05:26,486 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:05:26,486 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053137800] [2022-02-21 03:05:26,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:05:26,487 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:05:26,487 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:26,487 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:05:26,492 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:05:26,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:05:26,493 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:26,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:05:26,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:05:26,494 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:05:26,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:26,512 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-02-21 03:05:26,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:05:26,512 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:05:26,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:05:26,513 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:05:26,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2022-02-21 03:05:26,514 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:05:26,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2022-02-21 03:05:26,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 11 transitions. [2022-02-21 03:05:26,523 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:05:26,524 INFO L225 Difference]: With dead ends: 15 [2022-02-21 03:05:26,525 INFO L226 Difference]: Without dead ends: 14 [2022-02-21 03:05:26,525 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:05:26,526 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:05:26,531 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:05:26,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-02-21 03:05:26,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-02-21 03:05:26,535 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:05:26,535 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:05:26,536 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:05:26,536 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:05:26,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:26,536 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-02-21 03:05:26,537 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-02-21 03:05:26,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:26,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:26,537 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:05:26,537 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:05:26,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:26,538 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-02-21 03:05:26,538 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-02-21 03:05:26,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:26,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:26,538 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:05:26,538 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:05:26,538 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:05:26,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-02-21 03:05:26,539 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 7 [2022-02-21 03:05:26,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:26,539 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-02-21 03:05:26,539 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:05:26,539 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-02-21 03:05:26,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-21 03:05:26,540 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:26,540 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:05:26,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 03:05:26,540 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:05:26,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:26,541 INFO L85 PathProgramCache]: Analyzing trace with hash 553302605, now seen corresponding path program 1 times [2022-02-21 03:05:26,541 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:26,541 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971850090] [2022-02-21 03:05:26,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:26,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:26,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:26,605 INFO L290 TraceCheckUtils]: 0: Hoare triple {241#true} assume { :begin_inline_ULTIMATE.init } true; {241#true} is VALID [2022-02-21 03:05:26,606 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 := 23; {243#(<= |ULTIMATE.start_main_~x~0#1| (+ (* 2 |ULTIMATE.start_main_~y~0#1|) 2147483601))} is VALID [2022-02-21 03:05:26,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {243#(<= |ULTIMATE.start_main_~x~0#1| (+ (* 2 |ULTIMATE.start_main_~y~0#1|) 2147483601))} assume !!(main_~x~0#1 >= 0); {243#(<= |ULTIMATE.start_main_~x~0#1| (+ (* 2 |ULTIMATE.start_main_~y~0#1|) 2147483601))} is VALID [2022-02-21 03:05:26,607 INFO L290 TraceCheckUtils]: 3: Hoare triple {243#(<= |ULTIMATE.start_main_~x~0#1| (+ (* 2 |ULTIMATE.start_main_~y~0#1|) 2147483601))} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {243#(<= |ULTIMATE.start_main_~x~0#1| (+ (* 2 |ULTIMATE.start_main_~y~0#1|) 2147483601))} is VALID [2022-02-21 03:05:26,607 INFO L290 TraceCheckUtils]: 4: Hoare triple {243#(<= |ULTIMATE.start_main_~x~0#1| (+ (* 2 |ULTIMATE.start_main_~y~0#1|) 2147483601))} 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| (+ |ULTIMATE.start_main_~y~0#1| 2147483601))} is VALID [2022-02-21 03:05:26,608 INFO L290 TraceCheckUtils]: 5: Hoare triple {244#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~y~0#1| 2147483601))} assume 1 + main_~y~0#1 <= 2147483647; {244#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~y~0#1| 2147483601))} is VALID [2022-02-21 03:05:26,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {244#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~y~0#1| 2147483601))} 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| 2147483600))} is VALID [2022-02-21 03:05:26,609 INFO L290 TraceCheckUtils]: 7: Hoare triple {245#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~y~0#1| 2147483600))} assume !!(main_~x~0#1 >= 0); {245#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~y~0#1| 2147483600))} is VALID [2022-02-21 03:05:26,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {245#(<= |ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~y~0#1| 2147483600))} assume !(main_~x~0#1 - main_~y~0#1 <= 2147483647); {242#false} is VALID [2022-02-21 03:05:26,610 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:05:26,610 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:26,610 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971850090] [2022-02-21 03:05:26,610 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971850090] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:05:26,611 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963920616] [2022-02-21 03:05:26,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:26,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:05:26,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:05:26,635 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:05:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:26,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:05:26,667 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:05:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:26,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:05:26,835 INFO L290 TraceCheckUtils]: 0: Hoare triple {241#true} assume { :begin_inline_ULTIMATE.init } true; {241#true} is VALID [2022-02-21 03:05:26,836 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 := 23; {252#(and (<= 23 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2147483647))} is VALID [2022-02-21 03:05:26,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {252#(and (<= 23 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2147483647))} assume !!(main_~x~0#1 >= 0); {252#(and (<= 23 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2147483647))} is VALID [2022-02-21 03:05:26,837 INFO L290 TraceCheckUtils]: 3: Hoare triple {252#(and (<= 23 |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 (<= 23 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 2147483647))} is VALID [2022-02-21 03:05:26,837 INFO L290 TraceCheckUtils]: 4: Hoare triple {252#(and (<= 23 |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 (<= 23 |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:05:26,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {262#(and (<= 23 |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 (<= 23 |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:05:26,838 INFO L290 TraceCheckUtils]: 6: Hoare triple {262#(and (<= 23 |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 (<= |ULTIMATE.start_main_~x~0#1| 2147483624) (<= 24 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:26,839 INFO L290 TraceCheckUtils]: 7: Hoare triple {269#(and (<= |ULTIMATE.start_main_~x~0#1| 2147483624) (<= 24 |ULTIMATE.start_main_~y~0#1|))} assume !!(main_~x~0#1 >= 0); {269#(and (<= |ULTIMATE.start_main_~x~0#1| 2147483624) (<= 24 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:26,839 INFO L290 TraceCheckUtils]: 8: Hoare triple {269#(and (<= |ULTIMATE.start_main_~x~0#1| 2147483624) (<= 24 |ULTIMATE.start_main_~y~0#1|))} assume !(main_~x~0#1 - main_~y~0#1 <= 2147483647); {242#false} is VALID [2022-02-21 03:05:26,840 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:05:26,840 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:05:26,840 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963920616] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:05:26,840 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:05:26,840 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2022-02-21 03:05:26,840 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656808322] [2022-02-21 03:05:26,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:05:26,842 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:05:26,842 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:26,843 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:05:26,849 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:05:26,850 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:05:26,850 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:26,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:05:26,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:05:26,852 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:05:26,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:26,912 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-02-21 03:05:26,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:05:26,912 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:05:26,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:05:26,913 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:05:26,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2022-02-21 03:05:26,913 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:05:26,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2022-02-21 03:05:26,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 15 transitions. [2022-02-21 03:05:26,925 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:05:26,925 INFO L225 Difference]: With dead ends: 15 [2022-02-21 03:05:26,925 INFO L226 Difference]: Without dead ends: 14 [2022-02-21 03:05:26,926 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-02-21 03:05:26,932 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:05:26,933 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:05:26,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-02-21 03:05:26,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2022-02-21 03:05:26,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:05:26,940 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:05:26,940 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:05:26,940 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:05:26,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:26,941 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-02-21 03:05:26,941 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-02-21 03:05:26,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:26,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:26,942 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:05:26,942 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:05:26,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:26,948 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-02-21 03:05:26,948 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-02-21 03:05:26,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:26,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:26,949 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:05:26,949 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:05:26,949 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:05:26,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-02-21 03:05:26,950 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 9 [2022-02-21 03:05:26,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:26,950 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-02-21 03:05:26,950 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:05:26,951 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-02-21 03:05:26,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-21 03:05:26,951 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:26,951 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2022-02-21 03:05:26,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:05:27,169 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:05:27,169 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:05:27,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:27,170 INFO L85 PathProgramCache]: Analyzing trace with hash -27488384, now seen corresponding path program 1 times [2022-02-21 03:05:27,170 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:27,170 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500281615] [2022-02-21 03:05:27,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:27,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:27,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:27,214 INFO L290 TraceCheckUtils]: 0: Hoare triple {337#true} assume { :begin_inline_ULTIMATE.init } true; {337#true} is VALID [2022-02-21 03:05:27,215 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 := 23; {339#(<= |ULTIMATE.start_main_~y~0#1| 23)} is VALID [2022-02-21 03:05:27,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {339#(<= |ULTIMATE.start_main_~y~0#1| 23)} assume !!(main_~x~0#1 >= 0); {339#(<= |ULTIMATE.start_main_~y~0#1| 23)} is VALID [2022-02-21 03:05:27,216 INFO L290 TraceCheckUtils]: 3: Hoare triple {339#(<= |ULTIMATE.start_main_~y~0#1| 23)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {339#(<= |ULTIMATE.start_main_~y~0#1| 23)} is VALID [2022-02-21 03:05:27,216 INFO L290 TraceCheckUtils]: 4: Hoare triple {339#(<= |ULTIMATE.start_main_~y~0#1| 23)} 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| 23)} is VALID [2022-02-21 03:05:27,217 INFO L290 TraceCheckUtils]: 5: Hoare triple {339#(<= |ULTIMATE.start_main_~y~0#1| 23)} assume 1 + main_~y~0#1 <= 2147483647; {339#(<= |ULTIMATE.start_main_~y~0#1| 23)} is VALID [2022-02-21 03:05:27,217 INFO L290 TraceCheckUtils]: 6: Hoare triple {339#(<= |ULTIMATE.start_main_~y~0#1| 23)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {340#(<= |ULTIMATE.start_main_~y~0#1| 24)} is VALID [2022-02-21 03:05:27,219 INFO L290 TraceCheckUtils]: 7: Hoare triple {340#(<= |ULTIMATE.start_main_~y~0#1| 24)} assume !!(main_~x~0#1 >= 0); {341#(<= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~x~0#1| 24))} is VALID [2022-02-21 03:05:27,219 INFO L290 TraceCheckUtils]: 8: Hoare triple {341#(<= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~x~0#1| 24))} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {341#(<= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~x~0#1| 24))} is VALID [2022-02-21 03:05:27,220 INFO L290 TraceCheckUtils]: 9: Hoare triple {341#(<= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~x~0#1| 24))} assume !(main_~x~0#1 - main_~y~0#1 >= -2147483648); {338#false} is VALID [2022-02-21 03:05:27,220 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:05:27,221 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:27,221 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500281615] [2022-02-21 03:05:27,221 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500281615] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:05:27,221 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873215417] [2022-02-21 03:05:27,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:27,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:05:27,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:05:27,226 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:05:27,228 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:05:27,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:27,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:05:27,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:27,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:05:27,319 INFO L290 TraceCheckUtils]: 0: Hoare triple {337#true} assume { :begin_inline_ULTIMATE.init } true; {337#true} is VALID [2022-02-21 03:05:27,320 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 := 23; {339#(<= |ULTIMATE.start_main_~y~0#1| 23)} is VALID [2022-02-21 03:05:27,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {339#(<= |ULTIMATE.start_main_~y~0#1| 23)} assume !!(main_~x~0#1 >= 0); {339#(<= |ULTIMATE.start_main_~y~0#1| 23)} is VALID [2022-02-21 03:05:27,321 INFO L290 TraceCheckUtils]: 3: Hoare triple {339#(<= |ULTIMATE.start_main_~y~0#1| 23)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {339#(<= |ULTIMATE.start_main_~y~0#1| 23)} is VALID [2022-02-21 03:05:27,322 INFO L290 TraceCheckUtils]: 4: Hoare triple {339#(<= |ULTIMATE.start_main_~y~0#1| 23)} 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| 23)} is VALID [2022-02-21 03:05:27,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {339#(<= |ULTIMATE.start_main_~y~0#1| 23)} assume 1 + main_~y~0#1 <= 2147483647; {339#(<= |ULTIMATE.start_main_~y~0#1| 23)} is VALID [2022-02-21 03:05:27,325 INFO L290 TraceCheckUtils]: 6: Hoare triple {339#(<= |ULTIMATE.start_main_~y~0#1| 23)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {340#(<= |ULTIMATE.start_main_~y~0#1| 24)} is VALID [2022-02-21 03:05:27,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {340#(<= |ULTIMATE.start_main_~y~0#1| 24)} assume !!(main_~x~0#1 >= 0); {366#(and (<= |ULTIMATE.start_main_~y~0#1| 24) (<= 0 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:05:27,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {366#(and (<= |ULTIMATE.start_main_~y~0#1| 24) (<= 0 |ULTIMATE.start_main_~x~0#1|))} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {366#(and (<= |ULTIMATE.start_main_~y~0#1| 24) (<= 0 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:05:27,326 INFO L290 TraceCheckUtils]: 9: Hoare triple {366#(and (<= |ULTIMATE.start_main_~y~0#1| 24) (<= 0 |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 - main_~y~0#1 >= -2147483648); {338#false} is VALID [2022-02-21 03:05:27,326 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:05:27,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:05:27,407 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:05:27,410 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:05:27,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {380#(<= |ULTIMATE.start_main_~y~0#1| 2147483648)} 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:05:27,411 INFO L290 TraceCheckUtils]: 6: Hoare triple {384#(<= |ULTIMATE.start_main_~y~0#1| 2147483647)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {380#(<= |ULTIMATE.start_main_~y~0#1| 2147483648)} is VALID [2022-02-21 03:05:27,412 INFO L290 TraceCheckUtils]: 5: Hoare triple {384#(<= |ULTIMATE.start_main_~y~0#1| 2147483647)} assume 1 + main_~y~0#1 <= 2147483647; {384#(<= |ULTIMATE.start_main_~y~0#1| 2147483647)} is VALID [2022-02-21 03:05:27,413 INFO L290 TraceCheckUtils]: 4: Hoare triple {384#(<= |ULTIMATE.start_main_~y~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; {384#(<= |ULTIMATE.start_main_~y~0#1| 2147483647)} is VALID [2022-02-21 03:05:27,414 INFO L290 TraceCheckUtils]: 3: Hoare triple {384#(<= |ULTIMATE.start_main_~y~0#1| 2147483647)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {384#(<= |ULTIMATE.start_main_~y~0#1| 2147483647)} is VALID [2022-02-21 03:05:27,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {384#(<= |ULTIMATE.start_main_~y~0#1| 2147483647)} assume !!(main_~x~0#1 >= 0); {384#(<= |ULTIMATE.start_main_~y~0#1| 2147483647)} is VALID [2022-02-21 03:05:27,415 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 := 23; {384#(<= |ULTIMATE.start_main_~y~0#1| 2147483647)} is VALID [2022-02-21 03:05:27,415 INFO L290 TraceCheckUtils]: 0: Hoare triple {337#true} assume { :begin_inline_ULTIMATE.init } true; {337#true} is VALID [2022-02-21 03:05:27,415 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:05:27,415 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873215417] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:05:27,415 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:05:27,416 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-02-21 03:05:27,416 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987720680] [2022-02-21 03:05:27,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:05:27,417 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:05:27,417 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:27,417 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:05:27,434 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:05:27,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-21 03:05:27,434 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:27,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-21 03:05:27,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-21 03:05:27,435 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:05:27,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:27,558 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-02-21 03:05:27,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 03:05:27,558 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:05:27,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:05:27,559 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:05:27,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 27 transitions. [2022-02-21 03:05:27,560 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:05:27,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 27 transitions. [2022-02-21 03:05:27,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 27 transitions. [2022-02-21 03:05:27,585 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:05:27,586 INFO L225 Difference]: With dead ends: 25 [2022-02-21 03:05:27,587 INFO L226 Difference]: Without dead ends: 23 [2022-02-21 03:05:27,587 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-02-21 03:05:27,588 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 23 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:05:27,589 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 8 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:05:27,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-21 03:05:27,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 17. [2022-02-21 03:05:27,606 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:05:27,606 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:05:27,607 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:05:27,607 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:05:27,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:27,609 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-02-21 03:05:27,609 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-02-21 03:05:27,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:27,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:27,610 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:05:27,610 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:05:27,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:27,613 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-02-21 03:05:27,613 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-02-21 03:05:27,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:27,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:27,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:05:27,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:05:27,614 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:05:27,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-02-21 03:05:27,615 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 10 [2022-02-21 03:05:27,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:27,615 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-02-21 03:05:27,615 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:05:27,615 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-02-21 03:05:27,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-21 03:05:27,616 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:27,616 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1] [2022-02-21 03:05:27,635 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:05:27,835 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:05:27,836 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:05:27,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:27,836 INFO L85 PathProgramCache]: Analyzing trace with hash 713850534, now seen corresponding path program 1 times [2022-02-21 03:05:27,836 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:27,836 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964197613] [2022-02-21 03:05:27,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:27,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:27,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:27,882 INFO L290 TraceCheckUtils]: 0: Hoare triple {507#true} assume { :begin_inline_ULTIMATE.init } true; {507#true} is VALID [2022-02-21 03:05:27,883 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 := 23; {509#(<= |ULTIMATE.start_main_~y~0#1| 23)} is VALID [2022-02-21 03:05:27,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {509#(<= |ULTIMATE.start_main_~y~0#1| 23)} assume !!(main_~x~0#1 >= 0); {509#(<= |ULTIMATE.start_main_~y~0#1| 23)} is VALID [2022-02-21 03:05:27,884 INFO L290 TraceCheckUtils]: 3: Hoare triple {509#(<= |ULTIMATE.start_main_~y~0#1| 23)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {509#(<= |ULTIMATE.start_main_~y~0#1| 23)} is VALID [2022-02-21 03:05:27,884 INFO L290 TraceCheckUtils]: 4: Hoare triple {509#(<= |ULTIMATE.start_main_~y~0#1| 23)} 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| 23)} is VALID [2022-02-21 03:05:27,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {509#(<= |ULTIMATE.start_main_~y~0#1| 23)} assume 1 + main_~y~0#1 <= 2147483647; {509#(<= |ULTIMATE.start_main_~y~0#1| 23)} is VALID [2022-02-21 03:05:27,885 INFO L290 TraceCheckUtils]: 6: Hoare triple {509#(<= |ULTIMATE.start_main_~y~0#1| 23)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {510#(<= |ULTIMATE.start_main_~y~0#1| 24)} is VALID [2022-02-21 03:05:27,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {510#(<= |ULTIMATE.start_main_~y~0#1| 24)} assume !!(main_~x~0#1 >= 0); {510#(<= |ULTIMATE.start_main_~y~0#1| 24)} is VALID [2022-02-21 03:05:27,886 INFO L290 TraceCheckUtils]: 8: Hoare triple {510#(<= |ULTIMATE.start_main_~y~0#1| 24)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {510#(<= |ULTIMATE.start_main_~y~0#1| 24)} is VALID [2022-02-21 03:05:27,886 INFO L290 TraceCheckUtils]: 9: Hoare triple {510#(<= |ULTIMATE.start_main_~y~0#1| 24)} 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| 24)} is VALID [2022-02-21 03:05:27,887 INFO L290 TraceCheckUtils]: 10: Hoare triple {510#(<= |ULTIMATE.start_main_~y~0#1| 24)} assume 1 + main_~y~0#1 <= 2147483647; {510#(<= |ULTIMATE.start_main_~y~0#1| 24)} is VALID [2022-02-21 03:05:27,887 INFO L290 TraceCheckUtils]: 11: Hoare triple {510#(<= |ULTIMATE.start_main_~y~0#1| 24)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {511#(<= |ULTIMATE.start_main_~y~0#1| 25)} is VALID [2022-02-21 03:05:27,888 INFO L290 TraceCheckUtils]: 12: Hoare triple {511#(<= |ULTIMATE.start_main_~y~0#1| 25)} assume !!(main_~x~0#1 >= 0); {511#(<= |ULTIMATE.start_main_~y~0#1| 25)} is VALID [2022-02-21 03:05:27,888 INFO L290 TraceCheckUtils]: 13: Hoare triple {511#(<= |ULTIMATE.start_main_~y~0#1| 25)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {511#(<= |ULTIMATE.start_main_~y~0#1| 25)} is VALID [2022-02-21 03:05:27,889 INFO L290 TraceCheckUtils]: 14: Hoare triple {511#(<= |ULTIMATE.start_main_~y~0#1| 25)} 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| 25)} is VALID [2022-02-21 03:05:27,889 INFO L290 TraceCheckUtils]: 15: Hoare triple {511#(<= |ULTIMATE.start_main_~y~0#1| 25)} assume !(1 + main_~y~0#1 <= 2147483647); {508#false} is VALID [2022-02-21 03:05:27,889 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:05:27,891 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:27,891 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964197613] [2022-02-21 03:05:27,891 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964197613] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:05:27,892 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230810509] [2022-02-21 03:05:27,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:27,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:05:27,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:05:27,893 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:05:27,902 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:05:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:27,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:05:27,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:27,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:05:27,998 INFO L290 TraceCheckUtils]: 0: Hoare triple {507#true} assume { :begin_inline_ULTIMATE.init } true; {507#true} is VALID [2022-02-21 03:05:27,999 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 := 23; {509#(<= |ULTIMATE.start_main_~y~0#1| 23)} is VALID [2022-02-21 03:05:27,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {509#(<= |ULTIMATE.start_main_~y~0#1| 23)} assume !!(main_~x~0#1 >= 0); {509#(<= |ULTIMATE.start_main_~y~0#1| 23)} is VALID [2022-02-21 03:05:27,999 INFO L290 TraceCheckUtils]: 3: Hoare triple {509#(<= |ULTIMATE.start_main_~y~0#1| 23)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {509#(<= |ULTIMATE.start_main_~y~0#1| 23)} is VALID [2022-02-21 03:05:28,000 INFO L290 TraceCheckUtils]: 4: Hoare triple {509#(<= |ULTIMATE.start_main_~y~0#1| 23)} 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| 23)} is VALID [2022-02-21 03:05:28,000 INFO L290 TraceCheckUtils]: 5: Hoare triple {509#(<= |ULTIMATE.start_main_~y~0#1| 23)} assume 1 + main_~y~0#1 <= 2147483647; {509#(<= |ULTIMATE.start_main_~y~0#1| 23)} is VALID [2022-02-21 03:05:28,001 INFO L290 TraceCheckUtils]: 6: Hoare triple {509#(<= |ULTIMATE.start_main_~y~0#1| 23)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {510#(<= |ULTIMATE.start_main_~y~0#1| 24)} is VALID [2022-02-21 03:05:28,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {510#(<= |ULTIMATE.start_main_~y~0#1| 24)} assume !!(main_~x~0#1 >= 0); {510#(<= |ULTIMATE.start_main_~y~0#1| 24)} is VALID [2022-02-21 03:05:28,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {510#(<= |ULTIMATE.start_main_~y~0#1| 24)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {510#(<= |ULTIMATE.start_main_~y~0#1| 24)} is VALID [2022-02-21 03:05:28,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {510#(<= |ULTIMATE.start_main_~y~0#1| 24)} 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| 24)} is VALID [2022-02-21 03:05:28,002 INFO L290 TraceCheckUtils]: 10: Hoare triple {510#(<= |ULTIMATE.start_main_~y~0#1| 24)} assume 1 + main_~y~0#1 <= 2147483647; {510#(<= |ULTIMATE.start_main_~y~0#1| 24)} is VALID [2022-02-21 03:05:28,003 INFO L290 TraceCheckUtils]: 11: Hoare triple {510#(<= |ULTIMATE.start_main_~y~0#1| 24)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {511#(<= |ULTIMATE.start_main_~y~0#1| 25)} is VALID [2022-02-21 03:05:28,003 INFO L290 TraceCheckUtils]: 12: Hoare triple {511#(<= |ULTIMATE.start_main_~y~0#1| 25)} assume !!(main_~x~0#1 >= 0); {511#(<= |ULTIMATE.start_main_~y~0#1| 25)} is VALID [2022-02-21 03:05:28,004 INFO L290 TraceCheckUtils]: 13: Hoare triple {511#(<= |ULTIMATE.start_main_~y~0#1| 25)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {511#(<= |ULTIMATE.start_main_~y~0#1| 25)} is VALID [2022-02-21 03:05:28,004 INFO L290 TraceCheckUtils]: 14: Hoare triple {511#(<= |ULTIMATE.start_main_~y~0#1| 25)} 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| 25)} is VALID [2022-02-21 03:05:28,005 INFO L290 TraceCheckUtils]: 15: Hoare triple {511#(<= |ULTIMATE.start_main_~y~0#1| 25)} assume !(1 + main_~y~0#1 <= 2147483647); {508#false} is VALID [2022-02-21 03:05:28,005 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:05:28,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:05:28,077 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:05:28,078 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:05:28,078 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:05:28,078 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:05:28,079 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:05:28,079 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:05:28,080 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:05:28,080 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:05:28,080 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:05:28,081 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:05:28,081 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:05:28,082 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:05:28,082 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:05:28,082 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:05:28,083 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 := 23; {589#(<= |ULTIMATE.start_main_~y~0#1| 2147483644)} is VALID [2022-02-21 03:05:28,083 INFO L290 TraceCheckUtils]: 0: Hoare triple {507#true} assume { :begin_inline_ULTIMATE.init } true; {507#true} is VALID [2022-02-21 03:05:28,083 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:05:28,084 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230810509] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:05:28,084 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:05:28,084 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-21 03:05:28,084 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866300345] [2022-02-21 03:05:28,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:05:28,085 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:05:28,085 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:28,085 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:05:28,102 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:05:28,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-21 03:05:28,102 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:28,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-21 03:05:28,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:05:28,103 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:05:28,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:28,157 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-02-21 03:05:28,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 03:05:28,158 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:05:28,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:05:28,158 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:05:28,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-02-21 03:05:28,159 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:05:28,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-02-21 03:05:28,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 41 transitions. [2022-02-21 03:05:28,191 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:05:28,192 INFO L225 Difference]: With dead ends: 38 [2022-02-21 03:05:28,192 INFO L226 Difference]: Without dead ends: 37 [2022-02-21 03:05:28,192 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:05:28,192 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:05:28,193 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:05:28,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-02-21 03:05:28,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-02-21 03:05:28,217 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:05:28,218 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:05:28,218 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:05:28,218 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:05:28,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:28,219 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-02-21 03:05:28,219 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-02-21 03:05:28,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:28,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:28,220 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:05:28,220 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:05:28,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:28,221 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-02-21 03:05:28,221 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-02-21 03:05:28,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:28,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:28,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:05:28,221 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:05:28,221 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:05:28,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2022-02-21 03:05:28,222 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 16 [2022-02-21 03:05:28,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:28,222 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2022-02-21 03:05:28,222 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:05:28,222 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-02-21 03:05:28,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-21 03:05:28,223 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:28,223 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1] [2022-02-21 03:05:28,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:05:28,423 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:05:28,424 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:05:28,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:28,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1979689446, now seen corresponding path program 2 times [2022-02-21 03:05:28,425 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:28,425 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839401817] [2022-02-21 03:05:28,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:28,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:28,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:28,520 INFO L290 TraceCheckUtils]: 0: Hoare triple {770#true} assume { :begin_inline_ULTIMATE.init } true; {770#true} is VALID [2022-02-21 03:05:28,521 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 := 23; {772#(<= |ULTIMATE.start_main_~y~0#1| 23)} is VALID [2022-02-21 03:05:28,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {772#(<= |ULTIMATE.start_main_~y~0#1| 23)} assume !!(main_~x~0#1 >= 0); {772#(<= |ULTIMATE.start_main_~y~0#1| 23)} is VALID [2022-02-21 03:05:28,522 INFO L290 TraceCheckUtils]: 3: Hoare triple {772#(<= |ULTIMATE.start_main_~y~0#1| 23)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {772#(<= |ULTIMATE.start_main_~y~0#1| 23)} is VALID [2022-02-21 03:05:28,522 INFO L290 TraceCheckUtils]: 4: Hoare triple {772#(<= |ULTIMATE.start_main_~y~0#1| 23)} 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| 23)} is VALID [2022-02-21 03:05:28,523 INFO L290 TraceCheckUtils]: 5: Hoare triple {772#(<= |ULTIMATE.start_main_~y~0#1| 23)} assume 1 + main_~y~0#1 <= 2147483647; {772#(<= |ULTIMATE.start_main_~y~0#1| 23)} is VALID [2022-02-21 03:05:28,524 INFO L290 TraceCheckUtils]: 6: Hoare triple {772#(<= |ULTIMATE.start_main_~y~0#1| 23)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {773#(<= |ULTIMATE.start_main_~y~0#1| 24)} is VALID [2022-02-21 03:05:28,525 INFO L290 TraceCheckUtils]: 7: Hoare triple {773#(<= |ULTIMATE.start_main_~y~0#1| 24)} assume !!(main_~x~0#1 >= 0); {773#(<= |ULTIMATE.start_main_~y~0#1| 24)} is VALID [2022-02-21 03:05:28,535 INFO L290 TraceCheckUtils]: 8: Hoare triple {773#(<= |ULTIMATE.start_main_~y~0#1| 24)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {773#(<= |ULTIMATE.start_main_~y~0#1| 24)} is VALID [2022-02-21 03:05:28,536 INFO L290 TraceCheckUtils]: 9: Hoare triple {773#(<= |ULTIMATE.start_main_~y~0#1| 24)} 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| 24)} is VALID [2022-02-21 03:05:28,536 INFO L290 TraceCheckUtils]: 10: Hoare triple {773#(<= |ULTIMATE.start_main_~y~0#1| 24)} assume 1 + main_~y~0#1 <= 2147483647; {773#(<= |ULTIMATE.start_main_~y~0#1| 24)} is VALID [2022-02-21 03:05:28,537 INFO L290 TraceCheckUtils]: 11: Hoare triple {773#(<= |ULTIMATE.start_main_~y~0#1| 24)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {774#(<= |ULTIMATE.start_main_~y~0#1| 25)} is VALID [2022-02-21 03:05:28,537 INFO L290 TraceCheckUtils]: 12: Hoare triple {774#(<= |ULTIMATE.start_main_~y~0#1| 25)} assume !!(main_~x~0#1 >= 0); {774#(<= |ULTIMATE.start_main_~y~0#1| 25)} is VALID [2022-02-21 03:05:28,537 INFO L290 TraceCheckUtils]: 13: Hoare triple {774#(<= |ULTIMATE.start_main_~y~0#1| 25)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {774#(<= |ULTIMATE.start_main_~y~0#1| 25)} is VALID [2022-02-21 03:05:28,537 INFO L290 TraceCheckUtils]: 14: Hoare triple {774#(<= |ULTIMATE.start_main_~y~0#1| 25)} 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| 25)} is VALID [2022-02-21 03:05:28,538 INFO L290 TraceCheckUtils]: 15: Hoare triple {774#(<= |ULTIMATE.start_main_~y~0#1| 25)} assume 1 + main_~y~0#1 <= 2147483647; {774#(<= |ULTIMATE.start_main_~y~0#1| 25)} is VALID [2022-02-21 03:05:28,538 INFO L290 TraceCheckUtils]: 16: Hoare triple {774#(<= |ULTIMATE.start_main_~y~0#1| 25)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {775#(<= |ULTIMATE.start_main_~y~0#1| 26)} is VALID [2022-02-21 03:05:28,539 INFO L290 TraceCheckUtils]: 17: Hoare triple {775#(<= |ULTIMATE.start_main_~y~0#1| 26)} assume !!(main_~x~0#1 >= 0); {775#(<= |ULTIMATE.start_main_~y~0#1| 26)} is VALID [2022-02-21 03:05:28,539 INFO L290 TraceCheckUtils]: 18: Hoare triple {775#(<= |ULTIMATE.start_main_~y~0#1| 26)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {775#(<= |ULTIMATE.start_main_~y~0#1| 26)} is VALID [2022-02-21 03:05:28,539 INFO L290 TraceCheckUtils]: 19: Hoare triple {775#(<= |ULTIMATE.start_main_~y~0#1| 26)} 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| 26)} is VALID [2022-02-21 03:05:28,540 INFO L290 TraceCheckUtils]: 20: Hoare triple {775#(<= |ULTIMATE.start_main_~y~0#1| 26)} assume 1 + main_~y~0#1 <= 2147483647; {775#(<= |ULTIMATE.start_main_~y~0#1| 26)} is VALID [2022-02-21 03:05:28,540 INFO L290 TraceCheckUtils]: 21: Hoare triple {775#(<= |ULTIMATE.start_main_~y~0#1| 26)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {776#(<= |ULTIMATE.start_main_~y~0#1| 27)} is VALID [2022-02-21 03:05:28,540 INFO L290 TraceCheckUtils]: 22: Hoare triple {776#(<= |ULTIMATE.start_main_~y~0#1| 27)} assume !!(main_~x~0#1 >= 0); {776#(<= |ULTIMATE.start_main_~y~0#1| 27)} is VALID [2022-02-21 03:05:28,541 INFO L290 TraceCheckUtils]: 23: Hoare triple {776#(<= |ULTIMATE.start_main_~y~0#1| 27)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {776#(<= |ULTIMATE.start_main_~y~0#1| 27)} is VALID [2022-02-21 03:05:28,541 INFO L290 TraceCheckUtils]: 24: Hoare triple {776#(<= |ULTIMATE.start_main_~y~0#1| 27)} 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| 27)} is VALID [2022-02-21 03:05:28,541 INFO L290 TraceCheckUtils]: 25: Hoare triple {776#(<= |ULTIMATE.start_main_~y~0#1| 27)} assume 1 + main_~y~0#1 <= 2147483647; {776#(<= |ULTIMATE.start_main_~y~0#1| 27)} is VALID [2022-02-21 03:05:28,542 INFO L290 TraceCheckUtils]: 26: Hoare triple {776#(<= |ULTIMATE.start_main_~y~0#1| 27)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {777#(<= |ULTIMATE.start_main_~y~0#1| 28)} is VALID [2022-02-21 03:05:28,542 INFO L290 TraceCheckUtils]: 27: Hoare triple {777#(<= |ULTIMATE.start_main_~y~0#1| 28)} assume !!(main_~x~0#1 >= 0); {777#(<= |ULTIMATE.start_main_~y~0#1| 28)} is VALID [2022-02-21 03:05:28,543 INFO L290 TraceCheckUtils]: 28: Hoare triple {777#(<= |ULTIMATE.start_main_~y~0#1| 28)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {777#(<= |ULTIMATE.start_main_~y~0#1| 28)} is VALID [2022-02-21 03:05:28,543 INFO L290 TraceCheckUtils]: 29: Hoare triple {777#(<= |ULTIMATE.start_main_~y~0#1| 28)} 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| 28)} is VALID [2022-02-21 03:05:28,543 INFO L290 TraceCheckUtils]: 30: Hoare triple {777#(<= |ULTIMATE.start_main_~y~0#1| 28)} assume 1 + main_~y~0#1 <= 2147483647; {777#(<= |ULTIMATE.start_main_~y~0#1| 28)} is VALID [2022-02-21 03:05:28,544 INFO L290 TraceCheckUtils]: 31: Hoare triple {777#(<= |ULTIMATE.start_main_~y~0#1| 28)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {778#(<= |ULTIMATE.start_main_~y~0#1| 29)} is VALID [2022-02-21 03:05:28,544 INFO L290 TraceCheckUtils]: 32: Hoare triple {778#(<= |ULTIMATE.start_main_~y~0#1| 29)} assume !!(main_~x~0#1 >= 0); {778#(<= |ULTIMATE.start_main_~y~0#1| 29)} is VALID [2022-02-21 03:05:28,544 INFO L290 TraceCheckUtils]: 33: Hoare triple {778#(<= |ULTIMATE.start_main_~y~0#1| 29)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {778#(<= |ULTIMATE.start_main_~y~0#1| 29)} is VALID [2022-02-21 03:05:28,545 INFO L290 TraceCheckUtils]: 34: Hoare triple {778#(<= |ULTIMATE.start_main_~y~0#1| 29)} 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| 29)} is VALID [2022-02-21 03:05:28,545 INFO L290 TraceCheckUtils]: 35: Hoare triple {778#(<= |ULTIMATE.start_main_~y~0#1| 29)} assume !(1 + main_~y~0#1 <= 2147483647); {771#false} is VALID [2022-02-21 03:05:28,545 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:05:28,545 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:28,546 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839401817] [2022-02-21 03:05:28,546 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839401817] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:05:28,546 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150159425] [2022-02-21 03:05:28,546 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:05:28,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:05:28,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:05:28,552 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:05:28,553 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:05:28,589 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:05:28,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:05:28,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:05:28,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:28,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:05:28,807 INFO L290 TraceCheckUtils]: 0: Hoare triple {770#true} assume { :begin_inline_ULTIMATE.init } true; {770#true} is VALID [2022-02-21 03:05:28,808 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 := 23; {772#(<= |ULTIMATE.start_main_~y~0#1| 23)} is VALID [2022-02-21 03:05:28,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {772#(<= |ULTIMATE.start_main_~y~0#1| 23)} assume !!(main_~x~0#1 >= 0); {772#(<= |ULTIMATE.start_main_~y~0#1| 23)} is VALID [2022-02-21 03:05:28,809 INFO L290 TraceCheckUtils]: 3: Hoare triple {772#(<= |ULTIMATE.start_main_~y~0#1| 23)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {772#(<= |ULTIMATE.start_main_~y~0#1| 23)} is VALID [2022-02-21 03:05:28,810 INFO L290 TraceCheckUtils]: 4: Hoare triple {772#(<= |ULTIMATE.start_main_~y~0#1| 23)} 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| 23)} is VALID [2022-02-21 03:05:28,810 INFO L290 TraceCheckUtils]: 5: Hoare triple {772#(<= |ULTIMATE.start_main_~y~0#1| 23)} assume 1 + main_~y~0#1 <= 2147483647; {772#(<= |ULTIMATE.start_main_~y~0#1| 23)} is VALID [2022-02-21 03:05:28,811 INFO L290 TraceCheckUtils]: 6: Hoare triple {772#(<= |ULTIMATE.start_main_~y~0#1| 23)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {773#(<= |ULTIMATE.start_main_~y~0#1| 24)} is VALID [2022-02-21 03:05:28,811 INFO L290 TraceCheckUtils]: 7: Hoare triple {773#(<= |ULTIMATE.start_main_~y~0#1| 24)} assume !!(main_~x~0#1 >= 0); {773#(<= |ULTIMATE.start_main_~y~0#1| 24)} is VALID [2022-02-21 03:05:28,811 INFO L290 TraceCheckUtils]: 8: Hoare triple {773#(<= |ULTIMATE.start_main_~y~0#1| 24)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {773#(<= |ULTIMATE.start_main_~y~0#1| 24)} is VALID [2022-02-21 03:05:28,812 INFO L290 TraceCheckUtils]: 9: Hoare triple {773#(<= |ULTIMATE.start_main_~y~0#1| 24)} 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| 24)} is VALID [2022-02-21 03:05:28,812 INFO L290 TraceCheckUtils]: 10: Hoare triple {773#(<= |ULTIMATE.start_main_~y~0#1| 24)} assume 1 + main_~y~0#1 <= 2147483647; {773#(<= |ULTIMATE.start_main_~y~0#1| 24)} is VALID [2022-02-21 03:05:28,813 INFO L290 TraceCheckUtils]: 11: Hoare triple {773#(<= |ULTIMATE.start_main_~y~0#1| 24)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {774#(<= |ULTIMATE.start_main_~y~0#1| 25)} is VALID [2022-02-21 03:05:28,813 INFO L290 TraceCheckUtils]: 12: Hoare triple {774#(<= |ULTIMATE.start_main_~y~0#1| 25)} assume !!(main_~x~0#1 >= 0); {774#(<= |ULTIMATE.start_main_~y~0#1| 25)} is VALID [2022-02-21 03:05:28,813 INFO L290 TraceCheckUtils]: 13: Hoare triple {774#(<= |ULTIMATE.start_main_~y~0#1| 25)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {774#(<= |ULTIMATE.start_main_~y~0#1| 25)} is VALID [2022-02-21 03:05:28,814 INFO L290 TraceCheckUtils]: 14: Hoare triple {774#(<= |ULTIMATE.start_main_~y~0#1| 25)} 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| 25)} is VALID [2022-02-21 03:05:28,814 INFO L290 TraceCheckUtils]: 15: Hoare triple {774#(<= |ULTIMATE.start_main_~y~0#1| 25)} assume 1 + main_~y~0#1 <= 2147483647; {774#(<= |ULTIMATE.start_main_~y~0#1| 25)} is VALID [2022-02-21 03:05:28,814 INFO L290 TraceCheckUtils]: 16: Hoare triple {774#(<= |ULTIMATE.start_main_~y~0#1| 25)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {775#(<= |ULTIMATE.start_main_~y~0#1| 26)} is VALID [2022-02-21 03:05:28,815 INFO L290 TraceCheckUtils]: 17: Hoare triple {775#(<= |ULTIMATE.start_main_~y~0#1| 26)} assume !!(main_~x~0#1 >= 0); {775#(<= |ULTIMATE.start_main_~y~0#1| 26)} is VALID [2022-02-21 03:05:28,815 INFO L290 TraceCheckUtils]: 18: Hoare triple {775#(<= |ULTIMATE.start_main_~y~0#1| 26)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {775#(<= |ULTIMATE.start_main_~y~0#1| 26)} is VALID [2022-02-21 03:05:28,816 INFO L290 TraceCheckUtils]: 19: Hoare triple {775#(<= |ULTIMATE.start_main_~y~0#1| 26)} 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| 26)} is VALID [2022-02-21 03:05:28,816 INFO L290 TraceCheckUtils]: 20: Hoare triple {775#(<= |ULTIMATE.start_main_~y~0#1| 26)} assume 1 + main_~y~0#1 <= 2147483647; {775#(<= |ULTIMATE.start_main_~y~0#1| 26)} is VALID [2022-02-21 03:05:28,817 INFO L290 TraceCheckUtils]: 21: Hoare triple {775#(<= |ULTIMATE.start_main_~y~0#1| 26)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {776#(<= |ULTIMATE.start_main_~y~0#1| 27)} is VALID [2022-02-21 03:05:28,817 INFO L290 TraceCheckUtils]: 22: Hoare triple {776#(<= |ULTIMATE.start_main_~y~0#1| 27)} assume !!(main_~x~0#1 >= 0); {776#(<= |ULTIMATE.start_main_~y~0#1| 27)} is VALID [2022-02-21 03:05:28,818 INFO L290 TraceCheckUtils]: 23: Hoare triple {776#(<= |ULTIMATE.start_main_~y~0#1| 27)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {776#(<= |ULTIMATE.start_main_~y~0#1| 27)} is VALID [2022-02-21 03:05:28,818 INFO L290 TraceCheckUtils]: 24: Hoare triple {776#(<= |ULTIMATE.start_main_~y~0#1| 27)} 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| 27)} is VALID [2022-02-21 03:05:28,818 INFO L290 TraceCheckUtils]: 25: Hoare triple {776#(<= |ULTIMATE.start_main_~y~0#1| 27)} assume 1 + main_~y~0#1 <= 2147483647; {776#(<= |ULTIMATE.start_main_~y~0#1| 27)} is VALID [2022-02-21 03:05:28,819 INFO L290 TraceCheckUtils]: 26: Hoare triple {776#(<= |ULTIMATE.start_main_~y~0#1| 27)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {777#(<= |ULTIMATE.start_main_~y~0#1| 28)} is VALID [2022-02-21 03:05:28,819 INFO L290 TraceCheckUtils]: 27: Hoare triple {777#(<= |ULTIMATE.start_main_~y~0#1| 28)} assume !!(main_~x~0#1 >= 0); {777#(<= |ULTIMATE.start_main_~y~0#1| 28)} is VALID [2022-02-21 03:05:28,819 INFO L290 TraceCheckUtils]: 28: Hoare triple {777#(<= |ULTIMATE.start_main_~y~0#1| 28)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {777#(<= |ULTIMATE.start_main_~y~0#1| 28)} is VALID [2022-02-21 03:05:28,820 INFO L290 TraceCheckUtils]: 29: Hoare triple {777#(<= |ULTIMATE.start_main_~y~0#1| 28)} 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| 28)} is VALID [2022-02-21 03:05:28,820 INFO L290 TraceCheckUtils]: 30: Hoare triple {777#(<= |ULTIMATE.start_main_~y~0#1| 28)} assume 1 + main_~y~0#1 <= 2147483647; {777#(<= |ULTIMATE.start_main_~y~0#1| 28)} is VALID [2022-02-21 03:05:28,821 INFO L290 TraceCheckUtils]: 31: Hoare triple {777#(<= |ULTIMATE.start_main_~y~0#1| 28)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {778#(<= |ULTIMATE.start_main_~y~0#1| 29)} is VALID [2022-02-21 03:05:28,821 INFO L290 TraceCheckUtils]: 32: Hoare triple {778#(<= |ULTIMATE.start_main_~y~0#1| 29)} assume !!(main_~x~0#1 >= 0); {778#(<= |ULTIMATE.start_main_~y~0#1| 29)} is VALID [2022-02-21 03:05:28,821 INFO L290 TraceCheckUtils]: 33: Hoare triple {778#(<= |ULTIMATE.start_main_~y~0#1| 29)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {778#(<= |ULTIMATE.start_main_~y~0#1| 29)} is VALID [2022-02-21 03:05:28,822 INFO L290 TraceCheckUtils]: 34: Hoare triple {778#(<= |ULTIMATE.start_main_~y~0#1| 29)} 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| 29)} is VALID [2022-02-21 03:05:28,822 INFO L290 TraceCheckUtils]: 35: Hoare triple {778#(<= |ULTIMATE.start_main_~y~0#1| 29)} assume !(1 + main_~y~0#1 <= 2147483647); {771#false} is VALID [2022-02-21 03:05:28,823 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:05:28,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:05:29,042 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:05:29,043 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:05:29,043 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:05:29,043 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:05:29,044 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:05:29,044 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:05:29,044 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:05:29,045 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:05:29,045 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:05:29,046 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:05:29,046 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:05:29,046 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:05:29,047 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:05:29,047 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:05:29,047 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:05:29,048 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:05:29,048 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:05:29,048 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:05:29,049 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:05:29,049 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:05:29,055 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:05:29,056 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:05:29,056 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:05:29,056 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:05:29,057 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:05:29,057 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:05:29,057 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:05:29,058 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:05:29,058 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:05:29,058 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:05:29,059 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:05:29,059 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:05:29,060 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:05:29,060 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:05:29,060 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 := 23; {980#(<= |ULTIMATE.start_main_~y~0#1| 2147483640)} is VALID [2022-02-21 03:05:29,060 INFO L290 TraceCheckUtils]: 0: Hoare triple {770#true} assume { :begin_inline_ULTIMATE.init } true; {770#true} is VALID [2022-02-21 03:05:29,061 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:05:29,061 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150159425] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:05:29,061 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:05:29,061 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2022-02-21 03:05:29,061 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28654144] [2022-02-21 03:05:29,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:05:29,062 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:05:29,062 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:29,062 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:05:29,111 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:05:29,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-21 03:05:29,111 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:29,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-21 03:05:29,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2022-02-21 03:05:29,112 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:05:29,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:29,273 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2022-02-21 03:05:29,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-21 03:05:29,273 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:05:29,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:05:29,273 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:05:29,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 85 transitions. [2022-02-21 03:05:29,275 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:05:29,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 85 transitions. [2022-02-21 03:05:29,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 85 transitions. [2022-02-21 03:05:29,326 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:05:29,328 INFO L225 Difference]: With dead ends: 78 [2022-02-21 03:05:29,328 INFO L226 Difference]: Without dead ends: 77 [2022-02-21 03:05:29,328 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:05:29,328 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:05:29,329 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:05:29,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-02-21 03:05:29,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-02-21 03:05:29,374 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:05:29,375 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:05:29,375 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:05:29,375 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:05:29,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:29,377 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2022-02-21 03:05:29,377 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2022-02-21 03:05:29,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:29,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:29,378 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:05:29,378 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:05:29,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:29,379 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2022-02-21 03:05:29,380 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2022-02-21 03:05:29,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:29,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:29,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:05:29,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:05:29,381 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:05:29,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2022-02-21 03:05:29,382 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 36 [2022-02-21 03:05:29,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:29,382 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2022-02-21 03:05:29,382 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:05:29,383 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2022-02-21 03:05:29,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-21 03:05:29,384 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:29,384 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 1, 1, 1] [2022-02-21 03:05:29,402 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:05:29,599 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:05:29,599 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:05:29,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:29,600 INFO L85 PathProgramCache]: Analyzing trace with hash 220438630, now seen corresponding path program 3 times [2022-02-21 03:05:29,600 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:29,600 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434438999] [2022-02-21 03:05:29,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:29,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:29,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:29,832 INFO L290 TraceCheckUtils]: 0: Hoare triple {1337#true} assume { :begin_inline_ULTIMATE.init } true; {1337#true} is VALID [2022-02-21 03:05:29,833 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 := 23; {1339#(<= |ULTIMATE.start_main_~y~0#1| 23)} is VALID [2022-02-21 03:05:29,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {1339#(<= |ULTIMATE.start_main_~y~0#1| 23)} assume !!(main_~x~0#1 >= 0); {1339#(<= |ULTIMATE.start_main_~y~0#1| 23)} is VALID [2022-02-21 03:05:29,833 INFO L290 TraceCheckUtils]: 3: Hoare triple {1339#(<= |ULTIMATE.start_main_~y~0#1| 23)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1339#(<= |ULTIMATE.start_main_~y~0#1| 23)} is VALID [2022-02-21 03:05:29,834 INFO L290 TraceCheckUtils]: 4: Hoare triple {1339#(<= |ULTIMATE.start_main_~y~0#1| 23)} 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| 23)} is VALID [2022-02-21 03:05:29,834 INFO L290 TraceCheckUtils]: 5: Hoare triple {1339#(<= |ULTIMATE.start_main_~y~0#1| 23)} assume 1 + main_~y~0#1 <= 2147483647; {1339#(<= |ULTIMATE.start_main_~y~0#1| 23)} is VALID [2022-02-21 03:05:29,835 INFO L290 TraceCheckUtils]: 6: Hoare triple {1339#(<= |ULTIMATE.start_main_~y~0#1| 23)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1340#(<= |ULTIMATE.start_main_~y~0#1| 24)} is VALID [2022-02-21 03:05:29,835 INFO L290 TraceCheckUtils]: 7: Hoare triple {1340#(<= |ULTIMATE.start_main_~y~0#1| 24)} assume !!(main_~x~0#1 >= 0); {1340#(<= |ULTIMATE.start_main_~y~0#1| 24)} is VALID [2022-02-21 03:05:29,835 INFO L290 TraceCheckUtils]: 8: Hoare triple {1340#(<= |ULTIMATE.start_main_~y~0#1| 24)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1340#(<= |ULTIMATE.start_main_~y~0#1| 24)} is VALID [2022-02-21 03:05:29,836 INFO L290 TraceCheckUtils]: 9: Hoare triple {1340#(<= |ULTIMATE.start_main_~y~0#1| 24)} 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| 24)} is VALID [2022-02-21 03:05:29,836 INFO L290 TraceCheckUtils]: 10: Hoare triple {1340#(<= |ULTIMATE.start_main_~y~0#1| 24)} assume 1 + main_~y~0#1 <= 2147483647; {1340#(<= |ULTIMATE.start_main_~y~0#1| 24)} is VALID [2022-02-21 03:05:29,837 INFO L290 TraceCheckUtils]: 11: Hoare triple {1340#(<= |ULTIMATE.start_main_~y~0#1| 24)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1341#(<= |ULTIMATE.start_main_~y~0#1| 25)} is VALID [2022-02-21 03:05:29,837 INFO L290 TraceCheckUtils]: 12: Hoare triple {1341#(<= |ULTIMATE.start_main_~y~0#1| 25)} assume !!(main_~x~0#1 >= 0); {1341#(<= |ULTIMATE.start_main_~y~0#1| 25)} is VALID [2022-02-21 03:05:29,837 INFO L290 TraceCheckUtils]: 13: Hoare triple {1341#(<= |ULTIMATE.start_main_~y~0#1| 25)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1341#(<= |ULTIMATE.start_main_~y~0#1| 25)} is VALID [2022-02-21 03:05:29,838 INFO L290 TraceCheckUtils]: 14: Hoare triple {1341#(<= |ULTIMATE.start_main_~y~0#1| 25)} 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| 25)} is VALID [2022-02-21 03:05:29,838 INFO L290 TraceCheckUtils]: 15: Hoare triple {1341#(<= |ULTIMATE.start_main_~y~0#1| 25)} assume 1 + main_~y~0#1 <= 2147483647; {1341#(<= |ULTIMATE.start_main_~y~0#1| 25)} is VALID [2022-02-21 03:05:29,838 INFO L290 TraceCheckUtils]: 16: Hoare triple {1341#(<= |ULTIMATE.start_main_~y~0#1| 25)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1342#(<= |ULTIMATE.start_main_~y~0#1| 26)} is VALID [2022-02-21 03:05:29,839 INFO L290 TraceCheckUtils]: 17: Hoare triple {1342#(<= |ULTIMATE.start_main_~y~0#1| 26)} assume !!(main_~x~0#1 >= 0); {1342#(<= |ULTIMATE.start_main_~y~0#1| 26)} is VALID [2022-02-21 03:05:29,839 INFO L290 TraceCheckUtils]: 18: Hoare triple {1342#(<= |ULTIMATE.start_main_~y~0#1| 26)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1342#(<= |ULTIMATE.start_main_~y~0#1| 26)} is VALID [2022-02-21 03:05:29,840 INFO L290 TraceCheckUtils]: 19: Hoare triple {1342#(<= |ULTIMATE.start_main_~y~0#1| 26)} 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| 26)} is VALID [2022-02-21 03:05:29,841 INFO L290 TraceCheckUtils]: 20: Hoare triple {1342#(<= |ULTIMATE.start_main_~y~0#1| 26)} assume 1 + main_~y~0#1 <= 2147483647; {1342#(<= |ULTIMATE.start_main_~y~0#1| 26)} is VALID [2022-02-21 03:05:29,841 INFO L290 TraceCheckUtils]: 21: Hoare triple {1342#(<= |ULTIMATE.start_main_~y~0#1| 26)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1343#(<= |ULTIMATE.start_main_~y~0#1| 27)} is VALID [2022-02-21 03:05:29,842 INFO L290 TraceCheckUtils]: 22: Hoare triple {1343#(<= |ULTIMATE.start_main_~y~0#1| 27)} assume !!(main_~x~0#1 >= 0); {1343#(<= |ULTIMATE.start_main_~y~0#1| 27)} is VALID [2022-02-21 03:05:29,842 INFO L290 TraceCheckUtils]: 23: Hoare triple {1343#(<= |ULTIMATE.start_main_~y~0#1| 27)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1343#(<= |ULTIMATE.start_main_~y~0#1| 27)} is VALID [2022-02-21 03:05:29,842 INFO L290 TraceCheckUtils]: 24: Hoare triple {1343#(<= |ULTIMATE.start_main_~y~0#1| 27)} 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| 27)} is VALID [2022-02-21 03:05:29,843 INFO L290 TraceCheckUtils]: 25: Hoare triple {1343#(<= |ULTIMATE.start_main_~y~0#1| 27)} assume 1 + main_~y~0#1 <= 2147483647; {1343#(<= |ULTIMATE.start_main_~y~0#1| 27)} is VALID [2022-02-21 03:05:29,843 INFO L290 TraceCheckUtils]: 26: Hoare triple {1343#(<= |ULTIMATE.start_main_~y~0#1| 27)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1344#(<= |ULTIMATE.start_main_~y~0#1| 28)} is VALID [2022-02-21 03:05:29,844 INFO L290 TraceCheckUtils]: 27: Hoare triple {1344#(<= |ULTIMATE.start_main_~y~0#1| 28)} assume !!(main_~x~0#1 >= 0); {1344#(<= |ULTIMATE.start_main_~y~0#1| 28)} is VALID [2022-02-21 03:05:29,846 INFO L290 TraceCheckUtils]: 28: Hoare triple {1344#(<= |ULTIMATE.start_main_~y~0#1| 28)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1344#(<= |ULTIMATE.start_main_~y~0#1| 28)} is VALID [2022-02-21 03:05:29,847 INFO L290 TraceCheckUtils]: 29: Hoare triple {1344#(<= |ULTIMATE.start_main_~y~0#1| 28)} 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| 28)} is VALID [2022-02-21 03:05:29,848 INFO L290 TraceCheckUtils]: 30: Hoare triple {1344#(<= |ULTIMATE.start_main_~y~0#1| 28)} assume 1 + main_~y~0#1 <= 2147483647; {1344#(<= |ULTIMATE.start_main_~y~0#1| 28)} is VALID [2022-02-21 03:05:29,849 INFO L290 TraceCheckUtils]: 31: Hoare triple {1344#(<= |ULTIMATE.start_main_~y~0#1| 28)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1345#(<= |ULTIMATE.start_main_~y~0#1| 29)} is VALID [2022-02-21 03:05:29,849 INFO L290 TraceCheckUtils]: 32: Hoare triple {1345#(<= |ULTIMATE.start_main_~y~0#1| 29)} assume !!(main_~x~0#1 >= 0); {1345#(<= |ULTIMATE.start_main_~y~0#1| 29)} is VALID [2022-02-21 03:05:29,850 INFO L290 TraceCheckUtils]: 33: Hoare triple {1345#(<= |ULTIMATE.start_main_~y~0#1| 29)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1345#(<= |ULTIMATE.start_main_~y~0#1| 29)} is VALID [2022-02-21 03:05:29,850 INFO L290 TraceCheckUtils]: 34: Hoare triple {1345#(<= |ULTIMATE.start_main_~y~0#1| 29)} 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| 29)} is VALID [2022-02-21 03:05:29,854 INFO L290 TraceCheckUtils]: 35: Hoare triple {1345#(<= |ULTIMATE.start_main_~y~0#1| 29)} assume 1 + main_~y~0#1 <= 2147483647; {1345#(<= |ULTIMATE.start_main_~y~0#1| 29)} is VALID [2022-02-21 03:05:29,855 INFO L290 TraceCheckUtils]: 36: Hoare triple {1345#(<= |ULTIMATE.start_main_~y~0#1| 29)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1346#(<= |ULTIMATE.start_main_~y~0#1| 30)} is VALID [2022-02-21 03:05:29,855 INFO L290 TraceCheckUtils]: 37: Hoare triple {1346#(<= |ULTIMATE.start_main_~y~0#1| 30)} assume !!(main_~x~0#1 >= 0); {1346#(<= |ULTIMATE.start_main_~y~0#1| 30)} is VALID [2022-02-21 03:05:29,856 INFO L290 TraceCheckUtils]: 38: Hoare triple {1346#(<= |ULTIMATE.start_main_~y~0#1| 30)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1346#(<= |ULTIMATE.start_main_~y~0#1| 30)} is VALID [2022-02-21 03:05:29,856 INFO L290 TraceCheckUtils]: 39: Hoare triple {1346#(<= |ULTIMATE.start_main_~y~0#1| 30)} 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| 30)} is VALID [2022-02-21 03:05:29,856 INFO L290 TraceCheckUtils]: 40: Hoare triple {1346#(<= |ULTIMATE.start_main_~y~0#1| 30)} assume 1 + main_~y~0#1 <= 2147483647; {1346#(<= |ULTIMATE.start_main_~y~0#1| 30)} is VALID [2022-02-21 03:05:29,857 INFO L290 TraceCheckUtils]: 41: Hoare triple {1346#(<= |ULTIMATE.start_main_~y~0#1| 30)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1347#(<= |ULTIMATE.start_main_~y~0#1| 31)} is VALID [2022-02-21 03:05:29,857 INFO L290 TraceCheckUtils]: 42: Hoare triple {1347#(<= |ULTIMATE.start_main_~y~0#1| 31)} assume !!(main_~x~0#1 >= 0); {1347#(<= |ULTIMATE.start_main_~y~0#1| 31)} is VALID [2022-02-21 03:05:29,857 INFO L290 TraceCheckUtils]: 43: Hoare triple {1347#(<= |ULTIMATE.start_main_~y~0#1| 31)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1347#(<= |ULTIMATE.start_main_~y~0#1| 31)} is VALID [2022-02-21 03:05:29,858 INFO L290 TraceCheckUtils]: 44: Hoare triple {1347#(<= |ULTIMATE.start_main_~y~0#1| 31)} 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| 31)} is VALID [2022-02-21 03:05:29,858 INFO L290 TraceCheckUtils]: 45: Hoare triple {1347#(<= |ULTIMATE.start_main_~y~0#1| 31)} assume 1 + main_~y~0#1 <= 2147483647; {1347#(<= |ULTIMATE.start_main_~y~0#1| 31)} is VALID [2022-02-21 03:05:29,859 INFO L290 TraceCheckUtils]: 46: Hoare triple {1347#(<= |ULTIMATE.start_main_~y~0#1| 31)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1348#(<= |ULTIMATE.start_main_~y~0#1| 32)} is VALID [2022-02-21 03:05:29,859 INFO L290 TraceCheckUtils]: 47: Hoare triple {1348#(<= |ULTIMATE.start_main_~y~0#1| 32)} assume !!(main_~x~0#1 >= 0); {1348#(<= |ULTIMATE.start_main_~y~0#1| 32)} is VALID [2022-02-21 03:05:29,859 INFO L290 TraceCheckUtils]: 48: Hoare triple {1348#(<= |ULTIMATE.start_main_~y~0#1| 32)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1348#(<= |ULTIMATE.start_main_~y~0#1| 32)} is VALID [2022-02-21 03:05:29,860 INFO L290 TraceCheckUtils]: 49: Hoare triple {1348#(<= |ULTIMATE.start_main_~y~0#1| 32)} 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| 32)} is VALID [2022-02-21 03:05:29,860 INFO L290 TraceCheckUtils]: 50: Hoare triple {1348#(<= |ULTIMATE.start_main_~y~0#1| 32)} assume 1 + main_~y~0#1 <= 2147483647; {1348#(<= |ULTIMATE.start_main_~y~0#1| 32)} is VALID [2022-02-21 03:05:29,860 INFO L290 TraceCheckUtils]: 51: Hoare triple {1348#(<= |ULTIMATE.start_main_~y~0#1| 32)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1349#(<= |ULTIMATE.start_main_~y~0#1| 33)} is VALID [2022-02-21 03:05:29,861 INFO L290 TraceCheckUtils]: 52: Hoare triple {1349#(<= |ULTIMATE.start_main_~y~0#1| 33)} assume !!(main_~x~0#1 >= 0); {1349#(<= |ULTIMATE.start_main_~y~0#1| 33)} is VALID [2022-02-21 03:05:29,861 INFO L290 TraceCheckUtils]: 53: Hoare triple {1349#(<= |ULTIMATE.start_main_~y~0#1| 33)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1349#(<= |ULTIMATE.start_main_~y~0#1| 33)} is VALID [2022-02-21 03:05:29,861 INFO L290 TraceCheckUtils]: 54: Hoare triple {1349#(<= |ULTIMATE.start_main_~y~0#1| 33)} 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| 33)} is VALID [2022-02-21 03:05:29,862 INFO L290 TraceCheckUtils]: 55: Hoare triple {1349#(<= |ULTIMATE.start_main_~y~0#1| 33)} assume 1 + main_~y~0#1 <= 2147483647; {1349#(<= |ULTIMATE.start_main_~y~0#1| 33)} is VALID [2022-02-21 03:05:29,862 INFO L290 TraceCheckUtils]: 56: Hoare triple {1349#(<= |ULTIMATE.start_main_~y~0#1| 33)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1350#(<= |ULTIMATE.start_main_~y~0#1| 34)} is VALID [2022-02-21 03:05:29,863 INFO L290 TraceCheckUtils]: 57: Hoare triple {1350#(<= |ULTIMATE.start_main_~y~0#1| 34)} assume !!(main_~x~0#1 >= 0); {1350#(<= |ULTIMATE.start_main_~y~0#1| 34)} is VALID [2022-02-21 03:05:29,863 INFO L290 TraceCheckUtils]: 58: Hoare triple {1350#(<= |ULTIMATE.start_main_~y~0#1| 34)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1350#(<= |ULTIMATE.start_main_~y~0#1| 34)} is VALID [2022-02-21 03:05:29,863 INFO L290 TraceCheckUtils]: 59: Hoare triple {1350#(<= |ULTIMATE.start_main_~y~0#1| 34)} 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| 34)} is VALID [2022-02-21 03:05:29,864 INFO L290 TraceCheckUtils]: 60: Hoare triple {1350#(<= |ULTIMATE.start_main_~y~0#1| 34)} assume 1 + main_~y~0#1 <= 2147483647; {1350#(<= |ULTIMATE.start_main_~y~0#1| 34)} is VALID [2022-02-21 03:05:29,865 INFO L290 TraceCheckUtils]: 61: Hoare triple {1350#(<= |ULTIMATE.start_main_~y~0#1| 34)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1351#(<= |ULTIMATE.start_main_~y~0#1| 35)} is VALID [2022-02-21 03:05:29,865 INFO L290 TraceCheckUtils]: 62: Hoare triple {1351#(<= |ULTIMATE.start_main_~y~0#1| 35)} assume !!(main_~x~0#1 >= 0); {1351#(<= |ULTIMATE.start_main_~y~0#1| 35)} is VALID [2022-02-21 03:05:29,866 INFO L290 TraceCheckUtils]: 63: Hoare triple {1351#(<= |ULTIMATE.start_main_~y~0#1| 35)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1351#(<= |ULTIMATE.start_main_~y~0#1| 35)} is VALID [2022-02-21 03:05:29,866 INFO L290 TraceCheckUtils]: 64: Hoare triple {1351#(<= |ULTIMATE.start_main_~y~0#1| 35)} 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| 35)} is VALID [2022-02-21 03:05:29,866 INFO L290 TraceCheckUtils]: 65: Hoare triple {1351#(<= |ULTIMATE.start_main_~y~0#1| 35)} assume 1 + main_~y~0#1 <= 2147483647; {1351#(<= |ULTIMATE.start_main_~y~0#1| 35)} is VALID [2022-02-21 03:05:29,867 INFO L290 TraceCheckUtils]: 66: Hoare triple {1351#(<= |ULTIMATE.start_main_~y~0#1| 35)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1352#(<= |ULTIMATE.start_main_~y~0#1| 36)} is VALID [2022-02-21 03:05:29,867 INFO L290 TraceCheckUtils]: 67: Hoare triple {1352#(<= |ULTIMATE.start_main_~y~0#1| 36)} assume !!(main_~x~0#1 >= 0); {1352#(<= |ULTIMATE.start_main_~y~0#1| 36)} is VALID [2022-02-21 03:05:29,868 INFO L290 TraceCheckUtils]: 68: Hoare triple {1352#(<= |ULTIMATE.start_main_~y~0#1| 36)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1352#(<= |ULTIMATE.start_main_~y~0#1| 36)} is VALID [2022-02-21 03:05:29,869 INFO L290 TraceCheckUtils]: 69: Hoare triple {1352#(<= |ULTIMATE.start_main_~y~0#1| 36)} 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| 36)} is VALID [2022-02-21 03:05:29,869 INFO L290 TraceCheckUtils]: 70: Hoare triple {1352#(<= |ULTIMATE.start_main_~y~0#1| 36)} assume 1 + main_~y~0#1 <= 2147483647; {1352#(<= |ULTIMATE.start_main_~y~0#1| 36)} is VALID [2022-02-21 03:05:29,870 INFO L290 TraceCheckUtils]: 71: Hoare triple {1352#(<= |ULTIMATE.start_main_~y~0#1| 36)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1353#(<= |ULTIMATE.start_main_~y~0#1| 37)} is VALID [2022-02-21 03:05:29,870 INFO L290 TraceCheckUtils]: 72: Hoare triple {1353#(<= |ULTIMATE.start_main_~y~0#1| 37)} assume !!(main_~x~0#1 >= 0); {1353#(<= |ULTIMATE.start_main_~y~0#1| 37)} is VALID [2022-02-21 03:05:29,870 INFO L290 TraceCheckUtils]: 73: Hoare triple {1353#(<= |ULTIMATE.start_main_~y~0#1| 37)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1353#(<= |ULTIMATE.start_main_~y~0#1| 37)} is VALID [2022-02-21 03:05:29,870 INFO L290 TraceCheckUtils]: 74: Hoare triple {1353#(<= |ULTIMATE.start_main_~y~0#1| 37)} 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| 37)} is VALID [2022-02-21 03:05:29,871 INFO L290 TraceCheckUtils]: 75: Hoare triple {1353#(<= |ULTIMATE.start_main_~y~0#1| 37)} assume !(1 + main_~y~0#1 <= 2147483647); {1338#false} is VALID [2022-02-21 03:05:29,874 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:05:29,874 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:29,874 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434438999] [2022-02-21 03:05:29,875 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434438999] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:05:29,875 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657242351] [2022-02-21 03:05:29,875 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 03:05:29,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:05:29,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:05:29,892 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:05:29,893 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:05:29,940 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-02-21 03:05:29,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:05:29,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:05:29,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:29,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:05:41,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {1337#true} assume { :begin_inline_ULTIMATE.init } true; {1337#true} is VALID [2022-02-21 03:05:41,372 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 := 23; {1337#true} is VALID [2022-02-21 03:05:41,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {1337#true} assume !!(main_~x~0#1 >= 0); {1337#true} is VALID [2022-02-21 03:05:41,373 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:05:41,373 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:05:41,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {1337#true} assume 1 + main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:05:41,373 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:05:41,373 INFO L290 TraceCheckUtils]: 7: Hoare triple {1337#true} assume !!(main_~x~0#1 >= 0); {1337#true} is VALID [2022-02-21 03:05:41,373 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:05:41,374 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:05:41,374 INFO L290 TraceCheckUtils]: 10: Hoare triple {1337#true} assume 1 + main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:05:41,374 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:05:41,374 INFO L290 TraceCheckUtils]: 12: Hoare triple {1337#true} assume !!(main_~x~0#1 >= 0); {1337#true} is VALID [2022-02-21 03:05:41,374 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:05:41,374 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:05:41,374 INFO L290 TraceCheckUtils]: 15: Hoare triple {1337#true} assume 1 + main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:05:41,375 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:05:41,375 INFO L290 TraceCheckUtils]: 17: Hoare triple {1337#true} assume !!(main_~x~0#1 >= 0); {1337#true} is VALID [2022-02-21 03:05:41,375 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:05:41,375 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:05:41,375 INFO L290 TraceCheckUtils]: 20: Hoare triple {1337#true} assume 1 + main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:05:41,375 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:05:41,375 INFO L290 TraceCheckUtils]: 22: Hoare triple {1337#true} assume !!(main_~x~0#1 >= 0); {1337#true} is VALID [2022-02-21 03:05:41,376 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:05:41,376 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:05:41,376 INFO L290 TraceCheckUtils]: 25: Hoare triple {1337#true} assume 1 + main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:05:41,376 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:05:41,376 INFO L290 TraceCheckUtils]: 27: Hoare triple {1337#true} assume !!(main_~x~0#1 >= 0); {1337#true} is VALID [2022-02-21 03:05:41,376 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:05:41,376 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:05:41,377 INFO L290 TraceCheckUtils]: 30: Hoare triple {1337#true} assume 1 + main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:05:41,377 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:05:41,377 INFO L290 TraceCheckUtils]: 32: Hoare triple {1337#true} assume !!(main_~x~0#1 >= 0); {1337#true} is VALID [2022-02-21 03:05:41,377 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:05:41,377 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:05:41,377 INFO L290 TraceCheckUtils]: 35: Hoare triple {1337#true} assume 1 + main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:05:41,377 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:05:41,378 INFO L290 TraceCheckUtils]: 37: Hoare triple {1337#true} assume !!(main_~x~0#1 >= 0); {1337#true} is VALID [2022-02-21 03:05:41,378 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:05:41,378 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:05:41,378 INFO L290 TraceCheckUtils]: 40: Hoare triple {1337#true} assume 1 + main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:05:41,378 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:05:41,378 INFO L290 TraceCheckUtils]: 42: Hoare triple {1337#true} assume !!(main_~x~0#1 >= 0); {1337#true} is VALID [2022-02-21 03:05:41,378 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:05:41,379 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:05:41,379 INFO L290 TraceCheckUtils]: 45: Hoare triple {1337#true} assume 1 + main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:05:41,379 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:05:41,379 INFO L290 TraceCheckUtils]: 47: Hoare triple {1337#true} assume !!(main_~x~0#1 >= 0); {1337#true} is VALID [2022-02-21 03:05:41,379 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:05:41,379 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:05:41,379 INFO L290 TraceCheckUtils]: 50: Hoare triple {1337#true} assume 1 + main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:05:41,380 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:05:41,380 INFO L290 TraceCheckUtils]: 52: Hoare triple {1337#true} assume !!(main_~x~0#1 >= 0); {1337#true} is VALID [2022-02-21 03:05:41,380 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:05:41,380 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:05:41,380 INFO L290 TraceCheckUtils]: 55: Hoare triple {1337#true} assume 1 + main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:05:41,380 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:05:41,380 INFO L290 TraceCheckUtils]: 57: Hoare triple {1337#true} assume !!(main_~x~0#1 >= 0); {1337#true} is VALID [2022-02-21 03:05:41,381 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:05:41,382 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:05:41,382 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:05:41,382 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:05:41,383 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:05:41,383 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:05:41,384 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:05:41,384 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:05:41,385 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:05:41,385 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:05:41,386 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:05:41,386 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:05:41,387 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:05:41,388 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:05:41,388 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:05:41,389 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:05:41,389 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:05:41,389 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:05:41,390 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:05:41,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:05:41,777 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:05:41,777 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:05:41,777 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:05:41,782 INFO L290 TraceCheckUtils]: 72: Hoare triple {1599#(or (not (<= 0 |ULTIMATE.start_main_~x~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 2147483646))} assume !!(main_~x~0#1 >= 0); {1589#(<= |ULTIMATE.start_main_~y~0#1| 2147483646)} is VALID [2022-02-21 03:05:41,784 INFO L290 TraceCheckUtils]: 71: Hoare triple {1603#(or (not (<= 0 |ULTIMATE.start_main_~x~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 2147483645))} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1599#(or (not (<= 0 |ULTIMATE.start_main_~x~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 2147483646))} is VALID [2022-02-21 03:05:41,790 INFO L290 TraceCheckUtils]: 70: Hoare triple {1603#(or (not (<= 0 |ULTIMATE.start_main_~x~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 2147483645))} assume 1 + main_~y~0#1 <= 2147483647; {1603#(or (not (<= 0 |ULTIMATE.start_main_~x~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 2147483645))} is VALID [2022-02-21 03:05:41,790 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 (not (<= 0 |ULTIMATE.start_main_~x~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 2147483645))} is VALID [2022-02-21 03:05:41,791 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:05:41,791 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:05:41,792 INFO L290 TraceCheckUtils]: 66: Hoare triple {1620#(or (<= |ULTIMATE.start_main_~x~0#1| 2147483645) (<= |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:05:41,792 INFO L290 TraceCheckUtils]: 65: Hoare triple {1620#(or (<= |ULTIMATE.start_main_~x~0#1| 2147483645) (<= |ULTIMATE.start_main_~y~0#1| 2147483644))} assume 1 + main_~y~0#1 <= 2147483647; {1620#(or (<= |ULTIMATE.start_main_~x~0#1| 2147483645) (<= |ULTIMATE.start_main_~y~0#1| 2147483644))} is VALID [2022-02-21 03:05:41,793 INFO L290 TraceCheckUtils]: 64: Hoare triple {1627#(<= |ULTIMATE.start_main_~x~0#1| 4294967290)} 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| 2147483645) (<= |ULTIMATE.start_main_~y~0#1| 2147483644))} is VALID [2022-02-21 03:05:41,793 INFO L290 TraceCheckUtils]: 63: Hoare triple {1627#(<= |ULTIMATE.start_main_~x~0#1| 4294967290)} assume main_~x~0#1 - main_~y~0#1 <= 2147483647; {1627#(<= |ULTIMATE.start_main_~x~0#1| 4294967290)} is VALID [2022-02-21 03:05:41,793 INFO L290 TraceCheckUtils]: 62: Hoare triple {1627#(<= |ULTIMATE.start_main_~x~0#1| 4294967290)} assume !!(main_~x~0#1 >= 0); {1627#(<= |ULTIMATE.start_main_~x~0#1| 4294967290)} is VALID [2022-02-21 03:05:41,793 INFO L290 TraceCheckUtils]: 61: Hoare triple {1627#(<= |ULTIMATE.start_main_~x~0#1| 4294967290)} assume 1 + main_~y~0#1 >= -2147483648;main_~y~0#1 := 1 + main_~y~0#1; {1627#(<= |ULTIMATE.start_main_~x~0#1| 4294967290)} is VALID [2022-02-21 03:05:41,794 INFO L290 TraceCheckUtils]: 60: Hoare triple {1627#(<= |ULTIMATE.start_main_~x~0#1| 4294967290)} assume 1 + main_~y~0#1 <= 2147483647; {1627#(<= |ULTIMATE.start_main_~x~0#1| 4294967290)} is VALID [2022-02-21 03:05:41,794 INFO L290 TraceCheckUtils]: 59: Hoare triple {1643#(<= |ULTIMATE.start_main_~x~0#1| (+ 4294967290 |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| 4294967290)} is VALID [2022-02-21 03:05:41,795 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| (+ 4294967290 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:05:41,795 INFO L290 TraceCheckUtils]: 57: Hoare triple {1337#true} assume !!(main_~x~0#1 >= 0); {1337#true} is VALID [2022-02-21 03:05:41,795 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:05:41,795 INFO L290 TraceCheckUtils]: 55: Hoare triple {1337#true} assume 1 + main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:05:41,795 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:05:41,795 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:05:41,795 INFO L290 TraceCheckUtils]: 52: Hoare triple {1337#true} assume !!(main_~x~0#1 >= 0); {1337#true} is VALID [2022-02-21 03:05:41,795 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:05:41,795 INFO L290 TraceCheckUtils]: 50: Hoare triple {1337#true} assume 1 + main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:05:41,795 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:05:41,795 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:05:41,796 INFO L290 TraceCheckUtils]: 47: Hoare triple {1337#true} assume !!(main_~x~0#1 >= 0); {1337#true} is VALID [2022-02-21 03:05:41,796 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:05:41,796 INFO L290 TraceCheckUtils]: 45: Hoare triple {1337#true} assume 1 + main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:05:41,796 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:05:41,796 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:05:41,796 INFO L290 TraceCheckUtils]: 42: Hoare triple {1337#true} assume !!(main_~x~0#1 >= 0); {1337#true} is VALID [2022-02-21 03:05:41,796 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:05:41,796 INFO L290 TraceCheckUtils]: 40: Hoare triple {1337#true} assume 1 + main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:05:41,796 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:05:41,796 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:05:41,796 INFO L290 TraceCheckUtils]: 37: Hoare triple {1337#true} assume !!(main_~x~0#1 >= 0); {1337#true} is VALID [2022-02-21 03:05:41,796 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:05:41,796 INFO L290 TraceCheckUtils]: 35: Hoare triple {1337#true} assume 1 + main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:05:41,796 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:05:41,797 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:05:41,797 INFO L290 TraceCheckUtils]: 32: Hoare triple {1337#true} assume !!(main_~x~0#1 >= 0); {1337#true} is VALID [2022-02-21 03:05:41,797 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:05:41,797 INFO L290 TraceCheckUtils]: 30: Hoare triple {1337#true} assume 1 + main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:05:41,797 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:05:41,797 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:05:41,797 INFO L290 TraceCheckUtils]: 27: Hoare triple {1337#true} assume !!(main_~x~0#1 >= 0); {1337#true} is VALID [2022-02-21 03:05:41,797 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:05:41,797 INFO L290 TraceCheckUtils]: 25: Hoare triple {1337#true} assume 1 + main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:05:41,797 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:05:41,797 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:05:41,798 INFO L290 TraceCheckUtils]: 22: Hoare triple {1337#true} assume !!(main_~x~0#1 >= 0); {1337#true} is VALID [2022-02-21 03:05:41,798 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:05:41,798 INFO L290 TraceCheckUtils]: 20: Hoare triple {1337#true} assume 1 + main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:05:41,798 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:05:41,798 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:05:41,798 INFO L290 TraceCheckUtils]: 17: Hoare triple {1337#true} assume !!(main_~x~0#1 >= 0); {1337#true} is VALID [2022-02-21 03:05:41,798 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:05:41,798 INFO L290 TraceCheckUtils]: 15: Hoare triple {1337#true} assume 1 + main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:05:41,798 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:05:41,798 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:05:41,798 INFO L290 TraceCheckUtils]: 12: Hoare triple {1337#true} assume !!(main_~x~0#1 >= 0); {1337#true} is VALID [2022-02-21 03:05:41,798 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:05:41,798 INFO L290 TraceCheckUtils]: 10: Hoare triple {1337#true} assume 1 + main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:05:41,799 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:05:41,799 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:05:41,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {1337#true} assume !!(main_~x~0#1 >= 0); {1337#true} is VALID [2022-02-21 03:05:41,799 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:05:41,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {1337#true} assume 1 + main_~y~0#1 <= 2147483647; {1337#true} is VALID [2022-02-21 03:05:41,799 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:05:41,799 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:05:41,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {1337#true} assume !!(main_~x~0#1 >= 0); {1337#true} is VALID [2022-02-21 03:05:41,800 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 := 23; {1337#true} is VALID [2022-02-21 03:05:41,800 INFO L290 TraceCheckUtils]: 0: Hoare triple {1337#true} assume { :begin_inline_ULTIMATE.init } true; {1337#true} is VALID [2022-02-21 03:05:41,800 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:05:41,800 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657242351] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:05:41,801 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:05:41,801 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8, 8] total 30 [2022-02-21 03:05:41,801 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905826778] [2022-02-21 03:05:41,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:05:41,802 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:05:41,802 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:41,802 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:05:41,879 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:05:41,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-02-21 03:05:41,879 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:41,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-02-21 03:05:41,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=651, Unknown=0, NotChecked=0, Total=930 [2022-02-21 03:05:41,880 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:05:43,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:43,509 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2022-02-21 03:05:43,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-02-21 03:05:43,510 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:05:43,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:05:43,510 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:05:43,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 85 transitions. [2022-02-21 03:05:43,511 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:05:43,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 85 transitions. [2022-02-21 03:05:43,512 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states and 85 transitions. [2022-02-21 03:05:43,578 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:05:43,578 INFO L225 Difference]: With dead ends: 84 [2022-02-21 03:05:43,578 INFO L226 Difference]: Without dead ends: 0 [2022-02-21 03:05:43,580 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1455 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1814, Invalid=4348, Unknown=0, NotChecked=0, Total=6162 [2022-02-21 03:05:43,580 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 163 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-21 03:05:43,580 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 10 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-21 03:05:43,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-21 03:05:43,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-21 03:05:43,581 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:05:43,581 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:05:43,581 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:05:43,581 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:05:43,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:43,581 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 03:05:43,581 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:05:43,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:43,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:43,581 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:05:43,582 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:05:43,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:43,582 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 03:05:43,582 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:05:43,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:43,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:43,582 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:05:43,582 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:05:43,582 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:05:43,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 03:05:43,582 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 76 [2022-02-21 03:05:43,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:43,583 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:05:43,583 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:05:43,583 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:05:43,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:43,585 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2022-02-21 03:05:43,585 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2022-02-21 03:05:43,585 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2022-02-21 03:05:43,585 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2022-02-21 03:05:43,615 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:05:43,795 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:05:43,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-21 03:05:43,964 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2022-02-21 03:05:43,964 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-21 03:05:43,964 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 19) no Hoare annotation was computed. [2022-02-21 03:05:43,965 INFO L861 garLoopResultBuilder]: At program point L21(lines 13 22) the Hoare annotation is: true [2022-02-21 03:05:43,965 INFO L858 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-02-21 03:05:43,965 INFO L858 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2022-02-21 03:05:43,965 INFO L854 garLoopResultBuilder]: At program point L17-2(lines 17 20) the Hoare annotation is: (let ((.cse0 (<= 24 |ULTIMATE.start_main_~y~0#1|))) (or (and (<= |ULTIMATE.start_main_~y~0#1| 24) .cse0 (<= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) 2147483648)) (and (<= 23 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| (+ 2147483624 |ULTIMATE.start_main_~y~0#1|)) (<= |ULTIMATE.start_main_~y~0#1| 23)) (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)) .cse0))) [2022-02-21 03:05:43,965 INFO L858 garLoopResultBuilder]: For program point L17-3(lines 17 20) no Hoare annotation was computed. [2022-02-21 03:05:43,965 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-21 03:05:43,965 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 18) no Hoare annotation was computed. [2022-02-21 03:05:43,965 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 19) no Hoare annotation was computed. [2022-02-21 03:05:43,965 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-21 03:05:43,965 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-21 03:05:43,965 INFO L858 garLoopResultBuilder]: For program point L18(line 18) no Hoare annotation was computed. [2022-02-21 03:05:43,965 INFO L858 garLoopResultBuilder]: For program point L18-1(line 18) no Hoare annotation was computed. [2022-02-21 03:05:43,967 INFO L732 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2022-02-21 03:05:43,968 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-21 03:05:43,971 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-21 03:05:43,971 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-21 03:05:43,971 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2022-02-21 03:05:43,971 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2022-02-21 03:05:43,971 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-21 03:05:43,971 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2022-02-21 03:05:43,972 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-21 03:05:43,972 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-21 03:05:43,972 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-21 03:05:43,972 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2022-02-21 03:05:43,972 WARN L170 areAnnotationChecker]: L18-1 has no Hoare annotation [2022-02-21 03:05:43,972 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-21 03:05:43,972 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-02-21 03:05:43,972 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-02-21 03:05:43,972 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2022-02-21 03:05:43,972 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2022-02-21 03:05:43,972 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:05:43,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.02 03:05:43 BoogieIcfgContainer [2022-02-21 03:05:43,981 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-21 03:05:43,982 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:05:43,982 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:05:43,982 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:05:43,982 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:05:25" (3/4) ... [2022-02-21 03:05:43,984 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-21 03:05:43,990 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-21 03:05:43,990 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-02-21 03:05:43,991 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-21 03:05:44,011 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 03:05:44,011 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:05:44,012 INFO L158 Benchmark]: Toolchain (without parser) took 18747.44ms. Allocated memory was 127.9MB in the beginning and 155.2MB in the end (delta: 27.3MB). Free memory was 93.2MB in the beginning and 79.4MB in the end (delta: 13.9MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. [2022-02-21 03:05:44,012 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 127.9MB. Free memory was 101.6MB in the beginning and 101.6MB in the end (delta: 21.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:05:44,012 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.20ms. Allocated memory is still 127.9MB. Free memory was 93.2MB in the beginning and 104.4MB in the end (delta: -11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:05:44,012 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.41ms. Allocated memory is still 127.9MB. Free memory was 104.4MB in the beginning and 103.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:05:44,012 INFO L158 Benchmark]: Boogie Preprocessor took 12.37ms. Allocated memory is still 127.9MB. Free memory was 103.1MB in the beginning and 102.3MB in the end (delta: 812.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:05:44,013 INFO L158 Benchmark]: RCFGBuilder took 284.93ms. Allocated memory is still 127.9MB. Free memory was 102.3MB in the beginning and 92.6MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:05:44,013 INFO L158 Benchmark]: TraceAbstraction took 18199.38ms. Allocated memory was 127.9MB in the beginning and 155.2MB in the end (delta: 27.3MB). Free memory was 91.8MB in the beginning and 81.5MB in the end (delta: 10.3MB). Peak memory consumption was 39.4MB. Max. memory is 16.1GB. [2022-02-21 03:05:44,013 INFO L158 Benchmark]: Witness Printer took 28.92ms. Allocated memory is still 155.2MB. Free memory was 81.5MB in the beginning and 79.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:05:44,016 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.11ms. Allocated memory is still 127.9MB. Free memory was 101.6MB in the beginning and 101.6MB in the end (delta: 21.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 190.20ms. Allocated memory is still 127.9MB. Free memory was 93.2MB in the beginning and 104.4MB in the end (delta: -11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.41ms. Allocated memory is still 127.9MB. Free memory was 104.4MB in the beginning and 103.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 12.37ms. Allocated memory is still 127.9MB. Free memory was 103.1MB in the beginning and 102.3MB in the end (delta: 812.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 284.93ms. Allocated memory is still 127.9MB. Free memory was 102.3MB in the beginning and 92.6MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 18199.38ms. Allocated memory was 127.9MB in the beginning and 155.2MB in the end (delta: 27.3MB). Free memory was 91.8MB in the beginning and 81.5MB in the end (delta: 10.3MB). Peak memory consumption was 39.4MB. Max. memory is 16.1GB. * Witness Printer took 28.92ms. Allocated memory is still 155.2MB. Free memory was 81.5MB in the beginning and 79.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. 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: 18]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 18]: 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: 19]: 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: 18.1s, OverallIterations: 8, TraceHistogramMax: 15, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 228 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 228 mSDsluCounter, 83 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 49 mSDsCounter, 172 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 322 IncrementalHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 172 mSolverCounterUnsat, 34 mSDtfsCounter, 322 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 374 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1484 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=7, InterpolantAutomatonStates: 103, 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, 44 HoareAnnotationTreeSize, 2 FomulaSimplifications, 131 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 2 FomulaSimplificationsInter, 573 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 13.4s InterpolantComputationTime, 310 NumberOfCodeBlocks, 260 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 431 ConstructedInterpolants, 0 QuantifiedInterpolants, 1172 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: 17]: Loop Invariant Derived loop invariant: (((y <= 24 && 24 <= y) && x + y <= 2147483648) || ((23 <= y && x <= 2147483624 + y) && y <= 23)) || ((y <= 2147483646 && y <= (-1 * x + 2147483648) / 2 + 1) && 24 <= y) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-02-21 03:05:44,043 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