./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/ChawdharyCookGulwaniSagivYang-ESOP2008-random1d.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/ChawdharyCookGulwaniSagivYang-ESOP2008-random1d.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 70ea356a4fda57b451264a060e40bb07db2fe648bea4e3256fcecf71a5a8e7b7 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:04:46,734 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:04:46,736 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:04:46,754 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:04:46,756 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:04:46,759 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:04:46,762 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:04:46,763 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:04:46,765 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:04:46,766 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:04:46,766 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:04:46,767 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:04:46,768 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:04:46,769 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:04:46,770 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:04:46,770 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:04:46,771 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:04:46,772 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:04:46,773 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:04:46,774 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:04:46,775 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:04:46,776 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:04:46,776 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:04:46,777 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:04:46,778 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:04:46,784 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:04:46,785 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:04:46,785 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:04:46,786 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:04:46,786 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:04:46,786 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:04:46,787 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:04:46,787 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:04:46,788 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:04:46,788 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:04:46,789 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:04:46,789 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:04:46,789 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:04:46,790 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:04:46,790 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:04:46,791 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:04:46,793 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-02-21 03:04:46,815 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:04:46,816 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:04:46,816 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:04:46,816 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:04:46,817 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:04:46,817 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:04:46,817 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:04:46,818 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:04:46,818 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:04:46,818 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:04:46,819 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:04:46,819 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:04:46,819 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:04:46,819 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:04:46,819 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:04:46,819 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:04:46,819 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:04:46,820 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:04:46,820 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:04:46,820 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:04:46,820 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:04:46,820 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:04:46,820 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:04:46,820 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:04:46,821 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:04:46,821 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:04:46,821 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:04:46,821 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:04:46,821 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:04:46,821 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:04:46,821 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 -> 70ea356a4fda57b451264a060e40bb07db2fe648bea4e3256fcecf71a5a8e7b7 [2022-02-21 03:04:46,995 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:04:47,011 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:04:47,013 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:04:47,014 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:04:47,016 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:04:47,016 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/ChawdharyCookGulwaniSagivYang-ESOP2008-random1d.c [2022-02-21 03:04:47,071 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd50d9305/355f1c342113406e89d16f9190d4225a/FLAG87c2b306b [2022-02-21 03:04:47,361 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:04:47,362 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/ChawdharyCookGulwaniSagivYang-ESOP2008-random1d.c [2022-02-21 03:04:47,366 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd50d9305/355f1c342113406e89d16f9190d4225a/FLAG87c2b306b [2022-02-21 03:04:47,808 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd50d9305/355f1c342113406e89d16f9190d4225a [2022-02-21 03:04:47,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:04:47,814 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:04:47,827 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:04:47,827 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:04:47,830 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:04:47,831 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:04:47" (1/1) ... [2022-02-21 03:04:47,832 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36f5f858 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:47, skipping insertion in model container [2022-02-21 03:04:47,832 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:04:47" (1/1) ... [2022-02-21 03:04:47,838 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:04:47,846 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:04:47,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:04:47,985 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:04:48,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:04:48,015 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:04:48,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:48 WrapperNode [2022-02-21 03:04:48,016 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:04:48,017 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:04:48,017 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:04:48,018 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:04:48,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:48" (1/1) ... [2022-02-21 03:04:48,027 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:48" (1/1) ... [2022-02-21 03:04:48,045 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 36 [2022-02-21 03:04:48,046 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:04:48,047 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:04:48,047 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:04:48,047 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:04:48,052 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:48" (1/1) ... [2022-02-21 03:04:48,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:48" (1/1) ... [2022-02-21 03:04:48,053 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:48" (1/1) ... [2022-02-21 03:04:48,054 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:48" (1/1) ... [2022-02-21 03:04:48,058 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:48" (1/1) ... [2022-02-21 03:04:48,062 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:48" (1/1) ... [2022-02-21 03:04:48,063 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:48" (1/1) ... [2022-02-21 03:04:48,068 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:04:48,069 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:04:48,069 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:04:48,069 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:04:48,070 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:48" (1/1) ... [2022-02-21 03:04:48,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:04:48,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:04:48,111 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-21 03:04:48,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-21 03:04:48,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:04:48,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:04:48,193 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:04:48,195 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:04:48,298 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:04:48,304 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:04:48,304 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:04:48,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:04:48 BoogieIcfgContainer [2022-02-21 03:04:48,305 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:04:48,307 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:04:48,307 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:04:48,309 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:04:48,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:04:47" (1/3) ... [2022-02-21 03:04:48,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@510ce6bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:04:48, skipping insertion in model container [2022-02-21 03:04:48,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:04:48" (2/3) ... [2022-02-21 03:04:48,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@510ce6bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:04:48, skipping insertion in model container [2022-02-21 03:04:48,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:04:48" (3/3) ... [2022-02-21 03:04:48,312 INFO L111 eAbstractionObserver]: Analyzing ICFG ChawdharyCookGulwaniSagivYang-ESOP2008-random1d.c [2022-02-21 03:04:48,315 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:04:48,315 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-02-21 03:04:48,349 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:04:48,354 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-21 03:04:48,355 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-02-21 03:04:48,393 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:48,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-21 03:04:48,397 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:48,397 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:04:48,398 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:04:48,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:48,401 INFO L85 PathProgramCache]: Analyzing trace with hash 889513677, now seen corresponding path program 1 times [2022-02-21 03:04:48,408 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:48,423 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591100099] [2022-02-21 03:04:48,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:48,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:48,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:48,571 INFO L290 TraceCheckUtils]: 0: Hoare triple {24#true} assume { :begin_inline_ULTIMATE.init } true; {24#true} is VALID [2022-02-21 03:04:48,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~a~0#1, main_~x~0#1, main_~max~0#1;havoc main_~a~0#1;havoc main_~x~0#1;havoc main_~max~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~a~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~max~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {24#true} is VALID [2022-02-21 03:04:48,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume main_~max~0#1 > 0;main_~a~0#1 := 0;main_~x~0#1 := 1; {26#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:04:48,579 INFO L290 TraceCheckUtils]: 3: Hoare triple {26#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {26#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:04:48,580 INFO L290 TraceCheckUtils]: 4: Hoare triple {26#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {26#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:04:48,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume !(1 + main_~a~0#1 <= 2147483647); {25#false} is VALID [2022-02-21 03:04:48,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:48,582 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:48,583 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591100099] [2022-02-21 03:04:48,584 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591100099] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:04:48,584 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:04:48,584 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:04:48,586 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167645908] [2022-02-21 03:04:48,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:04:48,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-02-21 03:04:48,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:48,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:48,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:48,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:04:48,612 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:48,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:04:48,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:04:48,629 INFO L87 Difference]: Start difference. First operand has 21 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 20 states have internal predecessors, (24), 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 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:48,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:48,716 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-02-21 03:04:48,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:04:48,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-02-21 03:04:48,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:48,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:48,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-02-21 03:04:48,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:48,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-02-21 03:04:48,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 47 transitions. [2022-02-21 03:04:48,780 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:48,787 INFO L225 Difference]: With dead ends: 41 [2022-02-21 03:04:48,788 INFO L226 Difference]: Without dead ends: 27 [2022-02-21 03:04:48,791 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:04:48,795 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 13 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:48,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 37 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:48,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-21 03:04:48,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2022-02-21 03:04:48,815 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:48,816 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 24 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:48,816 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 24 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:48,817 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 24 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:48,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:48,818 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-02-21 03:04:48,819 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-02-21 03:04:48,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:48,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:48,819 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 23 states have internal predecessors, (29), 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 27 states. [2022-02-21 03:04:48,820 INFO L87 Difference]: Start difference. First operand has 24 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 23 states have internal predecessors, (29), 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 27 states. [2022-02-21 03:04:48,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:48,821 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-02-21 03:04:48,821 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-02-21 03:04:48,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:48,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:48,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:48,822 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:48,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:48,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2022-02-21 03:04:48,824 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 6 [2022-02-21 03:04:48,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:48,825 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2022-02-21 03:04:48,825 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:48,825 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-02-21 03:04:48,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-21 03:04:48,825 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:48,826 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:04:48,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:04:48,826 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:04:48,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:48,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1805120262, now seen corresponding path program 1 times [2022-02-21 03:04:48,827 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:48,827 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242195268] [2022-02-21 03:04:48,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:48,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:48,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:48,851 INFO L290 TraceCheckUtils]: 0: Hoare triple {155#true} assume { :begin_inline_ULTIMATE.init } true; {155#true} is VALID [2022-02-21 03:04:48,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {155#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~a~0#1, main_~x~0#1, main_~max~0#1;havoc main_~a~0#1;havoc main_~x~0#1;havoc main_~max~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~a~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~max~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {155#true} is VALID [2022-02-21 03:04:48,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {155#true} assume main_~max~0#1 > 0;main_~a~0#1 := 0;main_~x~0#1 := 1; {157#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:04:48,852 INFO L290 TraceCheckUtils]: 3: Hoare triple {157#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {157#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:04:48,852 INFO L290 TraceCheckUtils]: 4: Hoare triple {157#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {157#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:04:48,853 INFO L290 TraceCheckUtils]: 5: Hoare triple {157#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume 1 + main_~a~0#1 <= 2147483647; {157#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:04:48,853 INFO L290 TraceCheckUtils]: 6: Hoare triple {157#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume !(1 + main_~a~0#1 >= -2147483648); {156#false} is VALID [2022-02-21 03:04:48,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:48,854 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:48,854 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242195268] [2022-02-21 03:04:48,854 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242195268] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:04:48,854 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:04:48,854 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:04:48,855 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67250487] [2022-02-21 03:04:48,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:04:48,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-21 03:04:48,856 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:48,856 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:48,876 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:48,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:04:48,876 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:48,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:04:48,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:04:48,877 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:48,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:48,914 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-02-21 03:04:48,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:04:48,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-21 03:04:48,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:48,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:48,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-02-21 03:04:48,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:48,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-02-21 03:04:48,917 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 33 transitions. [2022-02-21 03:04:48,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:48,941 INFO L225 Difference]: With dead ends: 41 [2022-02-21 03:04:48,941 INFO L226 Difference]: Without dead ends: 39 [2022-02-21 03:04:48,941 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:04:48,942 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:48,942 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 20 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:48,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-02-21 03:04:48,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2022-02-21 03:04:48,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:48,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 37 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 36 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:48,949 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 37 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 36 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:48,949 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 37 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 36 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:48,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:48,951 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2022-02-21 03:04:48,951 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2022-02-21 03:04:48,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:48,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:48,951 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 36 states have internal predecessors, (48), 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 39 states. [2022-02-21 03:04:48,952 INFO L87 Difference]: Start difference. First operand has 37 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 36 states have internal predecessors, (48), 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 39 states. [2022-02-21 03:04:48,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:48,953 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2022-02-21 03:04:48,954 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2022-02-21 03:04:48,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:48,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:48,954 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:48,954 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:48,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 36 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:48,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2022-02-21 03:04:48,956 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 7 [2022-02-21 03:04:48,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:48,956 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2022-02-21 03:04:48,956 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:48,956 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2022-02-21 03:04:48,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-21 03:04:48,957 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:48,957 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:04:48,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 03:04:48,957 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:04:48,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:48,958 INFO L85 PathProgramCache]: Analyzing trace with hash 124153334, now seen corresponding path program 1 times [2022-02-21 03:04:48,958 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:48,958 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050413192] [2022-02-21 03:04:48,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:48,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:48,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:48,982 INFO L290 TraceCheckUtils]: 0: Hoare triple {324#true} assume { :begin_inline_ULTIMATE.init } true; {324#true} is VALID [2022-02-21 03:04:48,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {324#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~a~0#1, main_~x~0#1, main_~max~0#1;havoc main_~a~0#1;havoc main_~x~0#1;havoc main_~max~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~a~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~max~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {324#true} is VALID [2022-02-21 03:04:48,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {324#true} assume main_~max~0#1 > 0;main_~a~0#1 := 0;main_~x~0#1 := 1; {326#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:04:48,984 INFO L290 TraceCheckUtils]: 3: Hoare triple {326#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {326#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:04:48,984 INFO L290 TraceCheckUtils]: 4: Hoare triple {326#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {326#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:04:48,985 INFO L290 TraceCheckUtils]: 5: Hoare triple {326#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 1 + main_~a~0#1 <= 2147483647; {326#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:04:48,985 INFO L290 TraceCheckUtils]: 6: Hoare triple {326#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {326#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:04:48,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {326#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !(1 + main_~x~0#1 <= 2147483647); {325#false} is VALID [2022-02-21 03:04:48,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:48,986 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:48,986 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050413192] [2022-02-21 03:04:48,986 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050413192] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:04:48,986 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:04:48,986 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:04:48,987 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678420564] [2022-02-21 03:04:48,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:04:48,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2022-02-21 03:04:48,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:48,988 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:48,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:48,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:04:48,994 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:48,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:04:48,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:04:48,994 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:49,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:49,026 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2022-02-21 03:04:49,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:04:49,026 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2022-02-21 03:04:49,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:49,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:49,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-02-21 03:04:49,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:49,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-02-21 03:04:49,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 29 transitions. [2022-02-21 03:04:49,048 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:49,052 INFO L225 Difference]: With dead ends: 43 [2022-02-21 03:04:49,053 INFO L226 Difference]: Without dead ends: 42 [2022-02-21 03:04:49,053 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:04:49,054 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:49,059 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 25 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:49,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-02-21 03:04:49,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2022-02-21 03:04:49,068 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:49,069 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 40 states, 34 states have (on average 1.5) internal successors, (51), 39 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:49,069 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 40 states, 34 states have (on average 1.5) internal successors, (51), 39 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:49,070 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 40 states, 34 states have (on average 1.5) internal successors, (51), 39 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:49,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:49,073 INFO L93 Difference]: Finished difference Result 42 states and 55 transitions. [2022-02-21 03:04:49,073 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2022-02-21 03:04:49,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:49,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:49,074 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 34 states have (on average 1.5) internal successors, (51), 39 states have internal predecessors, (51), 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 42 states. [2022-02-21 03:04:49,074 INFO L87 Difference]: Start difference. First operand has 40 states, 34 states have (on average 1.5) internal successors, (51), 39 states have internal predecessors, (51), 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 42 states. [2022-02-21 03:04:49,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:49,078 INFO L93 Difference]: Finished difference Result 42 states and 55 transitions. [2022-02-21 03:04:49,081 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2022-02-21 03:04:49,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:49,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:49,083 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:49,083 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:49,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.5) internal successors, (51), 39 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:49,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2022-02-21 03:04:49,086 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 8 [2022-02-21 03:04:49,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:49,086 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2022-02-21 03:04:49,086 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:49,089 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2022-02-21 03:04:49,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-21 03:04:49,090 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:49,090 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:04:49,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 03:04:49,091 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:04:49,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:49,092 INFO L85 PathProgramCache]: Analyzing trace with hash -446213880, now seen corresponding path program 1 times [2022-02-21 03:04:49,092 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:49,093 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444071663] [2022-02-21 03:04:49,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:49,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:49,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:49,126 INFO L290 TraceCheckUtils]: 0: Hoare triple {504#true} assume { :begin_inline_ULTIMATE.init } true; {504#true} is VALID [2022-02-21 03:04:49,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {504#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~a~0#1, main_~x~0#1, main_~max~0#1;havoc main_~a~0#1;havoc main_~x~0#1;havoc main_~max~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~a~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~max~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {504#true} is VALID [2022-02-21 03:04:49,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {504#true} assume main_~max~0#1 > 0;main_~a~0#1 := 0;main_~x~0#1 := 1; {506#(<= 1 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:04:49,127 INFO L290 TraceCheckUtils]: 3: Hoare triple {506#(<= 1 |ULTIMATE.start_main_~x~0#1|)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {506#(<= 1 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:04:49,127 INFO L290 TraceCheckUtils]: 4: Hoare triple {506#(<= 1 |ULTIMATE.start_main_~x~0#1|)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {506#(<= 1 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:04:49,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {506#(<= 1 |ULTIMATE.start_main_~x~0#1|)} assume 1 + main_~a~0#1 <= 2147483647; {506#(<= 1 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:04:49,128 INFO L290 TraceCheckUtils]: 6: Hoare triple {506#(<= 1 |ULTIMATE.start_main_~x~0#1|)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {506#(<= 1 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:04:49,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {506#(<= 1 |ULTIMATE.start_main_~x~0#1|)} assume 1 + main_~x~0#1 <= 2147483647; {506#(<= 1 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:04:49,129 INFO L290 TraceCheckUtils]: 8: Hoare triple {506#(<= 1 |ULTIMATE.start_main_~x~0#1|)} assume !(1 + main_~x~0#1 >= -2147483648); {505#false} is VALID [2022-02-21 03:04:49,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:49,129 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:49,129 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444071663] [2022-02-21 03:04:49,130 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444071663] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:04:49,130 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:04:49,130 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:04:49,130 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37709858] [2022-02-21 03:04:49,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:04:49,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-21 03:04:49,131 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:49,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:49,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:49,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:04:49,137 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:49,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:04:49,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:04:49,138 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:49,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:49,159 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2022-02-21 03:04:49,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:04:49,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-21 03:04:49,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:49,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:49,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2022-02-21 03:04:49,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:49,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2022-02-21 03:04:49,161 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 18 transitions. [2022-02-21 03:04:49,172 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:49,173 INFO L225 Difference]: With dead ends: 40 [2022-02-21 03:04:49,173 INFO L226 Difference]: Without dead ends: 39 [2022-02-21 03:04:49,174 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:04:49,175 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 8 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:49,175 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 14 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:49,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-02-21 03:04:49,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-02-21 03:04:49,185 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:49,185 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.411764705882353) internal successors, (48), 38 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:49,186 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.411764705882353) internal successors, (48), 38 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:49,186 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.411764705882353) internal successors, (48), 38 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:49,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:49,187 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2022-02-21 03:04:49,187 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2022-02-21 03:04:49,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:49,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:49,188 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.411764705882353) internal successors, (48), 38 states have internal predecessors, (48), 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 39 states. [2022-02-21 03:04:49,188 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.411764705882353) internal successors, (48), 38 states have internal predecessors, (48), 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 39 states. [2022-02-21 03:04:49,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:49,189 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2022-02-21 03:04:49,189 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2022-02-21 03:04:49,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:49,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:49,190 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:49,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:49,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.411764705882353) internal successors, (48), 38 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:49,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2022-02-21 03:04:49,196 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 9 [2022-02-21 03:04:49,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:49,196 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2022-02-21 03:04:49,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:49,197 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2022-02-21 03:04:49,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-21 03:04:49,197 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:49,197 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:04:49,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-21 03:04:49,198 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:04:49,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:49,198 INFO L85 PathProgramCache]: Analyzing trace with hash -233874170, now seen corresponding path program 1 times [2022-02-21 03:04:49,198 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:49,198 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103915780] [2022-02-21 03:04:49,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:49,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:49,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:49,230 INFO L290 TraceCheckUtils]: 0: Hoare triple {674#true} assume { :begin_inline_ULTIMATE.init } true; {674#true} is VALID [2022-02-21 03:04:49,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {674#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~a~0#1, main_~x~0#1, main_~max~0#1;havoc main_~a~0#1;havoc main_~x~0#1;havoc main_~max~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~a~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~max~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {674#true} is VALID [2022-02-21 03:04:49,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {674#true} assume main_~max~0#1 > 0;main_~a~0#1 := 0;main_~x~0#1 := 1; {676#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:04:49,232 INFO L290 TraceCheckUtils]: 3: Hoare triple {676#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {676#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:04:49,232 INFO L290 TraceCheckUtils]: 4: Hoare triple {676#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {676#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:04:49,232 INFO L290 TraceCheckUtils]: 5: Hoare triple {676#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume 1 + main_~a~0#1 <= 2147483647; {676#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:04:49,233 INFO L290 TraceCheckUtils]: 6: Hoare triple {676#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {677#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-21 03:04:49,233 INFO L290 TraceCheckUtils]: 7: Hoare triple {677#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume 1 + main_~x~0#1 <= 2147483647; {677#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-21 03:04:49,234 INFO L290 TraceCheckUtils]: 8: Hoare triple {677#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {677#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-21 03:04:49,234 INFO L290 TraceCheckUtils]: 9: Hoare triple {677#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {677#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-21 03:04:49,235 INFO L290 TraceCheckUtils]: 10: Hoare triple {677#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {677#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-21 03:04:49,235 INFO L290 TraceCheckUtils]: 11: Hoare triple {677#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !(1 + main_~a~0#1 <= 2147483647); {675#false} is VALID [2022-02-21 03:04:49,236 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:49,236 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:49,236 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103915780] [2022-02-21 03:04:49,236 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103915780] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:04:49,236 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292557677] [2022-02-21 03:04:49,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:49,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:04:49,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:04:49,238 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:04:49,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-21 03:04:49,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:49,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:04:49,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:49,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:04:49,347 INFO L290 TraceCheckUtils]: 0: Hoare triple {674#true} assume { :begin_inline_ULTIMATE.init } true; {674#true} is VALID [2022-02-21 03:04:49,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {674#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~a~0#1, main_~x~0#1, main_~max~0#1;havoc main_~a~0#1;havoc main_~x~0#1;havoc main_~max~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~a~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~max~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {674#true} is VALID [2022-02-21 03:04:49,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {674#true} assume main_~max~0#1 > 0;main_~a~0#1 := 0;main_~x~0#1 := 1; {676#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:04:49,349 INFO L290 TraceCheckUtils]: 3: Hoare triple {676#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {676#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:04:49,349 INFO L290 TraceCheckUtils]: 4: Hoare triple {676#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {676#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:04:49,349 INFO L290 TraceCheckUtils]: 5: Hoare triple {676#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume 1 + main_~a~0#1 <= 2147483647; {676#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:04:49,350 INFO L290 TraceCheckUtils]: 6: Hoare triple {676#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {677#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-21 03:04:49,350 INFO L290 TraceCheckUtils]: 7: Hoare triple {677#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume 1 + main_~x~0#1 <= 2147483647; {677#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-21 03:04:49,351 INFO L290 TraceCheckUtils]: 8: Hoare triple {677#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {677#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-21 03:04:49,351 INFO L290 TraceCheckUtils]: 9: Hoare triple {677#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {677#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-21 03:04:49,351 INFO L290 TraceCheckUtils]: 10: Hoare triple {677#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {677#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-21 03:04:49,352 INFO L290 TraceCheckUtils]: 11: Hoare triple {677#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !(1 + main_~a~0#1 <= 2147483647); {675#false} is VALID [2022-02-21 03:04:49,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:49,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:04:49,433 INFO L290 TraceCheckUtils]: 11: Hoare triple {714#(<= |ULTIMATE.start_main_~a~0#1| 2147483646)} assume !(1 + main_~a~0#1 <= 2147483647); {675#false} is VALID [2022-02-21 03:04:49,433 INFO L290 TraceCheckUtils]: 10: Hoare triple {714#(<= |ULTIMATE.start_main_~a~0#1| 2147483646)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {714#(<= |ULTIMATE.start_main_~a~0#1| 2147483646)} is VALID [2022-02-21 03:04:49,434 INFO L290 TraceCheckUtils]: 9: Hoare triple {714#(<= |ULTIMATE.start_main_~a~0#1| 2147483646)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {714#(<= |ULTIMATE.start_main_~a~0#1| 2147483646)} is VALID [2022-02-21 03:04:49,434 INFO L290 TraceCheckUtils]: 8: Hoare triple {714#(<= |ULTIMATE.start_main_~a~0#1| 2147483646)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {714#(<= |ULTIMATE.start_main_~a~0#1| 2147483646)} is VALID [2022-02-21 03:04:49,434 INFO L290 TraceCheckUtils]: 7: Hoare triple {714#(<= |ULTIMATE.start_main_~a~0#1| 2147483646)} assume 1 + main_~x~0#1 <= 2147483647; {714#(<= |ULTIMATE.start_main_~a~0#1| 2147483646)} is VALID [2022-02-21 03:04:49,435 INFO L290 TraceCheckUtils]: 6: Hoare triple {730#(<= |ULTIMATE.start_main_~a~0#1| 2147483645)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {714#(<= |ULTIMATE.start_main_~a~0#1| 2147483646)} is VALID [2022-02-21 03:04:49,435 INFO L290 TraceCheckUtils]: 5: Hoare triple {730#(<= |ULTIMATE.start_main_~a~0#1| 2147483645)} assume 1 + main_~a~0#1 <= 2147483647; {730#(<= |ULTIMATE.start_main_~a~0#1| 2147483645)} is VALID [2022-02-21 03:04:49,436 INFO L290 TraceCheckUtils]: 4: Hoare triple {730#(<= |ULTIMATE.start_main_~a~0#1| 2147483645)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {730#(<= |ULTIMATE.start_main_~a~0#1| 2147483645)} is VALID [2022-02-21 03:04:49,436 INFO L290 TraceCheckUtils]: 3: Hoare triple {730#(<= |ULTIMATE.start_main_~a~0#1| 2147483645)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {730#(<= |ULTIMATE.start_main_~a~0#1| 2147483645)} is VALID [2022-02-21 03:04:49,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {674#true} assume main_~max~0#1 > 0;main_~a~0#1 := 0;main_~x~0#1 := 1; {730#(<= |ULTIMATE.start_main_~a~0#1| 2147483645)} is VALID [2022-02-21 03:04:49,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {674#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~a~0#1, main_~x~0#1, main_~max~0#1;havoc main_~a~0#1;havoc main_~x~0#1;havoc main_~max~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~a~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~max~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {674#true} is VALID [2022-02-21 03:04:49,436 INFO L290 TraceCheckUtils]: 0: Hoare triple {674#true} assume { :begin_inline_ULTIMATE.init } true; {674#true} is VALID [2022-02-21 03:04:49,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:49,437 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292557677] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:04:49,437 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:04:49,437 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-02-21 03:04:49,437 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95914909] [2022-02-21 03:04:49,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:04:49,437 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 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 12 [2022-02-21 03:04:49,438 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:49,438 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:49,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:49,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 03:04:49,449 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:49,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:04:49,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:04:49,449 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:49,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:49,563 INFO L93 Difference]: Finished difference Result 98 states and 135 transitions. [2022-02-21 03:04:49,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:04:49,563 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 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 12 [2022-02-21 03:04:49,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:49,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:49,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-02-21 03:04:49,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:49,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-02-21 03:04:49,567 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 71 transitions. [2022-02-21 03:04:49,601 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:49,604 INFO L225 Difference]: With dead ends: 98 [2022-02-21 03:04:49,604 INFO L226 Difference]: Without dead ends: 96 [2022-02-21 03:04:49,606 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:04:49,609 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 31 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:49,609 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 41 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:49,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-02-21 03:04:49,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 79. [2022-02-21 03:04:49,644 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:49,644 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 79 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 78 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:49,644 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 79 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 78 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:49,645 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 79 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 78 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:49,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:49,647 INFO L93 Difference]: Finished difference Result 96 states and 121 transitions. [2022-02-21 03:04:49,647 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 121 transitions. [2022-02-21 03:04:49,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:49,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:49,652 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 78 states have internal predecessors, (103), 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 96 states. [2022-02-21 03:04:49,653 INFO L87 Difference]: Start difference. First operand has 79 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 78 states have internal predecessors, (103), 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 96 states. [2022-02-21 03:04:49,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:49,655 INFO L93 Difference]: Finished difference Result 96 states and 121 transitions. [2022-02-21 03:04:49,655 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 121 transitions. [2022-02-21 03:04:49,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:49,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:49,672 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:49,672 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:49,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 78 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:49,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 103 transitions. [2022-02-21 03:04:49,674 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 103 transitions. Word has length 12 [2022-02-21 03:04:49,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:49,674 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 103 transitions. [2022-02-21 03:04:49,675 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:49,675 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 103 transitions. [2022-02-21 03:04:49,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-21 03:04:49,675 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:49,675 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:04:49,694 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:04:49,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:04:49,876 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:04:49,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:49,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1982025395, now seen corresponding path program 1 times [2022-02-21 03:04:49,877 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:49,877 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207168840] [2022-02-21 03:04:49,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:49,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:49,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:49,941 INFO L290 TraceCheckUtils]: 0: Hoare triple {1138#true} assume { :begin_inline_ULTIMATE.init } true; {1138#true} is VALID [2022-02-21 03:04:49,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {1138#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~a~0#1, main_~x~0#1, main_~max~0#1;havoc main_~a~0#1;havoc main_~x~0#1;havoc main_~max~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~a~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~max~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {1138#true} is VALID [2022-02-21 03:04:49,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {1138#true} assume main_~max~0#1 > 0;main_~a~0#1 := 0;main_~x~0#1 := 1; {1140#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:04:49,943 INFO L290 TraceCheckUtils]: 3: Hoare triple {1140#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {1140#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:04:49,943 INFO L290 TraceCheckUtils]: 4: Hoare triple {1140#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {1140#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:04:49,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {1140#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume main_~a~0#1 - 1 <= 2147483647; {1140#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:04:49,945 INFO L290 TraceCheckUtils]: 6: Hoare triple {1140#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {1141#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:04:49,946 INFO L290 TraceCheckUtils]: 7: Hoare triple {1141#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume 1 + main_~x~0#1 <= 2147483647; {1141#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:04:49,946 INFO L290 TraceCheckUtils]: 8: Hoare triple {1141#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {1141#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:04:49,947 INFO L290 TraceCheckUtils]: 9: Hoare triple {1141#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {1141#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:04:49,948 INFO L290 TraceCheckUtils]: 10: Hoare triple {1141#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {1141#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:04:49,949 INFO L290 TraceCheckUtils]: 11: Hoare triple {1141#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume 1 + main_~a~0#1 <= 2147483647; {1141#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:04:49,949 INFO L290 TraceCheckUtils]: 12: Hoare triple {1141#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume !(1 + main_~a~0#1 >= -2147483648); {1139#false} is VALID [2022-02-21 03:04:49,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:49,950 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:49,950 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207168840] [2022-02-21 03:04:49,950 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207168840] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:04:49,951 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108331407] [2022-02-21 03:04:49,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:49,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:04:49,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:04:49,959 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:04:49,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-21 03:04:49,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:49,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:04:50,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:50,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:04:50,052 INFO L290 TraceCheckUtils]: 0: Hoare triple {1138#true} assume { :begin_inline_ULTIMATE.init } true; {1138#true} is VALID [2022-02-21 03:04:50,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {1138#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~a~0#1, main_~x~0#1, main_~max~0#1;havoc main_~a~0#1;havoc main_~x~0#1;havoc main_~max~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~a~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~max~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {1138#true} is VALID [2022-02-21 03:04:50,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {1138#true} assume main_~max~0#1 > 0;main_~a~0#1 := 0;main_~x~0#1 := 1; {1140#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:04:50,054 INFO L290 TraceCheckUtils]: 3: Hoare triple {1140#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {1140#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:04:50,054 INFO L290 TraceCheckUtils]: 4: Hoare triple {1140#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {1140#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:04:50,054 INFO L290 TraceCheckUtils]: 5: Hoare triple {1140#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume main_~a~0#1 - 1 <= 2147483647; {1140#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:04:50,055 INFO L290 TraceCheckUtils]: 6: Hoare triple {1140#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {1141#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:04:50,055 INFO L290 TraceCheckUtils]: 7: Hoare triple {1141#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume 1 + main_~x~0#1 <= 2147483647; {1141#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:04:50,056 INFO L290 TraceCheckUtils]: 8: Hoare triple {1141#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {1141#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:04:50,056 INFO L290 TraceCheckUtils]: 9: Hoare triple {1141#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {1141#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:04:50,056 INFO L290 TraceCheckUtils]: 10: Hoare triple {1141#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {1141#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:04:50,057 INFO L290 TraceCheckUtils]: 11: Hoare triple {1141#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume 1 + main_~a~0#1 <= 2147483647; {1141#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:04:50,057 INFO L290 TraceCheckUtils]: 12: Hoare triple {1141#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume !(1 + main_~a~0#1 >= -2147483648); {1139#false} is VALID [2022-02-21 03:04:50,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:50,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:04:50,114 INFO L290 TraceCheckUtils]: 12: Hoare triple {1181#(<= 0 (+ 2147483649 |ULTIMATE.start_main_~a~0#1|))} assume !(1 + main_~a~0#1 >= -2147483648); {1139#false} is VALID [2022-02-21 03:04:50,115 INFO L290 TraceCheckUtils]: 11: Hoare triple {1181#(<= 0 (+ 2147483649 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~a~0#1 <= 2147483647; {1181#(<= 0 (+ 2147483649 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:50,115 INFO L290 TraceCheckUtils]: 10: Hoare triple {1181#(<= 0 (+ 2147483649 |ULTIMATE.start_main_~a~0#1|))} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {1181#(<= 0 (+ 2147483649 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:50,115 INFO L290 TraceCheckUtils]: 9: Hoare triple {1181#(<= 0 (+ 2147483649 |ULTIMATE.start_main_~a~0#1|))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {1181#(<= 0 (+ 2147483649 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:50,116 INFO L290 TraceCheckUtils]: 8: Hoare triple {1181#(<= 0 (+ 2147483649 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {1181#(<= 0 (+ 2147483649 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:50,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {1181#(<= 0 (+ 2147483649 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 <= 2147483647; {1181#(<= 0 (+ 2147483649 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:50,117 INFO L290 TraceCheckUtils]: 6: Hoare triple {1200#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483648))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {1181#(<= 0 (+ 2147483649 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:50,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {1200#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483648))} assume main_~a~0#1 - 1 <= 2147483647; {1200#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483648))} is VALID [2022-02-21 03:04:50,117 INFO L290 TraceCheckUtils]: 4: Hoare triple {1200#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483648))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {1200#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483648))} is VALID [2022-02-21 03:04:50,118 INFO L290 TraceCheckUtils]: 3: Hoare triple {1200#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483648))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {1200#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483648))} is VALID [2022-02-21 03:04:50,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {1138#true} assume main_~max~0#1 > 0;main_~a~0#1 := 0;main_~x~0#1 := 1; {1200#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483648))} is VALID [2022-02-21 03:04:50,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {1138#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~a~0#1, main_~x~0#1, main_~max~0#1;havoc main_~a~0#1;havoc main_~x~0#1;havoc main_~max~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~a~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~max~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {1138#true} is VALID [2022-02-21 03:04:50,119 INFO L290 TraceCheckUtils]: 0: Hoare triple {1138#true} assume { :begin_inline_ULTIMATE.init } true; {1138#true} is VALID [2022-02-21 03:04:50,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:50,119 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108331407] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:04:50,119 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:04:50,119 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-02-21 03:04:50,120 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365155835] [2022-02-21 03:04:50,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:04:50,120 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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 13 [2022-02-21 03:04:50,120 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:50,120 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:50,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:50,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 03:04:50,135 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:50,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:04:50,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:04:50,136 INFO L87 Difference]: Start difference. First operand 79 states and 103 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:50,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:50,213 INFO L93 Difference]: Finished difference Result 135 states and 186 transitions. [2022-02-21 03:04:50,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:04:50,214 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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 13 [2022-02-21 03:04:50,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:50,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:50,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-02-21 03:04:50,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:50,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-02-21 03:04:50,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 45 transitions. [2022-02-21 03:04:50,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:50,245 INFO L225 Difference]: With dead ends: 135 [2022-02-21 03:04:50,245 INFO L226 Difference]: Without dead ends: 133 [2022-02-21 03:04:50,246 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:04:50,246 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 29 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:50,247 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 24 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:50,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-02-21 03:04:50,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 99. [2022-02-21 03:04:50,269 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:50,269 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand has 99 states, 95 states have (on average 1.3473684210526315) internal successors, (128), 98 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:50,269 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand has 99 states, 95 states have (on average 1.3473684210526315) internal successors, (128), 98 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:50,270 INFO L87 Difference]: Start difference. First operand 133 states. Second operand has 99 states, 95 states have (on average 1.3473684210526315) internal successors, (128), 98 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:50,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:50,272 INFO L93 Difference]: Finished difference Result 133 states and 170 transitions. [2022-02-21 03:04:50,272 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 170 transitions. [2022-02-21 03:04:50,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:50,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:50,273 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 95 states have (on average 1.3473684210526315) internal successors, (128), 98 states have internal predecessors, (128), 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 133 states. [2022-02-21 03:04:50,273 INFO L87 Difference]: Start difference. First operand has 99 states, 95 states have (on average 1.3473684210526315) internal successors, (128), 98 states have internal predecessors, (128), 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 133 states. [2022-02-21 03:04:50,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:50,276 INFO L93 Difference]: Finished difference Result 133 states and 170 transitions. [2022-02-21 03:04:50,276 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 170 transitions. [2022-02-21 03:04:50,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:50,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:50,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:50,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:50,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 95 states have (on average 1.3473684210526315) internal successors, (128), 98 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:50,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 128 transitions. [2022-02-21 03:04:50,279 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 128 transitions. Word has length 13 [2022-02-21 03:04:50,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:50,279 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 128 transitions. [2022-02-21 03:04:50,279 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:50,279 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 128 transitions. [2022-02-21 03:04:50,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-21 03:04:50,280 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:50,280 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-02-21 03:04:50,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:04:50,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-02-21 03:04:50,498 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:04:50,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:50,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1414776337, now seen corresponding path program 1 times [2022-02-21 03:04:50,499 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:50,499 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785502265] [2022-02-21 03:04:50,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:50,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:50,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:50,546 INFO L290 TraceCheckUtils]: 0: Hoare triple {1748#true} assume { :begin_inline_ULTIMATE.init } true; {1748#true} is VALID [2022-02-21 03:04:50,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {1748#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~a~0#1, main_~x~0#1, main_~max~0#1;havoc main_~a~0#1;havoc main_~x~0#1;havoc main_~max~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~a~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~max~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {1748#true} is VALID [2022-02-21 03:04:50,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {1748#true} assume main_~max~0#1 > 0;main_~a~0#1 := 0;main_~x~0#1 := 1; {1750#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:04:50,547 INFO L290 TraceCheckUtils]: 3: Hoare triple {1750#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {1750#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:04:50,547 INFO L290 TraceCheckUtils]: 4: Hoare triple {1750#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {1750#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:04:50,548 INFO L290 TraceCheckUtils]: 5: Hoare triple {1750#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 1 + main_~a~0#1 <= 2147483647; {1750#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:04:50,548 INFO L290 TraceCheckUtils]: 6: Hoare triple {1750#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {1750#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:04:50,548 INFO L290 TraceCheckUtils]: 7: Hoare triple {1750#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 1 + main_~x~0#1 <= 2147483647; {1750#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:04:50,549 INFO L290 TraceCheckUtils]: 8: Hoare triple {1750#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {1751#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:04:50,549 INFO L290 TraceCheckUtils]: 9: Hoare triple {1751#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {1751#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:04:50,550 INFO L290 TraceCheckUtils]: 10: Hoare triple {1751#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {1751#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:04:50,550 INFO L290 TraceCheckUtils]: 11: Hoare triple {1751#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 1 + main_~a~0#1 <= 2147483647; {1751#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:04:50,550 INFO L290 TraceCheckUtils]: 12: Hoare triple {1751#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {1751#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:04:50,551 INFO L290 TraceCheckUtils]: 13: Hoare triple {1751#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume !(1 + main_~x~0#1 <= 2147483647); {1749#false} is VALID [2022-02-21 03:04:50,551 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:50,551 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:50,551 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785502265] [2022-02-21 03:04:50,551 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785502265] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:04:50,551 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024580311] [2022-02-21 03:04:50,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:50,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:04:50,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:04:50,579 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:04:50,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-21 03:04:50,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:50,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:04:50,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:50,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:04:50,678 INFO L290 TraceCheckUtils]: 0: Hoare triple {1748#true} assume { :begin_inline_ULTIMATE.init } true; {1748#true} is VALID [2022-02-21 03:04:50,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {1748#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~a~0#1, main_~x~0#1, main_~max~0#1;havoc main_~a~0#1;havoc main_~x~0#1;havoc main_~max~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~a~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~max~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {1748#true} is VALID [2022-02-21 03:04:50,682 INFO L290 TraceCheckUtils]: 2: Hoare triple {1748#true} assume main_~max~0#1 > 0;main_~a~0#1 := 0;main_~x~0#1 := 1; {1750#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:04:50,682 INFO L290 TraceCheckUtils]: 3: Hoare triple {1750#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {1750#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:04:50,682 INFO L290 TraceCheckUtils]: 4: Hoare triple {1750#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {1750#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:04:50,683 INFO L290 TraceCheckUtils]: 5: Hoare triple {1750#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 1 + main_~a~0#1 <= 2147483647; {1750#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:04:50,683 INFO L290 TraceCheckUtils]: 6: Hoare triple {1750#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {1750#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:04:50,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {1750#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 1 + main_~x~0#1 <= 2147483647; {1750#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:04:50,684 INFO L290 TraceCheckUtils]: 8: Hoare triple {1750#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {1751#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:04:50,684 INFO L290 TraceCheckUtils]: 9: Hoare triple {1751#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {1751#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:04:50,684 INFO L290 TraceCheckUtils]: 10: Hoare triple {1751#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {1751#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:04:50,685 INFO L290 TraceCheckUtils]: 11: Hoare triple {1751#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 1 + main_~a~0#1 <= 2147483647; {1751#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:04:50,685 INFO L290 TraceCheckUtils]: 12: Hoare triple {1751#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {1751#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:04:50,685 INFO L290 TraceCheckUtils]: 13: Hoare triple {1751#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume !(1 + main_~x~0#1 <= 2147483647); {1749#false} is VALID [2022-02-21 03:04:50,685 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:50,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:04:50,738 INFO L290 TraceCheckUtils]: 13: Hoare triple {1794#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} assume !(1 + main_~x~0#1 <= 2147483647); {1749#false} is VALID [2022-02-21 03:04:50,739 INFO L290 TraceCheckUtils]: 12: Hoare triple {1794#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {1794#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:04:50,739 INFO L290 TraceCheckUtils]: 11: Hoare triple {1794#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} assume 1 + main_~a~0#1 <= 2147483647; {1794#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:04:50,740 INFO L290 TraceCheckUtils]: 10: Hoare triple {1794#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {1794#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:04:50,740 INFO L290 TraceCheckUtils]: 9: Hoare triple {1794#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {1794#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:04:50,740 INFO L290 TraceCheckUtils]: 8: Hoare triple {1810#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {1794#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:04:50,741 INFO L290 TraceCheckUtils]: 7: Hoare triple {1810#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume 1 + main_~x~0#1 <= 2147483647; {1810#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:04:50,742 INFO L290 TraceCheckUtils]: 6: Hoare triple {1810#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {1810#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:04:50,742 INFO L290 TraceCheckUtils]: 5: Hoare triple {1810#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume 1 + main_~a~0#1 <= 2147483647; {1810#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:04:50,743 INFO L290 TraceCheckUtils]: 4: Hoare triple {1810#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {1810#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:04:50,743 INFO L290 TraceCheckUtils]: 3: Hoare triple {1810#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {1810#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:04:50,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {1748#true} assume main_~max~0#1 > 0;main_~a~0#1 := 0;main_~x~0#1 := 1; {1810#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:04:50,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {1748#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~a~0#1, main_~x~0#1, main_~max~0#1;havoc main_~a~0#1;havoc main_~x~0#1;havoc main_~max~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~a~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~max~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {1748#true} is VALID [2022-02-21 03:04:50,744 INFO L290 TraceCheckUtils]: 0: Hoare triple {1748#true} assume { :begin_inline_ULTIMATE.init } true; {1748#true} is VALID [2022-02-21 03:04:50,744 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:50,744 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024580311] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:04:50,744 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:04:50,744 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-02-21 03:04:50,745 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641800612] [2022-02-21 03:04:50,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:04:50,745 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 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 14 [2022-02-21 03:04:50,745 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:50,745 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:50,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:50,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 03:04:50,760 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:50,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:04:50,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:04:50,760 INFO L87 Difference]: Start difference. First operand 99 states and 128 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:50,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:50,852 INFO L93 Difference]: Finished difference Result 207 states and 268 transitions. [2022-02-21 03:04:50,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:04:50,852 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 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 14 [2022-02-21 03:04:50,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:50,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:50,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-02-21 03:04:50,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:50,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-02-21 03:04:50,855 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 56 transitions. [2022-02-21 03:04:50,904 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:50,907 INFO L225 Difference]: With dead ends: 207 [2022-02-21 03:04:50,907 INFO L226 Difference]: Without dead ends: 206 [2022-02-21 03:04:50,907 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:04:50,908 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 23 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:50,908 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 50 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:50,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-02-21 03:04:50,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2022-02-21 03:04:50,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:50,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 206 states. Second operand has 204 states, 200 states have (on average 1.24) internal successors, (248), 203 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:50,954 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand has 204 states, 200 states have (on average 1.24) internal successors, (248), 203 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:50,954 INFO L87 Difference]: Start difference. First operand 206 states. Second operand has 204 states, 200 states have (on average 1.24) internal successors, (248), 203 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:50,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:50,959 INFO L93 Difference]: Finished difference Result 206 states and 248 transitions. [2022-02-21 03:04:50,959 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 248 transitions. [2022-02-21 03:04:50,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:50,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:50,960 INFO L74 IsIncluded]: Start isIncluded. First operand has 204 states, 200 states have (on average 1.24) internal successors, (248), 203 states have internal predecessors, (248), 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 206 states. [2022-02-21 03:04:50,960 INFO L87 Difference]: Start difference. First operand has 204 states, 200 states have (on average 1.24) internal successors, (248), 203 states have internal predecessors, (248), 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 206 states. [2022-02-21 03:04:50,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:50,964 INFO L93 Difference]: Finished difference Result 206 states and 248 transitions. [2022-02-21 03:04:50,964 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 248 transitions. [2022-02-21 03:04:50,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:50,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:50,965 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:50,965 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:50,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 200 states have (on average 1.24) internal successors, (248), 203 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:50,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 248 transitions. [2022-02-21 03:04:50,970 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 248 transitions. Word has length 14 [2022-02-21 03:04:50,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:50,970 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 248 transitions. [2022-02-21 03:04:50,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:50,970 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 248 transitions. [2022-02-21 03:04:50,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-21 03:04:50,971 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:50,971 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1] [2022-02-21 03:04:50,997 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:04:51,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:04:51,198 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:04:51,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:51,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1022063642, now seen corresponding path program 1 times [2022-02-21 03:04:51,198 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:51,199 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863596908] [2022-02-21 03:04:51,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:51,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:51,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:51,240 INFO L290 TraceCheckUtils]: 0: Hoare triple {2709#true} assume { :begin_inline_ULTIMATE.init } true; {2709#true} is VALID [2022-02-21 03:04:51,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {2709#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~a~0#1, main_~x~0#1, main_~max~0#1;havoc main_~a~0#1;havoc main_~x~0#1;havoc main_~max~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~a~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~max~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {2709#true} is VALID [2022-02-21 03:04:51,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {2709#true} assume main_~max~0#1 > 0;main_~a~0#1 := 0;main_~x~0#1 := 1; {2711#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:04:51,241 INFO L290 TraceCheckUtils]: 3: Hoare triple {2711#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {2711#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:04:51,241 INFO L290 TraceCheckUtils]: 4: Hoare triple {2711#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {2711#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:04:51,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {2711#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume main_~a~0#1 - 1 <= 2147483647; {2711#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:04:51,242 INFO L290 TraceCheckUtils]: 6: Hoare triple {2711#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {2712#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:04:51,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {2712#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume 1 + main_~x~0#1 <= 2147483647; {2712#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:04:51,243 INFO L290 TraceCheckUtils]: 8: Hoare triple {2712#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {2712#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:04:51,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {2712#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {2712#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:04:51,244 INFO L290 TraceCheckUtils]: 10: Hoare triple {2712#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {2712#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:04:51,244 INFO L290 TraceCheckUtils]: 11: Hoare triple {2712#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume main_~a~0#1 - 1 <= 2147483647; {2712#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:04:51,244 INFO L290 TraceCheckUtils]: 12: Hoare triple {2712#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {2713#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:51,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {2713#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 <= 2147483647; {2713#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:51,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {2713#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {2713#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:51,246 INFO L290 TraceCheckUtils]: 15: Hoare triple {2713#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {2713#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:51,246 INFO L290 TraceCheckUtils]: 16: Hoare triple {2713#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {2713#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:51,246 INFO L290 TraceCheckUtils]: 17: Hoare triple {2713#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 <= 2147483647; {2713#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:51,247 INFO L290 TraceCheckUtils]: 18: Hoare triple {2713#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} assume !(main_~a~0#1 - 1 >= -2147483648); {2710#false} is VALID [2022-02-21 03:04:51,247 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:51,247 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:51,247 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863596908] [2022-02-21 03:04:51,247 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863596908] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:04:51,247 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350858599] [2022-02-21 03:04:51,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:51,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:04:51,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:04:51,249 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:04:51,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-21 03:04:51,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:51,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:04:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:51,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:04:51,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {2709#true} assume { :begin_inline_ULTIMATE.init } true; {2709#true} is VALID [2022-02-21 03:04:51,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {2709#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~a~0#1, main_~x~0#1, main_~max~0#1;havoc main_~a~0#1;havoc main_~x~0#1;havoc main_~max~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~a~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~max~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {2709#true} is VALID [2022-02-21 03:04:51,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {2709#true} assume main_~max~0#1 > 0;main_~a~0#1 := 0;main_~x~0#1 := 1; {2711#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:04:51,353 INFO L290 TraceCheckUtils]: 3: Hoare triple {2711#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {2711#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:04:51,353 INFO L290 TraceCheckUtils]: 4: Hoare triple {2711#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {2711#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:04:51,353 INFO L290 TraceCheckUtils]: 5: Hoare triple {2711#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume main_~a~0#1 - 1 <= 2147483647; {2711#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:04:51,354 INFO L290 TraceCheckUtils]: 6: Hoare triple {2711#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {2712#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:04:51,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {2712#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume 1 + main_~x~0#1 <= 2147483647; {2712#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:04:51,354 INFO L290 TraceCheckUtils]: 8: Hoare triple {2712#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {2712#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:04:51,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {2712#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {2712#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:04:51,355 INFO L290 TraceCheckUtils]: 10: Hoare triple {2712#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {2712#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:04:51,355 INFO L290 TraceCheckUtils]: 11: Hoare triple {2712#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume main_~a~0#1 - 1 <= 2147483647; {2712#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:04:51,356 INFO L290 TraceCheckUtils]: 12: Hoare triple {2712#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {2713#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:51,356 INFO L290 TraceCheckUtils]: 13: Hoare triple {2713#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 <= 2147483647; {2713#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:51,357 INFO L290 TraceCheckUtils]: 14: Hoare triple {2713#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {2713#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:51,357 INFO L290 TraceCheckUtils]: 15: Hoare triple {2713#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {2713#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:51,358 INFO L290 TraceCheckUtils]: 16: Hoare triple {2713#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {2713#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:51,358 INFO L290 TraceCheckUtils]: 17: Hoare triple {2713#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 <= 2147483647; {2713#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:51,359 INFO L290 TraceCheckUtils]: 18: Hoare triple {2713#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} assume !(main_~a~0#1 - 1 >= -2147483648); {2710#false} is VALID [2022-02-21 03:04:51,359 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:51,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:04:51,442 INFO L290 TraceCheckUtils]: 18: Hoare triple {2771#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~a~0#1|))} assume !(main_~a~0#1 - 1 >= -2147483648); {2710#false} is VALID [2022-02-21 03:04:51,442 INFO L290 TraceCheckUtils]: 17: Hoare triple {2771#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 <= 2147483647; {2771#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:51,443 INFO L290 TraceCheckUtils]: 16: Hoare triple {2771#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {2771#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:51,443 INFO L290 TraceCheckUtils]: 15: Hoare triple {2771#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~a~0#1|))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {2771#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:51,443 INFO L290 TraceCheckUtils]: 14: Hoare triple {2771#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {2771#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:51,444 INFO L290 TraceCheckUtils]: 13: Hoare triple {2771#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 <= 2147483647; {2771#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:51,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {2790#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483646))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {2771#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:51,445 INFO L290 TraceCheckUtils]: 11: Hoare triple {2790#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483646))} assume main_~a~0#1 - 1 <= 2147483647; {2790#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483646))} is VALID [2022-02-21 03:04:51,445 INFO L290 TraceCheckUtils]: 10: Hoare triple {2790#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483646))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {2790#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483646))} is VALID [2022-02-21 03:04:51,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {2790#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483646))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {2790#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483646))} is VALID [2022-02-21 03:04:51,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {2790#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483646))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {2790#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483646))} is VALID [2022-02-21 03:04:51,446 INFO L290 TraceCheckUtils]: 7: Hoare triple {2790#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483646))} assume 1 + main_~x~0#1 <= 2147483647; {2790#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483646))} is VALID [2022-02-21 03:04:51,446 INFO L290 TraceCheckUtils]: 6: Hoare triple {2809#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {2790#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483646))} is VALID [2022-02-21 03:04:51,447 INFO L290 TraceCheckUtils]: 5: Hoare triple {2809#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 <= 2147483647; {2809#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:51,447 INFO L290 TraceCheckUtils]: 4: Hoare triple {2809#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {2809#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:51,447 INFO L290 TraceCheckUtils]: 3: Hoare triple {2809#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~a~0#1|))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {2809#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:51,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {2709#true} assume main_~max~0#1 > 0;main_~a~0#1 := 0;main_~x~0#1 := 1; {2809#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:51,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {2709#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~a~0#1, main_~x~0#1, main_~max~0#1;havoc main_~a~0#1;havoc main_~x~0#1;havoc main_~max~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~a~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~max~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {2709#true} is VALID [2022-02-21 03:04:51,448 INFO L290 TraceCheckUtils]: 0: Hoare triple {2709#true} assume { :begin_inline_ULTIMATE.init } true; {2709#true} is VALID [2022-02-21 03:04:51,448 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:51,448 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350858599] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:04:51,448 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:04:51,449 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-21 03:04:51,449 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4518335] [2022-02-21 03:04:51,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:04:51,449 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 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 19 [2022-02-21 03:04:51,449 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:51,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:51,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:51,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-21 03:04:51,472 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:51,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-21 03:04:51,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:04:51,473 INFO L87 Difference]: Start difference. First operand 204 states and 248 transitions. Second operand has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:51,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:51,681 INFO L93 Difference]: Finished difference Result 399 states and 515 transitions. [2022-02-21 03:04:51,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 03:04:51,681 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 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 19 [2022-02-21 03:04:51,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:51,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:51,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2022-02-21 03:04:51,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:51,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2022-02-21 03:04:51,684 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 94 transitions. [2022-02-21 03:04:51,736 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:51,744 INFO L225 Difference]: With dead ends: 399 [2022-02-21 03:04:51,745 INFO L226 Difference]: Without dead ends: 398 [2022-02-21 03:04:51,745 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:04:51,745 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 71 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:51,746 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 48 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:51,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2022-02-21 03:04:51,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 330. [2022-02-21 03:04:51,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:51,840 INFO L82 GeneralOperation]: Start isEquivalent. First operand 398 states. Second operand has 330 states, 326 states have (on average 1.2760736196319018) internal successors, (416), 329 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:51,841 INFO L74 IsIncluded]: Start isIncluded. First operand 398 states. Second operand has 330 states, 326 states have (on average 1.2760736196319018) internal successors, (416), 329 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:51,841 INFO L87 Difference]: Start difference. First operand 398 states. Second operand has 330 states, 326 states have (on average 1.2760736196319018) internal successors, (416), 329 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:51,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:51,854 INFO L93 Difference]: Finished difference Result 398 states and 494 transitions. [2022-02-21 03:04:51,854 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 494 transitions. [2022-02-21 03:04:51,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:51,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:51,856 INFO L74 IsIncluded]: Start isIncluded. First operand has 330 states, 326 states have (on average 1.2760736196319018) internal successors, (416), 329 states have internal predecessors, (416), 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 398 states. [2022-02-21 03:04:51,856 INFO L87 Difference]: Start difference. First operand has 330 states, 326 states have (on average 1.2760736196319018) internal successors, (416), 329 states have internal predecessors, (416), 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 398 states. [2022-02-21 03:04:51,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:51,868 INFO L93 Difference]: Finished difference Result 398 states and 494 transitions. [2022-02-21 03:04:51,869 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 494 transitions. [2022-02-21 03:04:51,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:51,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:51,869 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:51,869 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:51,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 326 states have (on average 1.2760736196319018) internal successors, (416), 329 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:51,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 416 transitions. [2022-02-21 03:04:51,879 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 416 transitions. Word has length 19 [2022-02-21 03:04:51,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:51,879 INFO L470 AbstractCegarLoop]: Abstraction has 330 states and 416 transitions. [2022-02-21 03:04:51,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:51,880 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 416 transitions. [2022-02-21 03:04:51,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-21 03:04:51,880 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:51,880 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1] [2022-02-21 03:04:51,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:04:52,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:04:52,095 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:04:52,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:52,096 INFO L85 PathProgramCache]: Analyzing trace with hash -957667535, now seen corresponding path program 2 times [2022-02-21 03:04:52,096 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:52,096 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012311070] [2022-02-21 03:04:52,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:52,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:52,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:52,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {4447#true} assume { :begin_inline_ULTIMATE.init } true; {4447#true} is VALID [2022-02-21 03:04:52,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {4447#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~a~0#1, main_~x~0#1, main_~max~0#1;havoc main_~a~0#1;havoc main_~x~0#1;havoc main_~max~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~a~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~max~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {4447#true} is VALID [2022-02-21 03:04:52,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {4447#true} assume main_~max~0#1 > 0;main_~a~0#1 := 0;main_~x~0#1 := 1; {4449#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:04:52,170 INFO L290 TraceCheckUtils]: 3: Hoare triple {4449#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {4449#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:04:52,170 INFO L290 TraceCheckUtils]: 4: Hoare triple {4449#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {4449#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:04:52,171 INFO L290 TraceCheckUtils]: 5: Hoare triple {4449#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume 1 + main_~a~0#1 <= 2147483647; {4449#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:04:52,171 INFO L290 TraceCheckUtils]: 6: Hoare triple {4449#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {4450#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-21 03:04:52,172 INFO L290 TraceCheckUtils]: 7: Hoare triple {4450#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume 1 + main_~x~0#1 <= 2147483647; {4450#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-21 03:04:52,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {4450#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {4450#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-21 03:04:52,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {4450#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {4450#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-21 03:04:52,173 INFO L290 TraceCheckUtils]: 10: Hoare triple {4450#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {4450#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-21 03:04:52,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {4450#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume 1 + main_~a~0#1 <= 2147483647; {4450#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-21 03:04:52,174 INFO L290 TraceCheckUtils]: 12: Hoare triple {4450#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {4451#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-21 03:04:52,174 INFO L290 TraceCheckUtils]: 13: Hoare triple {4451#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume 1 + main_~x~0#1 <= 2147483647; {4451#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-21 03:04:52,174 INFO L290 TraceCheckUtils]: 14: Hoare triple {4451#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {4451#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-21 03:04:52,175 INFO L290 TraceCheckUtils]: 15: Hoare triple {4451#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {4451#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-21 03:04:52,175 INFO L290 TraceCheckUtils]: 16: Hoare triple {4451#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {4451#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-21 03:04:52,175 INFO L290 TraceCheckUtils]: 17: Hoare triple {4451#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume 1 + main_~a~0#1 <= 2147483647; {4451#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-21 03:04:52,176 INFO L290 TraceCheckUtils]: 18: Hoare triple {4451#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {4452#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-21 03:04:52,176 INFO L290 TraceCheckUtils]: 19: Hoare triple {4452#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume 1 + main_~x~0#1 <= 2147483647; {4452#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-21 03:04:52,177 INFO L290 TraceCheckUtils]: 20: Hoare triple {4452#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {4452#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-21 03:04:52,177 INFO L290 TraceCheckUtils]: 21: Hoare triple {4452#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {4452#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-21 03:04:52,177 INFO L290 TraceCheckUtils]: 22: Hoare triple {4452#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {4452#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-21 03:04:52,178 INFO L290 TraceCheckUtils]: 23: Hoare triple {4452#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume 1 + main_~a~0#1 <= 2147483647; {4452#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-21 03:04:52,178 INFO L290 TraceCheckUtils]: 24: Hoare triple {4452#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {4453#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-21 03:04:52,178 INFO L290 TraceCheckUtils]: 25: Hoare triple {4453#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume 1 + main_~x~0#1 <= 2147483647; {4453#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-21 03:04:52,179 INFO L290 TraceCheckUtils]: 26: Hoare triple {4453#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {4453#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-21 03:04:52,179 INFO L290 TraceCheckUtils]: 27: Hoare triple {4453#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {4453#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-21 03:04:52,180 INFO L290 TraceCheckUtils]: 28: Hoare triple {4453#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {4453#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-21 03:04:52,180 INFO L290 TraceCheckUtils]: 29: Hoare triple {4453#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume !(1 + main_~a~0#1 <= 2147483647); {4448#false} is VALID [2022-02-21 03:04:52,181 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:52,181 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:52,181 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012311070] [2022-02-21 03:04:52,181 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012311070] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:04:52,181 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093000769] [2022-02-21 03:04:52,181 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:04:52,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:04:52,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:04:52,182 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:04:52,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-21 03:04:52,221 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:04:52,222 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:04:52,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:04:52,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:52,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:04:52,343 INFO L290 TraceCheckUtils]: 0: Hoare triple {4447#true} assume { :begin_inline_ULTIMATE.init } true; {4447#true} is VALID [2022-02-21 03:04:52,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {4447#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~a~0#1, main_~x~0#1, main_~max~0#1;havoc main_~a~0#1;havoc main_~x~0#1;havoc main_~max~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~a~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~max~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {4447#true} is VALID [2022-02-21 03:04:52,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {4447#true} assume main_~max~0#1 > 0;main_~a~0#1 := 0;main_~x~0#1 := 1; {4449#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:04:52,344 INFO L290 TraceCheckUtils]: 3: Hoare triple {4449#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {4449#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:04:52,344 INFO L290 TraceCheckUtils]: 4: Hoare triple {4449#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {4449#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:04:52,345 INFO L290 TraceCheckUtils]: 5: Hoare triple {4449#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume 1 + main_~a~0#1 <= 2147483647; {4449#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:04:52,345 INFO L290 TraceCheckUtils]: 6: Hoare triple {4449#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {4450#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-21 03:04:52,345 INFO L290 TraceCheckUtils]: 7: Hoare triple {4450#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume 1 + main_~x~0#1 <= 2147483647; {4450#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-21 03:04:52,346 INFO L290 TraceCheckUtils]: 8: Hoare triple {4450#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {4450#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-21 03:04:52,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {4450#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {4450#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-21 03:04:52,346 INFO L290 TraceCheckUtils]: 10: Hoare triple {4450#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {4450#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-21 03:04:52,347 INFO L290 TraceCheckUtils]: 11: Hoare triple {4450#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume 1 + main_~a~0#1 <= 2147483647; {4450#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-21 03:04:52,347 INFO L290 TraceCheckUtils]: 12: Hoare triple {4450#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {4451#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-21 03:04:52,348 INFO L290 TraceCheckUtils]: 13: Hoare triple {4451#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume 1 + main_~x~0#1 <= 2147483647; {4451#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-21 03:04:52,349 INFO L290 TraceCheckUtils]: 14: Hoare triple {4451#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {4451#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-21 03:04:52,350 INFO L290 TraceCheckUtils]: 15: Hoare triple {4451#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {4451#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-21 03:04:52,351 INFO L290 TraceCheckUtils]: 16: Hoare triple {4451#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {4451#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-21 03:04:52,351 INFO L290 TraceCheckUtils]: 17: Hoare triple {4451#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume 1 + main_~a~0#1 <= 2147483647; {4451#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-21 03:04:52,352 INFO L290 TraceCheckUtils]: 18: Hoare triple {4451#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {4452#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-21 03:04:52,352 INFO L290 TraceCheckUtils]: 19: Hoare triple {4452#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume 1 + main_~x~0#1 <= 2147483647; {4452#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-21 03:04:52,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {4452#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {4452#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-21 03:04:52,354 INFO L290 TraceCheckUtils]: 21: Hoare triple {4452#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {4452#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-21 03:04:52,355 INFO L290 TraceCheckUtils]: 22: Hoare triple {4452#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {4452#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-21 03:04:52,355 INFO L290 TraceCheckUtils]: 23: Hoare triple {4452#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume 1 + main_~a~0#1 <= 2147483647; {4452#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-21 03:04:52,356 INFO L290 TraceCheckUtils]: 24: Hoare triple {4452#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {4453#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-21 03:04:52,356 INFO L290 TraceCheckUtils]: 25: Hoare triple {4453#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume 1 + main_~x~0#1 <= 2147483647; {4453#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-21 03:04:52,356 INFO L290 TraceCheckUtils]: 26: Hoare triple {4453#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {4453#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-21 03:04:52,357 INFO L290 TraceCheckUtils]: 27: Hoare triple {4453#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {4453#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-21 03:04:52,357 INFO L290 TraceCheckUtils]: 28: Hoare triple {4453#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {4453#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-21 03:04:52,357 INFO L290 TraceCheckUtils]: 29: Hoare triple {4453#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume !(1 + main_~a~0#1 <= 2147483647); {4448#false} is VALID [2022-02-21 03:04:52,358 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:52,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:04:52,507 INFO L290 TraceCheckUtils]: 29: Hoare triple {4544#(<= |ULTIMATE.start_main_~a~0#1| 2147483646)} assume !(1 + main_~a~0#1 <= 2147483647); {4448#false} is VALID [2022-02-21 03:04:52,508 INFO L290 TraceCheckUtils]: 28: Hoare triple {4544#(<= |ULTIMATE.start_main_~a~0#1| 2147483646)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {4544#(<= |ULTIMATE.start_main_~a~0#1| 2147483646)} is VALID [2022-02-21 03:04:52,508 INFO L290 TraceCheckUtils]: 27: Hoare triple {4544#(<= |ULTIMATE.start_main_~a~0#1| 2147483646)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {4544#(<= |ULTIMATE.start_main_~a~0#1| 2147483646)} is VALID [2022-02-21 03:04:52,508 INFO L290 TraceCheckUtils]: 26: Hoare triple {4544#(<= |ULTIMATE.start_main_~a~0#1| 2147483646)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {4544#(<= |ULTIMATE.start_main_~a~0#1| 2147483646)} is VALID [2022-02-21 03:04:52,509 INFO L290 TraceCheckUtils]: 25: Hoare triple {4544#(<= |ULTIMATE.start_main_~a~0#1| 2147483646)} assume 1 + main_~x~0#1 <= 2147483647; {4544#(<= |ULTIMATE.start_main_~a~0#1| 2147483646)} is VALID [2022-02-21 03:04:52,509 INFO L290 TraceCheckUtils]: 24: Hoare triple {4560#(<= |ULTIMATE.start_main_~a~0#1| 2147483645)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {4544#(<= |ULTIMATE.start_main_~a~0#1| 2147483646)} is VALID [2022-02-21 03:04:52,509 INFO L290 TraceCheckUtils]: 23: Hoare triple {4560#(<= |ULTIMATE.start_main_~a~0#1| 2147483645)} assume 1 + main_~a~0#1 <= 2147483647; {4560#(<= |ULTIMATE.start_main_~a~0#1| 2147483645)} is VALID [2022-02-21 03:04:52,510 INFO L290 TraceCheckUtils]: 22: Hoare triple {4560#(<= |ULTIMATE.start_main_~a~0#1| 2147483645)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {4560#(<= |ULTIMATE.start_main_~a~0#1| 2147483645)} is VALID [2022-02-21 03:04:52,510 INFO L290 TraceCheckUtils]: 21: Hoare triple {4560#(<= |ULTIMATE.start_main_~a~0#1| 2147483645)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {4560#(<= |ULTIMATE.start_main_~a~0#1| 2147483645)} is VALID [2022-02-21 03:04:52,510 INFO L290 TraceCheckUtils]: 20: Hoare triple {4560#(<= |ULTIMATE.start_main_~a~0#1| 2147483645)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {4560#(<= |ULTIMATE.start_main_~a~0#1| 2147483645)} is VALID [2022-02-21 03:04:52,510 INFO L290 TraceCheckUtils]: 19: Hoare triple {4560#(<= |ULTIMATE.start_main_~a~0#1| 2147483645)} assume 1 + main_~x~0#1 <= 2147483647; {4560#(<= |ULTIMATE.start_main_~a~0#1| 2147483645)} is VALID [2022-02-21 03:04:52,511 INFO L290 TraceCheckUtils]: 18: Hoare triple {4579#(<= |ULTIMATE.start_main_~a~0#1| 2147483644)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {4560#(<= |ULTIMATE.start_main_~a~0#1| 2147483645)} is VALID [2022-02-21 03:04:52,511 INFO L290 TraceCheckUtils]: 17: Hoare triple {4579#(<= |ULTIMATE.start_main_~a~0#1| 2147483644)} assume 1 + main_~a~0#1 <= 2147483647; {4579#(<= |ULTIMATE.start_main_~a~0#1| 2147483644)} is VALID [2022-02-21 03:04:52,511 INFO L290 TraceCheckUtils]: 16: Hoare triple {4579#(<= |ULTIMATE.start_main_~a~0#1| 2147483644)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {4579#(<= |ULTIMATE.start_main_~a~0#1| 2147483644)} is VALID [2022-02-21 03:04:52,511 INFO L290 TraceCheckUtils]: 15: Hoare triple {4579#(<= |ULTIMATE.start_main_~a~0#1| 2147483644)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {4579#(<= |ULTIMATE.start_main_~a~0#1| 2147483644)} is VALID [2022-02-21 03:04:52,512 INFO L290 TraceCheckUtils]: 14: Hoare triple {4579#(<= |ULTIMATE.start_main_~a~0#1| 2147483644)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {4579#(<= |ULTIMATE.start_main_~a~0#1| 2147483644)} is VALID [2022-02-21 03:04:52,512 INFO L290 TraceCheckUtils]: 13: Hoare triple {4579#(<= |ULTIMATE.start_main_~a~0#1| 2147483644)} assume 1 + main_~x~0#1 <= 2147483647; {4579#(<= |ULTIMATE.start_main_~a~0#1| 2147483644)} is VALID [2022-02-21 03:04:52,512 INFO L290 TraceCheckUtils]: 12: Hoare triple {4598#(<= |ULTIMATE.start_main_~a~0#1| 2147483643)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {4579#(<= |ULTIMATE.start_main_~a~0#1| 2147483644)} is VALID [2022-02-21 03:04:52,513 INFO L290 TraceCheckUtils]: 11: Hoare triple {4598#(<= |ULTIMATE.start_main_~a~0#1| 2147483643)} assume 1 + main_~a~0#1 <= 2147483647; {4598#(<= |ULTIMATE.start_main_~a~0#1| 2147483643)} is VALID [2022-02-21 03:04:52,513 INFO L290 TraceCheckUtils]: 10: Hoare triple {4598#(<= |ULTIMATE.start_main_~a~0#1| 2147483643)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {4598#(<= |ULTIMATE.start_main_~a~0#1| 2147483643)} is VALID [2022-02-21 03:04:52,513 INFO L290 TraceCheckUtils]: 9: Hoare triple {4598#(<= |ULTIMATE.start_main_~a~0#1| 2147483643)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {4598#(<= |ULTIMATE.start_main_~a~0#1| 2147483643)} is VALID [2022-02-21 03:04:52,513 INFO L290 TraceCheckUtils]: 8: Hoare triple {4598#(<= |ULTIMATE.start_main_~a~0#1| 2147483643)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {4598#(<= |ULTIMATE.start_main_~a~0#1| 2147483643)} is VALID [2022-02-21 03:04:52,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {4598#(<= |ULTIMATE.start_main_~a~0#1| 2147483643)} assume 1 + main_~x~0#1 <= 2147483647; {4598#(<= |ULTIMATE.start_main_~a~0#1| 2147483643)} is VALID [2022-02-21 03:04:52,514 INFO L290 TraceCheckUtils]: 6: Hoare triple {4617#(<= |ULTIMATE.start_main_~a~0#1| 2147483642)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {4598#(<= |ULTIMATE.start_main_~a~0#1| 2147483643)} is VALID [2022-02-21 03:04:52,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {4617#(<= |ULTIMATE.start_main_~a~0#1| 2147483642)} assume 1 + main_~a~0#1 <= 2147483647; {4617#(<= |ULTIMATE.start_main_~a~0#1| 2147483642)} is VALID [2022-02-21 03:04:52,515 INFO L290 TraceCheckUtils]: 4: Hoare triple {4617#(<= |ULTIMATE.start_main_~a~0#1| 2147483642)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {4617#(<= |ULTIMATE.start_main_~a~0#1| 2147483642)} is VALID [2022-02-21 03:04:52,515 INFO L290 TraceCheckUtils]: 3: Hoare triple {4617#(<= |ULTIMATE.start_main_~a~0#1| 2147483642)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {4617#(<= |ULTIMATE.start_main_~a~0#1| 2147483642)} is VALID [2022-02-21 03:04:52,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {4447#true} assume main_~max~0#1 > 0;main_~a~0#1 := 0;main_~x~0#1 := 1; {4617#(<= |ULTIMATE.start_main_~a~0#1| 2147483642)} is VALID [2022-02-21 03:04:52,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {4447#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~a~0#1, main_~x~0#1, main_~max~0#1;havoc main_~a~0#1;havoc main_~x~0#1;havoc main_~max~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~a~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~max~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {4447#true} is VALID [2022-02-21 03:04:52,515 INFO L290 TraceCheckUtils]: 0: Hoare triple {4447#true} assume { :begin_inline_ULTIMATE.init } true; {4447#true} is VALID [2022-02-21 03:04:52,516 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:52,516 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093000769] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:04:52,516 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:04:52,516 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-02-21 03:04:52,516 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021232503] [2022-02-21 03:04:52,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:04:52,517 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 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 30 [2022-02-21 03:04:52,517 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:52,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:52,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:52,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-21 03:04:52,542 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:52,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-21 03:04:52,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-02-21 03:04:52,543 INFO L87 Difference]: Start difference. First operand 330 states and 416 transitions. Second operand has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:52,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:52,963 INFO L93 Difference]: Finished difference Result 871 states and 1195 transitions. [2022-02-21 03:04:52,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 03:04:52,963 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 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 30 [2022-02-21 03:04:52,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:52,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:52,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 145 transitions. [2022-02-21 03:04:52,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:52,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 145 transitions. [2022-02-21 03:04:52,966 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 145 transitions. [2022-02-21 03:04:53,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:53,071 INFO L225 Difference]: With dead ends: 871 [2022-02-21 03:04:53,087 INFO L226 Difference]: Without dead ends: 869 [2022-02-21 03:04:53,088 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-02-21 03:04:53,089 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 87 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:53,089 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 84 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:53,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2022-02-21 03:04:53,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 573. [2022-02-21 03:04:53,251 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:53,252 INFO L82 GeneralOperation]: Start isEquivalent. First operand 869 states. Second operand has 573 states, 569 states have (on average 1.2864674868189807) internal successors, (732), 572 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:53,253 INFO L74 IsIncluded]: Start isIncluded. First operand 869 states. Second operand has 573 states, 569 states have (on average 1.2864674868189807) internal successors, (732), 572 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:53,253 INFO L87 Difference]: Start difference. First operand 869 states. Second operand has 573 states, 569 states have (on average 1.2864674868189807) internal successors, (732), 572 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:53,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:53,289 INFO L93 Difference]: Finished difference Result 869 states and 1099 transitions. [2022-02-21 03:04:53,289 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1099 transitions. [2022-02-21 03:04:53,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:53,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:53,291 INFO L74 IsIncluded]: Start isIncluded. First operand has 573 states, 569 states have (on average 1.2864674868189807) internal successors, (732), 572 states have internal predecessors, (732), 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 869 states. [2022-02-21 03:04:53,307 INFO L87 Difference]: Start difference. First operand has 573 states, 569 states have (on average 1.2864674868189807) internal successors, (732), 572 states have internal predecessors, (732), 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 869 states. [2022-02-21 03:04:53,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:53,347 INFO L93 Difference]: Finished difference Result 869 states and 1099 transitions. [2022-02-21 03:04:53,348 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1099 transitions. [2022-02-21 03:04:53,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:53,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:53,348 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:53,349 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:53,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 569 states have (on average 1.2864674868189807) internal successors, (732), 572 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:53,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 732 transitions. [2022-02-21 03:04:53,375 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 732 transitions. Word has length 30 [2022-02-21 03:04:53,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:53,375 INFO L470 AbstractCegarLoop]: Abstraction has 573 states and 732 transitions. [2022-02-21 03:04:53,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:53,375 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 732 transitions. [2022-02-21 03:04:53,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-21 03:04:53,376 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:53,376 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1] [2022-02-21 03:04:53,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:04:53,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:04:53,607 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:04:53,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:53,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1195498150, now seen corresponding path program 2 times [2022-02-21 03:04:53,608 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:53,608 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806304990] [2022-02-21 03:04:53,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:53,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:53,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:53,676 INFO L290 TraceCheckUtils]: 0: Hoare triple {8010#true} assume { :begin_inline_ULTIMATE.init } true; {8010#true} is VALID [2022-02-21 03:04:53,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {8010#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~a~0#1, main_~x~0#1, main_~max~0#1;havoc main_~a~0#1;havoc main_~x~0#1;havoc main_~max~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~a~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~max~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {8010#true} is VALID [2022-02-21 03:04:53,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {8010#true} assume main_~max~0#1 > 0;main_~a~0#1 := 0;main_~x~0#1 := 1; {8012#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:04:53,677 INFO L290 TraceCheckUtils]: 3: Hoare triple {8012#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {8012#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:04:53,677 INFO L290 TraceCheckUtils]: 4: Hoare triple {8012#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {8012#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:04:53,678 INFO L290 TraceCheckUtils]: 5: Hoare triple {8012#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 1 + main_~a~0#1 <= 2147483647; {8012#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:04:53,678 INFO L290 TraceCheckUtils]: 6: Hoare triple {8012#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {8012#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:04:53,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {8012#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 1 + main_~x~0#1 <= 2147483647; {8012#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:04:53,679 INFO L290 TraceCheckUtils]: 8: Hoare triple {8012#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {8013#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:04:53,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {8013#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {8013#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:04:53,680 INFO L290 TraceCheckUtils]: 10: Hoare triple {8013#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {8013#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:04:53,680 INFO L290 TraceCheckUtils]: 11: Hoare triple {8013#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 1 + main_~a~0#1 <= 2147483647; {8013#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:04:53,680 INFO L290 TraceCheckUtils]: 12: Hoare triple {8013#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {8013#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:04:53,681 INFO L290 TraceCheckUtils]: 13: Hoare triple {8013#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 1 + main_~x~0#1 <= 2147483647; {8013#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:04:53,681 INFO L290 TraceCheckUtils]: 14: Hoare triple {8013#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {8014#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:04:53,681 INFO L290 TraceCheckUtils]: 15: Hoare triple {8014#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {8014#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:04:53,682 INFO L290 TraceCheckUtils]: 16: Hoare triple {8014#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {8014#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:04:53,683 INFO L290 TraceCheckUtils]: 17: Hoare triple {8014#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume 1 + main_~a~0#1 <= 2147483647; {8014#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:04:53,683 INFO L290 TraceCheckUtils]: 18: Hoare triple {8014#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {8014#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:04:53,683 INFO L290 TraceCheckUtils]: 19: Hoare triple {8014#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume 1 + main_~x~0#1 <= 2147483647; {8014#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:04:53,684 INFO L290 TraceCheckUtils]: 20: Hoare triple {8014#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {8015#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:04:53,684 INFO L290 TraceCheckUtils]: 21: Hoare triple {8015#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {8015#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:04:53,684 INFO L290 TraceCheckUtils]: 22: Hoare triple {8015#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {8015#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:04:53,685 INFO L290 TraceCheckUtils]: 23: Hoare triple {8015#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume 1 + main_~a~0#1 <= 2147483647; {8015#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:04:53,685 INFO L290 TraceCheckUtils]: 24: Hoare triple {8015#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {8015#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:04:53,685 INFO L290 TraceCheckUtils]: 25: Hoare triple {8015#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume 1 + main_~x~0#1 <= 2147483647; {8015#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:04:53,686 INFO L290 TraceCheckUtils]: 26: Hoare triple {8015#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {8016#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-21 03:04:53,686 INFO L290 TraceCheckUtils]: 27: Hoare triple {8016#(<= |ULTIMATE.start_main_~x~0#1| 5)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {8016#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-21 03:04:53,686 INFO L290 TraceCheckUtils]: 28: Hoare triple {8016#(<= |ULTIMATE.start_main_~x~0#1| 5)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {8016#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-21 03:04:53,687 INFO L290 TraceCheckUtils]: 29: Hoare triple {8016#(<= |ULTIMATE.start_main_~x~0#1| 5)} assume 1 + main_~a~0#1 <= 2147483647; {8016#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-21 03:04:53,687 INFO L290 TraceCheckUtils]: 30: Hoare triple {8016#(<= |ULTIMATE.start_main_~x~0#1| 5)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {8016#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-21 03:04:53,687 INFO L290 TraceCheckUtils]: 31: Hoare triple {8016#(<= |ULTIMATE.start_main_~x~0#1| 5)} assume !(1 + main_~x~0#1 <= 2147483647); {8011#false} is VALID [2022-02-21 03:04:53,688 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:53,688 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:53,688 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806304990] [2022-02-21 03:04:53,688 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806304990] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:04:53,688 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003092300] [2022-02-21 03:04:53,688 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:04:53,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:04:53,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:04:53,690 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:04:53,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-21 03:04:53,724 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:04:53,724 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:04:53,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:04:53,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:53,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:04:53,878 INFO L290 TraceCheckUtils]: 0: Hoare triple {8010#true} assume { :begin_inline_ULTIMATE.init } true; {8010#true} is VALID [2022-02-21 03:04:53,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {8010#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~a~0#1, main_~x~0#1, main_~max~0#1;havoc main_~a~0#1;havoc main_~x~0#1;havoc main_~max~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~a~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~max~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {8010#true} is VALID [2022-02-21 03:04:53,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {8010#true} assume main_~max~0#1 > 0;main_~a~0#1 := 0;main_~x~0#1 := 1; {8012#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:04:53,879 INFO L290 TraceCheckUtils]: 3: Hoare triple {8012#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {8012#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:04:53,879 INFO L290 TraceCheckUtils]: 4: Hoare triple {8012#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {8012#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:04:53,880 INFO L290 TraceCheckUtils]: 5: Hoare triple {8012#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 1 + main_~a~0#1 <= 2147483647; {8012#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:04:53,880 INFO L290 TraceCheckUtils]: 6: Hoare triple {8012#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {8012#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:04:53,881 INFO L290 TraceCheckUtils]: 7: Hoare triple {8012#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 1 + main_~x~0#1 <= 2147483647; {8012#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:04:53,881 INFO L290 TraceCheckUtils]: 8: Hoare triple {8012#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {8013#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:04:53,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {8013#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {8013#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:04:53,882 INFO L290 TraceCheckUtils]: 10: Hoare triple {8013#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {8013#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:04:53,883 INFO L290 TraceCheckUtils]: 11: Hoare triple {8013#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 1 + main_~a~0#1 <= 2147483647; {8013#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:04:53,883 INFO L290 TraceCheckUtils]: 12: Hoare triple {8013#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {8013#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:04:53,883 INFO L290 TraceCheckUtils]: 13: Hoare triple {8013#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 1 + main_~x~0#1 <= 2147483647; {8013#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:04:53,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {8013#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {8014#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:04:53,884 INFO L290 TraceCheckUtils]: 15: Hoare triple {8014#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {8014#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:04:53,885 INFO L290 TraceCheckUtils]: 16: Hoare triple {8014#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {8014#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:04:53,885 INFO L290 TraceCheckUtils]: 17: Hoare triple {8014#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume 1 + main_~a~0#1 <= 2147483647; {8014#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:04:53,886 INFO L290 TraceCheckUtils]: 18: Hoare triple {8014#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {8014#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:04:53,888 INFO L290 TraceCheckUtils]: 19: Hoare triple {8014#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume 1 + main_~x~0#1 <= 2147483647; {8014#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:04:53,889 INFO L290 TraceCheckUtils]: 20: Hoare triple {8014#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {8015#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:04:53,889 INFO L290 TraceCheckUtils]: 21: Hoare triple {8015#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {8015#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:04:53,889 INFO L290 TraceCheckUtils]: 22: Hoare triple {8015#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {8015#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:04:53,890 INFO L290 TraceCheckUtils]: 23: Hoare triple {8015#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume 1 + main_~a~0#1 <= 2147483647; {8015#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:04:53,890 INFO L290 TraceCheckUtils]: 24: Hoare triple {8015#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {8015#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:04:53,891 INFO L290 TraceCheckUtils]: 25: Hoare triple {8015#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume 1 + main_~x~0#1 <= 2147483647; {8015#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:04:53,891 INFO L290 TraceCheckUtils]: 26: Hoare triple {8015#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {8016#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-21 03:04:53,892 INFO L290 TraceCheckUtils]: 27: Hoare triple {8016#(<= |ULTIMATE.start_main_~x~0#1| 5)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {8016#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-21 03:04:53,892 INFO L290 TraceCheckUtils]: 28: Hoare triple {8016#(<= |ULTIMATE.start_main_~x~0#1| 5)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {8016#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-21 03:04:53,892 INFO L290 TraceCheckUtils]: 29: Hoare triple {8016#(<= |ULTIMATE.start_main_~x~0#1| 5)} assume 1 + main_~a~0#1 <= 2147483647; {8016#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-21 03:04:53,893 INFO L290 TraceCheckUtils]: 30: Hoare triple {8016#(<= |ULTIMATE.start_main_~x~0#1| 5)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {8016#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-21 03:04:53,893 INFO L290 TraceCheckUtils]: 31: Hoare triple {8016#(<= |ULTIMATE.start_main_~x~0#1| 5)} assume !(1 + main_~x~0#1 <= 2147483647); {8011#false} is VALID [2022-02-21 03:04:53,893 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:53,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:04:54,073 INFO L290 TraceCheckUtils]: 31: Hoare triple {8113#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} assume !(1 + main_~x~0#1 <= 2147483647); {8011#false} is VALID [2022-02-21 03:04:54,074 INFO L290 TraceCheckUtils]: 30: Hoare triple {8113#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {8113#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:04:54,074 INFO L290 TraceCheckUtils]: 29: Hoare triple {8113#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} assume 1 + main_~a~0#1 <= 2147483647; {8113#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:04:54,075 INFO L290 TraceCheckUtils]: 28: Hoare triple {8113#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {8113#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:04:54,075 INFO L290 TraceCheckUtils]: 27: Hoare triple {8113#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {8113#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:04:54,076 INFO L290 TraceCheckUtils]: 26: Hoare triple {8129#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {8113#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:04:54,076 INFO L290 TraceCheckUtils]: 25: Hoare triple {8129#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume 1 + main_~x~0#1 <= 2147483647; {8129#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:04:54,077 INFO L290 TraceCheckUtils]: 24: Hoare triple {8129#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {8129#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:04:54,077 INFO L290 TraceCheckUtils]: 23: Hoare triple {8129#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume 1 + main_~a~0#1 <= 2147483647; {8129#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:04:54,077 INFO L290 TraceCheckUtils]: 22: Hoare triple {8129#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {8129#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:04:54,078 INFO L290 TraceCheckUtils]: 21: Hoare triple {8129#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {8129#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:04:54,078 INFO L290 TraceCheckUtils]: 20: Hoare triple {8148#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {8129#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:04:54,079 INFO L290 TraceCheckUtils]: 19: Hoare triple {8148#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} assume 1 + main_~x~0#1 <= 2147483647; {8148#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} is VALID [2022-02-21 03:04:54,079 INFO L290 TraceCheckUtils]: 18: Hoare triple {8148#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {8148#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} is VALID [2022-02-21 03:04:54,080 INFO L290 TraceCheckUtils]: 17: Hoare triple {8148#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} assume 1 + main_~a~0#1 <= 2147483647; {8148#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} is VALID [2022-02-21 03:04:54,080 INFO L290 TraceCheckUtils]: 16: Hoare triple {8148#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {8148#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} is VALID [2022-02-21 03:04:54,080 INFO L290 TraceCheckUtils]: 15: Hoare triple {8148#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {8148#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} is VALID [2022-02-21 03:04:54,084 INFO L290 TraceCheckUtils]: 14: Hoare triple {8167#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {8148#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} is VALID [2022-02-21 03:04:54,085 INFO L290 TraceCheckUtils]: 13: Hoare triple {8167#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} assume 1 + main_~x~0#1 <= 2147483647; {8167#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} is VALID [2022-02-21 03:04:54,091 INFO L290 TraceCheckUtils]: 12: Hoare triple {8167#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {8167#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} is VALID [2022-02-21 03:04:54,091 INFO L290 TraceCheckUtils]: 11: Hoare triple {8167#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} assume 1 + main_~a~0#1 <= 2147483647; {8167#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} is VALID [2022-02-21 03:04:54,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {8167#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {8167#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} is VALID [2022-02-21 03:04:54,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {8167#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {8167#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} is VALID [2022-02-21 03:04:54,093 INFO L290 TraceCheckUtils]: 8: Hoare triple {8186#(<= |ULTIMATE.start_main_~x~0#1| 2147483642)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {8167#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} is VALID [2022-02-21 03:04:54,093 INFO L290 TraceCheckUtils]: 7: Hoare triple {8186#(<= |ULTIMATE.start_main_~x~0#1| 2147483642)} assume 1 + main_~x~0#1 <= 2147483647; {8186#(<= |ULTIMATE.start_main_~x~0#1| 2147483642)} is VALID [2022-02-21 03:04:54,093 INFO L290 TraceCheckUtils]: 6: Hoare triple {8186#(<= |ULTIMATE.start_main_~x~0#1| 2147483642)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {8186#(<= |ULTIMATE.start_main_~x~0#1| 2147483642)} is VALID [2022-02-21 03:04:54,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {8186#(<= |ULTIMATE.start_main_~x~0#1| 2147483642)} assume 1 + main_~a~0#1 <= 2147483647; {8186#(<= |ULTIMATE.start_main_~x~0#1| 2147483642)} is VALID [2022-02-21 03:04:54,094 INFO L290 TraceCheckUtils]: 4: Hoare triple {8186#(<= |ULTIMATE.start_main_~x~0#1| 2147483642)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {8186#(<= |ULTIMATE.start_main_~x~0#1| 2147483642)} is VALID [2022-02-21 03:04:54,094 INFO L290 TraceCheckUtils]: 3: Hoare triple {8186#(<= |ULTIMATE.start_main_~x~0#1| 2147483642)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {8186#(<= |ULTIMATE.start_main_~x~0#1| 2147483642)} is VALID [2022-02-21 03:04:54,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {8010#true} assume main_~max~0#1 > 0;main_~a~0#1 := 0;main_~x~0#1 := 1; {8186#(<= |ULTIMATE.start_main_~x~0#1| 2147483642)} is VALID [2022-02-21 03:04:54,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {8010#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~a~0#1, main_~x~0#1, main_~max~0#1;havoc main_~a~0#1;havoc main_~x~0#1;havoc main_~max~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~a~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~max~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {8010#true} is VALID [2022-02-21 03:04:54,095 INFO L290 TraceCheckUtils]: 0: Hoare triple {8010#true} assume { :begin_inline_ULTIMATE.init } true; {8010#true} is VALID [2022-02-21 03:04:54,095 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:54,096 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003092300] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:04:54,096 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:04:54,096 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-02-21 03:04:54,096 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228585755] [2022-02-21 03:04:54,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:04:54,097 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 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 32 [2022-02-21 03:04:54,097 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:54,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:54,136 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:54,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-21 03:04:54,136 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:54,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-21 03:04:54,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-02-21 03:04:54,137 INFO L87 Difference]: Start difference. First operand 573 states and 732 transitions. Second operand has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:54,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:54,858 INFO L93 Difference]: Finished difference Result 1650 states and 2141 transitions. [2022-02-21 03:04:54,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 03:04:54,859 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 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 32 [2022-02-21 03:04:54,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:54,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:54,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 115 transitions. [2022-02-21 03:04:54,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:54,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 115 transitions. [2022-02-21 03:04:54,861 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 115 transitions. [2022-02-21 03:04:54,925 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:55,012 INFO L225 Difference]: With dead ends: 1650 [2022-02-21 03:04:55,013 INFO L226 Difference]: Without dead ends: 1649 [2022-02-21 03:04:55,014 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-02-21 03:04:55,014 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 78 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:55,014 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 92 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:04:55,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2022-02-21 03:04:55,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1645. [2022-02-21 03:04:55,491 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:55,493 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1649 states. Second operand has 1645 states, 1641 states have (on average 1.193784277879342) internal successors, (1959), 1644 states have internal predecessors, (1959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:55,494 INFO L74 IsIncluded]: Start isIncluded. First operand 1649 states. Second operand has 1645 states, 1641 states have (on average 1.193784277879342) internal successors, (1959), 1644 states have internal predecessors, (1959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:55,496 INFO L87 Difference]: Start difference. First operand 1649 states. Second operand has 1645 states, 1641 states have (on average 1.193784277879342) internal successors, (1959), 1644 states have internal predecessors, (1959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:55,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:55,575 INFO L93 Difference]: Finished difference Result 1649 states and 1959 transitions. [2022-02-21 03:04:55,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 1959 transitions. [2022-02-21 03:04:55,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:55,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:55,578 INFO L74 IsIncluded]: Start isIncluded. First operand has 1645 states, 1641 states have (on average 1.193784277879342) internal successors, (1959), 1644 states have internal predecessors, (1959), 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 1649 states. [2022-02-21 03:04:55,580 INFO L87 Difference]: Start difference. First operand has 1645 states, 1641 states have (on average 1.193784277879342) internal successors, (1959), 1644 states have internal predecessors, (1959), 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 1649 states. [2022-02-21 03:04:55,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:55,657 INFO L93 Difference]: Finished difference Result 1649 states and 1959 transitions. [2022-02-21 03:04:55,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 1959 transitions. [2022-02-21 03:04:55,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:55,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:55,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:55,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:55,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1645 states, 1641 states have (on average 1.193784277879342) internal successors, (1959), 1644 states have internal predecessors, (1959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:55,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 1959 transitions. [2022-02-21 03:04:55,762 INFO L78 Accepts]: Start accepts. Automaton has 1645 states and 1959 transitions. Word has length 32 [2022-02-21 03:04:55,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:55,763 INFO L470 AbstractCegarLoop]: Abstraction has 1645 states and 1959 transitions. [2022-02-21 03:04:55,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:55,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 1959 transitions. [2022-02-21 03:04:55,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-21 03:04:55,766 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:55,766 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 1, 1, 1, 1] [2022-02-21 03:04:55,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:04:55,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:04:55,989 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:04:55,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:55,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1056880102, now seen corresponding path program 2 times [2022-02-21 03:04:55,990 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:55,990 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436110262] [2022-02-21 03:04:55,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:55,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:56,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:56,065 INFO L290 TraceCheckUtils]: 0: Hoare triple {15255#true} assume { :begin_inline_ULTIMATE.init } true; {15255#true} is VALID [2022-02-21 03:04:56,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {15255#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~a~0#1, main_~x~0#1, main_~max~0#1;havoc main_~a~0#1;havoc main_~x~0#1;havoc main_~max~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~a~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~max~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {15255#true} is VALID [2022-02-21 03:04:56,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {15255#true} assume main_~max~0#1 > 0;main_~a~0#1 := 0;main_~x~0#1 := 1; {15257#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:04:56,067 INFO L290 TraceCheckUtils]: 3: Hoare triple {15257#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {15257#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:04:56,067 INFO L290 TraceCheckUtils]: 4: Hoare triple {15257#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {15257#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:04:56,067 INFO L290 TraceCheckUtils]: 5: Hoare triple {15257#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume main_~a~0#1 - 1 <= 2147483647; {15257#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:04:56,068 INFO L290 TraceCheckUtils]: 6: Hoare triple {15257#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {15258#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:04:56,068 INFO L290 TraceCheckUtils]: 7: Hoare triple {15258#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume 1 + main_~x~0#1 <= 2147483647; {15258#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:04:56,068 INFO L290 TraceCheckUtils]: 8: Hoare triple {15258#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {15258#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:04:56,068 INFO L290 TraceCheckUtils]: 9: Hoare triple {15258#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {15258#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:04:56,069 INFO L290 TraceCheckUtils]: 10: Hoare triple {15258#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {15258#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:04:56,069 INFO L290 TraceCheckUtils]: 11: Hoare triple {15258#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume main_~a~0#1 - 1 <= 2147483647; {15258#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:04:56,069 INFO L290 TraceCheckUtils]: 12: Hoare triple {15258#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {15259#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,070 INFO L290 TraceCheckUtils]: 13: Hoare triple {15259#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 <= 2147483647; {15259#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,070 INFO L290 TraceCheckUtils]: 14: Hoare triple {15259#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {15259#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,070 INFO L290 TraceCheckUtils]: 15: Hoare triple {15259#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {15259#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,071 INFO L290 TraceCheckUtils]: 16: Hoare triple {15259#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {15259#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,071 INFO L290 TraceCheckUtils]: 17: Hoare triple {15259#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 <= 2147483647; {15259#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,071 INFO L290 TraceCheckUtils]: 18: Hoare triple {15259#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {15260#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,072 INFO L290 TraceCheckUtils]: 19: Hoare triple {15260#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 <= 2147483647; {15260#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,072 INFO L290 TraceCheckUtils]: 20: Hoare triple {15260#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {15260#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,072 INFO L290 TraceCheckUtils]: 21: Hoare triple {15260#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {15260#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,072 INFO L290 TraceCheckUtils]: 22: Hoare triple {15260#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {15260#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,073 INFO L290 TraceCheckUtils]: 23: Hoare triple {15260#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 <= 2147483647; {15260#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,073 INFO L290 TraceCheckUtils]: 24: Hoare triple {15260#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {15261#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} is VALID [2022-02-21 03:04:56,073 INFO L290 TraceCheckUtils]: 25: Hoare triple {15261#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} assume 1 + main_~x~0#1 <= 2147483647; {15261#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} is VALID [2022-02-21 03:04:56,074 INFO L290 TraceCheckUtils]: 26: Hoare triple {15261#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {15261#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} is VALID [2022-02-21 03:04:56,074 INFO L290 TraceCheckUtils]: 27: Hoare triple {15261#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {15261#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} is VALID [2022-02-21 03:04:56,074 INFO L290 TraceCheckUtils]: 28: Hoare triple {15261#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {15261#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} is VALID [2022-02-21 03:04:56,074 INFO L290 TraceCheckUtils]: 29: Hoare triple {15261#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} assume main_~a~0#1 - 1 <= 2147483647; {15261#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} is VALID [2022-02-21 03:04:56,075 INFO L290 TraceCheckUtils]: 30: Hoare triple {15261#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {15262#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,075 INFO L290 TraceCheckUtils]: 31: Hoare triple {15262#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 <= 2147483647; {15262#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,075 INFO L290 TraceCheckUtils]: 32: Hoare triple {15262#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {15262#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,076 INFO L290 TraceCheckUtils]: 33: Hoare triple {15262#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {15262#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,076 INFO L290 TraceCheckUtils]: 34: Hoare triple {15262#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {15262#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,076 INFO L290 TraceCheckUtils]: 35: Hoare triple {15262#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 <= 2147483647; {15262#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,077 INFO L290 TraceCheckUtils]: 36: Hoare triple {15262#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {15263#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,077 INFO L290 TraceCheckUtils]: 37: Hoare triple {15263#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 <= 2147483647; {15263#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,077 INFO L290 TraceCheckUtils]: 38: Hoare triple {15263#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {15263#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,078 INFO L290 TraceCheckUtils]: 39: Hoare triple {15263#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {15263#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,078 INFO L290 TraceCheckUtils]: 40: Hoare triple {15263#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {15263#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,078 INFO L290 TraceCheckUtils]: 41: Hoare triple {15263#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 <= 2147483647; {15263#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,079 INFO L290 TraceCheckUtils]: 42: Hoare triple {15263#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} assume !(main_~a~0#1 - 1 >= -2147483648); {15256#false} is VALID [2022-02-21 03:04:56,079 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:56,079 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:56,079 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436110262] [2022-02-21 03:04:56,079 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436110262] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:04:56,079 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958387913] [2022-02-21 03:04:56,080 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:04:56,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:04:56,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:04:56,081 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:04:56,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-21 03:04:56,117 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:04:56,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:04:56,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:04:56,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:56,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:04:56,312 INFO L290 TraceCheckUtils]: 0: Hoare triple {15255#true} assume { :begin_inline_ULTIMATE.init } true; {15255#true} is VALID [2022-02-21 03:04:56,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {15255#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~a~0#1, main_~x~0#1, main_~max~0#1;havoc main_~a~0#1;havoc main_~x~0#1;havoc main_~max~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~a~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~max~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {15255#true} is VALID [2022-02-21 03:04:56,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {15255#true} assume main_~max~0#1 > 0;main_~a~0#1 := 0;main_~x~0#1 := 1; {15257#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:04:56,313 INFO L290 TraceCheckUtils]: 3: Hoare triple {15257#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {15257#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:04:56,313 INFO L290 TraceCheckUtils]: 4: Hoare triple {15257#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {15257#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:04:56,314 INFO L290 TraceCheckUtils]: 5: Hoare triple {15257#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume main_~a~0#1 - 1 <= 2147483647; {15257#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:04:56,314 INFO L290 TraceCheckUtils]: 6: Hoare triple {15257#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {15258#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:04:56,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {15258#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume 1 + main_~x~0#1 <= 2147483647; {15258#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:04:56,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {15258#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {15258#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:04:56,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {15258#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {15258#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:04:56,316 INFO L290 TraceCheckUtils]: 10: Hoare triple {15258#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {15258#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:04:56,316 INFO L290 TraceCheckUtils]: 11: Hoare triple {15258#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume main_~a~0#1 - 1 <= 2147483647; {15258#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:04:56,316 INFO L290 TraceCheckUtils]: 12: Hoare triple {15258#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {15259#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,317 INFO L290 TraceCheckUtils]: 13: Hoare triple {15259#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 <= 2147483647; {15259#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,317 INFO L290 TraceCheckUtils]: 14: Hoare triple {15259#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {15259#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,318 INFO L290 TraceCheckUtils]: 15: Hoare triple {15259#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {15259#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,318 INFO L290 TraceCheckUtils]: 16: Hoare triple {15259#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {15259#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,318 INFO L290 TraceCheckUtils]: 17: Hoare triple {15259#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 <= 2147483647; {15259#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,319 INFO L290 TraceCheckUtils]: 18: Hoare triple {15259#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {15260#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,319 INFO L290 TraceCheckUtils]: 19: Hoare triple {15260#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 <= 2147483647; {15260#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,320 INFO L290 TraceCheckUtils]: 20: Hoare triple {15260#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {15260#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,320 INFO L290 TraceCheckUtils]: 21: Hoare triple {15260#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {15260#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,320 INFO L290 TraceCheckUtils]: 22: Hoare triple {15260#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {15260#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,321 INFO L290 TraceCheckUtils]: 23: Hoare triple {15260#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 <= 2147483647; {15260#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,321 INFO L290 TraceCheckUtils]: 24: Hoare triple {15260#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {15261#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} is VALID [2022-02-21 03:04:56,321 INFO L290 TraceCheckUtils]: 25: Hoare triple {15261#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} assume 1 + main_~x~0#1 <= 2147483647; {15261#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} is VALID [2022-02-21 03:04:56,322 INFO L290 TraceCheckUtils]: 26: Hoare triple {15261#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {15261#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} is VALID [2022-02-21 03:04:56,322 INFO L290 TraceCheckUtils]: 27: Hoare triple {15261#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {15261#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} is VALID [2022-02-21 03:04:56,322 INFO L290 TraceCheckUtils]: 28: Hoare triple {15261#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {15261#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} is VALID [2022-02-21 03:04:56,323 INFO L290 TraceCheckUtils]: 29: Hoare triple {15261#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} assume main_~a~0#1 - 1 <= 2147483647; {15261#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} is VALID [2022-02-21 03:04:56,323 INFO L290 TraceCheckUtils]: 30: Hoare triple {15261#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {15262#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,323 INFO L290 TraceCheckUtils]: 31: Hoare triple {15262#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 <= 2147483647; {15262#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,324 INFO L290 TraceCheckUtils]: 32: Hoare triple {15262#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {15262#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,324 INFO L290 TraceCheckUtils]: 33: Hoare triple {15262#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {15262#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,324 INFO L290 TraceCheckUtils]: 34: Hoare triple {15262#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {15262#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,325 INFO L290 TraceCheckUtils]: 35: Hoare triple {15262#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 <= 2147483647; {15262#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,325 INFO L290 TraceCheckUtils]: 36: Hoare triple {15262#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {15263#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,326 INFO L290 TraceCheckUtils]: 37: Hoare triple {15263#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 <= 2147483647; {15263#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,326 INFO L290 TraceCheckUtils]: 38: Hoare triple {15263#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {15263#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,326 INFO L290 TraceCheckUtils]: 39: Hoare triple {15263#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {15263#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,327 INFO L290 TraceCheckUtils]: 40: Hoare triple {15263#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {15263#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,327 INFO L290 TraceCheckUtils]: 41: Hoare triple {15263#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 <= 2147483647; {15263#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,327 INFO L290 TraceCheckUtils]: 42: Hoare triple {15263#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} assume !(main_~a~0#1 - 1 >= -2147483648); {15256#false} is VALID [2022-02-21 03:04:56,327 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:56,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:04:56,529 INFO L290 TraceCheckUtils]: 42: Hoare triple {15393#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~a~0#1|))} assume !(main_~a~0#1 - 1 >= -2147483648); {15256#false} is VALID [2022-02-21 03:04:56,530 INFO L290 TraceCheckUtils]: 41: Hoare triple {15393#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 <= 2147483647; {15393#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,530 INFO L290 TraceCheckUtils]: 40: Hoare triple {15393#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {15393#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,530 INFO L290 TraceCheckUtils]: 39: Hoare triple {15393#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~a~0#1|))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {15393#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,531 INFO L290 TraceCheckUtils]: 38: Hoare triple {15393#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {15393#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,531 INFO L290 TraceCheckUtils]: 37: Hoare triple {15393#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 <= 2147483647; {15393#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,532 INFO L290 TraceCheckUtils]: 36: Hoare triple {15412#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483646))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {15393#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,532 INFO L290 TraceCheckUtils]: 35: Hoare triple {15412#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483646))} assume main_~a~0#1 - 1 <= 2147483647; {15412#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483646))} is VALID [2022-02-21 03:04:56,532 INFO L290 TraceCheckUtils]: 34: Hoare triple {15412#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483646))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {15412#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483646))} is VALID [2022-02-21 03:04:56,532 INFO L290 TraceCheckUtils]: 33: Hoare triple {15412#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483646))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {15412#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483646))} is VALID [2022-02-21 03:04:56,533 INFO L290 TraceCheckUtils]: 32: Hoare triple {15412#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483646))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {15412#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483646))} is VALID [2022-02-21 03:04:56,533 INFO L290 TraceCheckUtils]: 31: Hoare triple {15412#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483646))} assume 1 + main_~x~0#1 <= 2147483647; {15412#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483646))} is VALID [2022-02-21 03:04:56,533 INFO L290 TraceCheckUtils]: 30: Hoare triple {15431#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {15412#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483646))} is VALID [2022-02-21 03:04:56,534 INFO L290 TraceCheckUtils]: 29: Hoare triple {15431#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 <= 2147483647; {15431#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,534 INFO L290 TraceCheckUtils]: 28: Hoare triple {15431#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {15431#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,534 INFO L290 TraceCheckUtils]: 27: Hoare triple {15431#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~a~0#1|))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {15431#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,534 INFO L290 TraceCheckUtils]: 26: Hoare triple {15431#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {15431#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,535 INFO L290 TraceCheckUtils]: 25: Hoare triple {15431#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 <= 2147483647; {15431#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,535 INFO L290 TraceCheckUtils]: 24: Hoare triple {15450#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483644))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {15431#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,535 INFO L290 TraceCheckUtils]: 23: Hoare triple {15450#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483644))} assume main_~a~0#1 - 1 <= 2147483647; {15450#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483644))} is VALID [2022-02-21 03:04:56,536 INFO L290 TraceCheckUtils]: 22: Hoare triple {15450#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483644))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {15450#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483644))} is VALID [2022-02-21 03:04:56,536 INFO L290 TraceCheckUtils]: 21: Hoare triple {15450#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483644))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {15450#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483644))} is VALID [2022-02-21 03:04:56,536 INFO L290 TraceCheckUtils]: 20: Hoare triple {15450#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483644))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {15450#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483644))} is VALID [2022-02-21 03:04:56,536 INFO L290 TraceCheckUtils]: 19: Hoare triple {15450#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483644))} assume 1 + main_~x~0#1 <= 2147483647; {15450#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483644))} is VALID [2022-02-21 03:04:56,537 INFO L290 TraceCheckUtils]: 18: Hoare triple {15469#(<= 0 (+ 2147483643 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {15450#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483644))} is VALID [2022-02-21 03:04:56,537 INFO L290 TraceCheckUtils]: 17: Hoare triple {15469#(<= 0 (+ 2147483643 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 <= 2147483647; {15469#(<= 0 (+ 2147483643 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,537 INFO L290 TraceCheckUtils]: 16: Hoare triple {15469#(<= 0 (+ 2147483643 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {15469#(<= 0 (+ 2147483643 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,537 INFO L290 TraceCheckUtils]: 15: Hoare triple {15469#(<= 0 (+ 2147483643 |ULTIMATE.start_main_~a~0#1|))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {15469#(<= 0 (+ 2147483643 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,538 INFO L290 TraceCheckUtils]: 14: Hoare triple {15469#(<= 0 (+ 2147483643 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {15469#(<= 0 (+ 2147483643 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,538 INFO L290 TraceCheckUtils]: 13: Hoare triple {15469#(<= 0 (+ 2147483643 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 <= 2147483647; {15469#(<= 0 (+ 2147483643 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,539 INFO L290 TraceCheckUtils]: 12: Hoare triple {15488#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483642))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {15469#(<= 0 (+ 2147483643 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:56,539 INFO L290 TraceCheckUtils]: 11: Hoare triple {15488#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483642))} assume main_~a~0#1 - 1 <= 2147483647; {15488#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483642))} is VALID [2022-02-21 03:04:56,539 INFO L290 TraceCheckUtils]: 10: Hoare triple {15488#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483642))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {15488#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483642))} is VALID [2022-02-21 03:04:56,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {15488#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483642))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {15488#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483642))} is VALID [2022-02-21 03:04:56,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {15488#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483642))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {15488#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483642))} is VALID [2022-02-21 03:04:56,540 INFO L290 TraceCheckUtils]: 7: Hoare triple {15488#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483642))} assume 1 + main_~x~0#1 <= 2147483647; {15488#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483642))} is VALID [2022-02-21 03:04:56,541 INFO L290 TraceCheckUtils]: 6: Hoare triple {15507#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483641))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {15488#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483642))} is VALID [2022-02-21 03:04:56,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {15507#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483641))} assume main_~a~0#1 - 1 <= 2147483647; {15507#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483641))} is VALID [2022-02-21 03:04:56,541 INFO L290 TraceCheckUtils]: 4: Hoare triple {15507#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483641))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {15507#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483641))} is VALID [2022-02-21 03:04:56,541 INFO L290 TraceCheckUtils]: 3: Hoare triple {15507#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483641))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {15507#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483641))} is VALID [2022-02-21 03:04:56,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {15255#true} assume main_~max~0#1 > 0;main_~a~0#1 := 0;main_~x~0#1 := 1; {15507#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483641))} is VALID [2022-02-21 03:04:56,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {15255#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~a~0#1, main_~x~0#1, main_~max~0#1;havoc main_~a~0#1;havoc main_~x~0#1;havoc main_~max~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~a~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~max~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {15255#true} is VALID [2022-02-21 03:04:56,542 INFO L290 TraceCheckUtils]: 0: Hoare triple {15255#true} assume { :begin_inline_ULTIMATE.init } true; {15255#true} is VALID [2022-02-21 03:04:56,542 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:04:56,543 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958387913] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:04:56,543 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:04:56,543 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2022-02-21 03:04:56,543 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277140698] [2022-02-21 03:04:56,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:04:56,545 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.6) internal successors, (84), 16 states have internal predecessors, (84), 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 43 [2022-02-21 03:04:56,545 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:56,545 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 5.6) internal successors, (84), 16 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:56,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:56,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-21 03:04:56,600 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:56,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-21 03:04:56,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2022-02-21 03:04:56,601 INFO L87 Difference]: Start difference. First operand 1645 states and 1959 transitions. Second operand has 16 states, 15 states have (on average 5.6) internal successors, (84), 16 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:58,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:58,181 INFO L93 Difference]: Finished difference Result 3431 states and 4254 transitions. [2022-02-21 03:04:58,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-21 03:04:58,181 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.6) internal successors, (84), 16 states have internal predecessors, (84), 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 43 [2022-02-21 03:04:58,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:58,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 5.6) internal successors, (84), 16 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:58,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 198 transitions. [2022-02-21 03:04:58,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 5.6) internal successors, (84), 16 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:58,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 198 transitions. [2022-02-21 03:04:58,184 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 198 transitions. [2022-02-21 03:04:58,307 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:04:58,703 INFO L225 Difference]: With dead ends: 3431 [2022-02-21 03:04:58,704 INFO L226 Difference]: Without dead ends: 3430 [2022-02-21 03:04:58,705 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2022-02-21 03:04:58,705 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 185 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:04:58,706 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 96 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:04:58,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3430 states. [2022-02-21 03:04:59,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3430 to 2080. [2022-02-21 03:04:59,237 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:59,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3430 states. Second operand has 2080 states, 2076 states have (on average 1.2129094412331407) internal successors, (2518), 2079 states have internal predecessors, (2518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:59,283 INFO L74 IsIncluded]: Start isIncluded. First operand 3430 states. Second operand has 2080 states, 2076 states have (on average 1.2129094412331407) internal successors, (2518), 2079 states have internal predecessors, (2518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:59,286 INFO L87 Difference]: Start difference. First operand 3430 states. Second operand has 2080 states, 2076 states have (on average 1.2129094412331407) internal successors, (2518), 2079 states have internal predecessors, (2518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:04:59,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:59,616 INFO L93 Difference]: Finished difference Result 3430 states and 4146 transitions. [2022-02-21 03:04:59,616 INFO L276 IsEmpty]: Start isEmpty. Operand 3430 states and 4146 transitions. [2022-02-21 03:04:59,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:59,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:59,623 INFO L74 IsIncluded]: Start isIncluded. First operand has 2080 states, 2076 states have (on average 1.2129094412331407) internal successors, (2518), 2079 states have internal predecessors, (2518), 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 3430 states. [2022-02-21 03:04:59,625 INFO L87 Difference]: Start difference. First operand has 2080 states, 2076 states have (on average 1.2129094412331407) internal successors, (2518), 2079 states have internal predecessors, (2518), 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 3430 states. [2022-02-21 03:04:59,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:59,953 INFO L93 Difference]: Finished difference Result 3430 states and 4146 transitions. [2022-02-21 03:04:59,953 INFO L276 IsEmpty]: Start isEmpty. Operand 3430 states and 4146 transitions. [2022-02-21 03:04:59,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:59,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:59,965 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:59,966 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:59,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2080 states, 2076 states have (on average 1.2129094412331407) internal successors, (2518), 2079 states have internal predecessors, (2518), 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:00,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2080 states to 2080 states and 2518 transitions. [2022-02-21 03:05:00,097 INFO L78 Accepts]: Start accepts. Automaton has 2080 states and 2518 transitions. Word has length 43 [2022-02-21 03:05:00,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:00,097 INFO L470 AbstractCegarLoop]: Abstraction has 2080 states and 2518 transitions. [2022-02-21 03:05:00,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.6) internal successors, (84), 16 states have internal predecessors, (84), 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:00,097 INFO L276 IsEmpty]: Start isEmpty. Operand 2080 states and 2518 transitions. [2022-02-21 03:05:00,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-21 03:05:00,099 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:00,100 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1] [2022-02-21 03:05:00,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-02-21 03:05:00,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:05:00,316 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:05:00,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:00,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1254740665, now seen corresponding path program 3 times [2022-02-21 03:05:00,316 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:00,316 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597048192] [2022-02-21 03:05:00,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:00,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:00,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:00,492 INFO L290 TraceCheckUtils]: 0: Hoare triple {28624#true} assume { :begin_inline_ULTIMATE.init } true; {28624#true} is VALID [2022-02-21 03:05:00,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {28624#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~a~0#1, main_~x~0#1, main_~max~0#1;havoc main_~a~0#1;havoc main_~x~0#1;havoc main_~max~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~a~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~max~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {28624#true} is VALID [2022-02-21 03:05:00,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {28624#true} assume main_~max~0#1 > 0;main_~a~0#1 := 0;main_~x~0#1 := 1; {28626#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:05:00,493 INFO L290 TraceCheckUtils]: 3: Hoare triple {28626#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {28626#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:05:00,493 INFO L290 TraceCheckUtils]: 4: Hoare triple {28626#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {28626#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:05:00,493 INFO L290 TraceCheckUtils]: 5: Hoare triple {28626#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume 1 + main_~a~0#1 <= 2147483647; {28626#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:05:00,494 INFO L290 TraceCheckUtils]: 6: Hoare triple {28626#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {28627#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-21 03:05:00,494 INFO L290 TraceCheckUtils]: 7: Hoare triple {28627#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume 1 + main_~x~0#1 <= 2147483647; {28627#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-21 03:05:00,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {28627#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {28627#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-21 03:05:00,495 INFO L290 TraceCheckUtils]: 9: Hoare triple {28627#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {28627#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-21 03:05:00,495 INFO L290 TraceCheckUtils]: 10: Hoare triple {28627#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {28627#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-21 03:05:00,496 INFO L290 TraceCheckUtils]: 11: Hoare triple {28627#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume 1 + main_~a~0#1 <= 2147483647; {28627#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-21 03:05:00,496 INFO L290 TraceCheckUtils]: 12: Hoare triple {28627#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {28628#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-21 03:05:00,497 INFO L290 TraceCheckUtils]: 13: Hoare triple {28628#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume 1 + main_~x~0#1 <= 2147483647; {28628#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-21 03:05:00,497 INFO L290 TraceCheckUtils]: 14: Hoare triple {28628#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {28628#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-21 03:05:00,497 INFO L290 TraceCheckUtils]: 15: Hoare triple {28628#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {28628#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-21 03:05:00,498 INFO L290 TraceCheckUtils]: 16: Hoare triple {28628#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {28628#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-21 03:05:00,498 INFO L290 TraceCheckUtils]: 17: Hoare triple {28628#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume 1 + main_~a~0#1 <= 2147483647; {28628#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-21 03:05:00,498 INFO L290 TraceCheckUtils]: 18: Hoare triple {28628#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {28629#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-21 03:05:00,499 INFO L290 TraceCheckUtils]: 19: Hoare triple {28629#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume 1 + main_~x~0#1 <= 2147483647; {28629#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-21 03:05:00,499 INFO L290 TraceCheckUtils]: 20: Hoare triple {28629#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {28629#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-21 03:05:00,499 INFO L290 TraceCheckUtils]: 21: Hoare triple {28629#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {28629#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-21 03:05:00,500 INFO L290 TraceCheckUtils]: 22: Hoare triple {28629#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {28629#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-21 03:05:00,500 INFO L290 TraceCheckUtils]: 23: Hoare triple {28629#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume 1 + main_~a~0#1 <= 2147483647; {28629#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-21 03:05:00,501 INFO L290 TraceCheckUtils]: 24: Hoare triple {28629#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {28630#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-21 03:05:00,501 INFO L290 TraceCheckUtils]: 25: Hoare triple {28630#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume 1 + main_~x~0#1 <= 2147483647; {28630#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-21 03:05:00,501 INFO L290 TraceCheckUtils]: 26: Hoare triple {28630#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {28630#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-21 03:05:00,502 INFO L290 TraceCheckUtils]: 27: Hoare triple {28630#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {28630#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-21 03:05:00,502 INFO L290 TraceCheckUtils]: 28: Hoare triple {28630#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {28630#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-21 03:05:00,502 INFO L290 TraceCheckUtils]: 29: Hoare triple {28630#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume 1 + main_~a~0#1 <= 2147483647; {28630#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-21 03:05:00,503 INFO L290 TraceCheckUtils]: 30: Hoare triple {28630#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {28631#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-21 03:05:00,503 INFO L290 TraceCheckUtils]: 31: Hoare triple {28631#(<= |ULTIMATE.start_main_~a~0#1| 5)} assume 1 + main_~x~0#1 <= 2147483647; {28631#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-21 03:05:00,503 INFO L290 TraceCheckUtils]: 32: Hoare triple {28631#(<= |ULTIMATE.start_main_~a~0#1| 5)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {28631#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-21 03:05:00,504 INFO L290 TraceCheckUtils]: 33: Hoare triple {28631#(<= |ULTIMATE.start_main_~a~0#1| 5)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {28631#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-21 03:05:00,504 INFO L290 TraceCheckUtils]: 34: Hoare triple {28631#(<= |ULTIMATE.start_main_~a~0#1| 5)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {28631#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-21 03:05:00,504 INFO L290 TraceCheckUtils]: 35: Hoare triple {28631#(<= |ULTIMATE.start_main_~a~0#1| 5)} assume 1 + main_~a~0#1 <= 2147483647; {28631#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-21 03:05:00,505 INFO L290 TraceCheckUtils]: 36: Hoare triple {28631#(<= |ULTIMATE.start_main_~a~0#1| 5)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {28632#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-21 03:05:00,505 INFO L290 TraceCheckUtils]: 37: Hoare triple {28632#(<= |ULTIMATE.start_main_~a~0#1| 6)} assume 1 + main_~x~0#1 <= 2147483647; {28632#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-21 03:05:00,505 INFO L290 TraceCheckUtils]: 38: Hoare triple {28632#(<= |ULTIMATE.start_main_~a~0#1| 6)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {28632#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-21 03:05:00,506 INFO L290 TraceCheckUtils]: 39: Hoare triple {28632#(<= |ULTIMATE.start_main_~a~0#1| 6)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {28632#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-21 03:05:00,506 INFO L290 TraceCheckUtils]: 40: Hoare triple {28632#(<= |ULTIMATE.start_main_~a~0#1| 6)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {28632#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-21 03:05:00,506 INFO L290 TraceCheckUtils]: 41: Hoare triple {28632#(<= |ULTIMATE.start_main_~a~0#1| 6)} assume 1 + main_~a~0#1 <= 2147483647; {28632#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-21 03:05:00,507 INFO L290 TraceCheckUtils]: 42: Hoare triple {28632#(<= |ULTIMATE.start_main_~a~0#1| 6)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {28633#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-21 03:05:00,507 INFO L290 TraceCheckUtils]: 43: Hoare triple {28633#(<= |ULTIMATE.start_main_~a~0#1| 7)} assume 1 + main_~x~0#1 <= 2147483647; {28633#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-21 03:05:00,507 INFO L290 TraceCheckUtils]: 44: Hoare triple {28633#(<= |ULTIMATE.start_main_~a~0#1| 7)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {28633#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-21 03:05:00,508 INFO L290 TraceCheckUtils]: 45: Hoare triple {28633#(<= |ULTIMATE.start_main_~a~0#1| 7)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {28633#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-21 03:05:00,508 INFO L290 TraceCheckUtils]: 46: Hoare triple {28633#(<= |ULTIMATE.start_main_~a~0#1| 7)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {28633#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-21 03:05:00,508 INFO L290 TraceCheckUtils]: 47: Hoare triple {28633#(<= |ULTIMATE.start_main_~a~0#1| 7)} assume 1 + main_~a~0#1 <= 2147483647; {28633#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-21 03:05:00,509 INFO L290 TraceCheckUtils]: 48: Hoare triple {28633#(<= |ULTIMATE.start_main_~a~0#1| 7)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {28634#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-21 03:05:00,509 INFO L290 TraceCheckUtils]: 49: Hoare triple {28634#(<= |ULTIMATE.start_main_~a~0#1| 8)} assume 1 + main_~x~0#1 <= 2147483647; {28634#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-21 03:05:00,509 INFO L290 TraceCheckUtils]: 50: Hoare triple {28634#(<= |ULTIMATE.start_main_~a~0#1| 8)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {28634#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-21 03:05:00,510 INFO L290 TraceCheckUtils]: 51: Hoare triple {28634#(<= |ULTIMATE.start_main_~a~0#1| 8)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {28634#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-21 03:05:00,510 INFO L290 TraceCheckUtils]: 52: Hoare triple {28634#(<= |ULTIMATE.start_main_~a~0#1| 8)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {28634#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-21 03:05:00,510 INFO L290 TraceCheckUtils]: 53: Hoare triple {28634#(<= |ULTIMATE.start_main_~a~0#1| 8)} assume 1 + main_~a~0#1 <= 2147483647; {28634#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-21 03:05:00,511 INFO L290 TraceCheckUtils]: 54: Hoare triple {28634#(<= |ULTIMATE.start_main_~a~0#1| 8)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {28635#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-21 03:05:00,511 INFO L290 TraceCheckUtils]: 55: Hoare triple {28635#(<= |ULTIMATE.start_main_~a~0#1| 9)} assume 1 + main_~x~0#1 <= 2147483647; {28635#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-21 03:05:00,511 INFO L290 TraceCheckUtils]: 56: Hoare triple {28635#(<= |ULTIMATE.start_main_~a~0#1| 9)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {28635#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-21 03:05:00,512 INFO L290 TraceCheckUtils]: 57: Hoare triple {28635#(<= |ULTIMATE.start_main_~a~0#1| 9)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {28635#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-21 03:05:00,512 INFO L290 TraceCheckUtils]: 58: Hoare triple {28635#(<= |ULTIMATE.start_main_~a~0#1| 9)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {28635#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-21 03:05:00,512 INFO L290 TraceCheckUtils]: 59: Hoare triple {28635#(<= |ULTIMATE.start_main_~a~0#1| 9)} assume 1 + main_~a~0#1 <= 2147483647; {28635#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-21 03:05:00,513 INFO L290 TraceCheckUtils]: 60: Hoare triple {28635#(<= |ULTIMATE.start_main_~a~0#1| 9)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {28636#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-21 03:05:00,513 INFO L290 TraceCheckUtils]: 61: Hoare triple {28636#(<= |ULTIMATE.start_main_~a~0#1| 10)} assume 1 + main_~x~0#1 <= 2147483647; {28636#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-21 03:05:00,513 INFO L290 TraceCheckUtils]: 62: Hoare triple {28636#(<= |ULTIMATE.start_main_~a~0#1| 10)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {28636#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-21 03:05:00,513 INFO L290 TraceCheckUtils]: 63: Hoare triple {28636#(<= |ULTIMATE.start_main_~a~0#1| 10)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {28636#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-21 03:05:00,514 INFO L290 TraceCheckUtils]: 64: Hoare triple {28636#(<= |ULTIMATE.start_main_~a~0#1| 10)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {28636#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-21 03:05:00,514 INFO L290 TraceCheckUtils]: 65: Hoare triple {28636#(<= |ULTIMATE.start_main_~a~0#1| 10)} assume !(1 + main_~a~0#1 <= 2147483647); {28625#false} is VALID [2022-02-21 03:05:00,515 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:05:00,515 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:00,515 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597048192] [2022-02-21 03:05:00,515 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597048192] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:05:00,515 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566383194] [2022-02-21 03:05:00,515 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 03:05:00,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:05:00,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:05:00,526 INFO L229 MonitoredProcess]: Starting monitored process 9 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:00,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-21 03:05:00,608 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-02-21 03:05:00,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:05:00,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-21 03:05:00,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:00,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:05:00,944 INFO L290 TraceCheckUtils]: 0: Hoare triple {28624#true} assume { :begin_inline_ULTIMATE.init } true; {28624#true} is VALID [2022-02-21 03:05:00,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {28624#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~a~0#1, main_~x~0#1, main_~max~0#1;havoc main_~a~0#1;havoc main_~x~0#1;havoc main_~max~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~a~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~max~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {28624#true} is VALID [2022-02-21 03:05:00,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {28624#true} assume main_~max~0#1 > 0;main_~a~0#1 := 0;main_~x~0#1 := 1; {28626#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:05:00,945 INFO L290 TraceCheckUtils]: 3: Hoare triple {28626#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {28626#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:05:00,945 INFO L290 TraceCheckUtils]: 4: Hoare triple {28626#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {28626#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:05:00,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {28626#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume 1 + main_~a~0#1 <= 2147483647; {28626#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:05:00,946 INFO L290 TraceCheckUtils]: 6: Hoare triple {28626#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {28627#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-21 03:05:00,946 INFO L290 TraceCheckUtils]: 7: Hoare triple {28627#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume 1 + main_~x~0#1 <= 2147483647; {28627#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-21 03:05:00,946 INFO L290 TraceCheckUtils]: 8: Hoare triple {28627#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {28627#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-21 03:05:00,946 INFO L290 TraceCheckUtils]: 9: Hoare triple {28627#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {28627#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-21 03:05:00,947 INFO L290 TraceCheckUtils]: 10: Hoare triple {28627#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {28627#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-21 03:05:00,947 INFO L290 TraceCheckUtils]: 11: Hoare triple {28627#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume 1 + main_~a~0#1 <= 2147483647; {28627#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-21 03:05:00,947 INFO L290 TraceCheckUtils]: 12: Hoare triple {28627#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {28628#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-21 03:05:00,948 INFO L290 TraceCheckUtils]: 13: Hoare triple {28628#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume 1 + main_~x~0#1 <= 2147483647; {28628#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-21 03:05:00,963 INFO L290 TraceCheckUtils]: 14: Hoare triple {28628#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {28628#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-21 03:05:00,964 INFO L290 TraceCheckUtils]: 15: Hoare triple {28628#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {28628#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-21 03:05:00,964 INFO L290 TraceCheckUtils]: 16: Hoare triple {28628#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {28628#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-21 03:05:00,964 INFO L290 TraceCheckUtils]: 17: Hoare triple {28628#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume 1 + main_~a~0#1 <= 2147483647; {28628#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-21 03:05:00,965 INFO L290 TraceCheckUtils]: 18: Hoare triple {28628#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {28629#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-21 03:05:00,965 INFO L290 TraceCheckUtils]: 19: Hoare triple {28629#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume 1 + main_~x~0#1 <= 2147483647; {28629#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-21 03:05:00,966 INFO L290 TraceCheckUtils]: 20: Hoare triple {28629#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {28629#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-21 03:05:00,966 INFO L290 TraceCheckUtils]: 21: Hoare triple {28629#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {28629#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-21 03:05:00,967 INFO L290 TraceCheckUtils]: 22: Hoare triple {28629#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {28629#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-21 03:05:00,967 INFO L290 TraceCheckUtils]: 23: Hoare triple {28629#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume 1 + main_~a~0#1 <= 2147483647; {28629#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-21 03:05:00,968 INFO L290 TraceCheckUtils]: 24: Hoare triple {28629#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {28630#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-21 03:05:00,968 INFO L290 TraceCheckUtils]: 25: Hoare triple {28630#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume 1 + main_~x~0#1 <= 2147483647; {28630#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-21 03:05:00,968 INFO L290 TraceCheckUtils]: 26: Hoare triple {28630#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {28630#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-21 03:05:00,968 INFO L290 TraceCheckUtils]: 27: Hoare triple {28630#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {28630#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-21 03:05:00,969 INFO L290 TraceCheckUtils]: 28: Hoare triple {28630#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {28630#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-21 03:05:00,969 INFO L290 TraceCheckUtils]: 29: Hoare triple {28630#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume 1 + main_~a~0#1 <= 2147483647; {28630#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-21 03:05:00,969 INFO L290 TraceCheckUtils]: 30: Hoare triple {28630#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {28631#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-21 03:05:00,969 INFO L290 TraceCheckUtils]: 31: Hoare triple {28631#(<= |ULTIMATE.start_main_~a~0#1| 5)} assume 1 + main_~x~0#1 <= 2147483647; {28631#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-21 03:05:00,970 INFO L290 TraceCheckUtils]: 32: Hoare triple {28631#(<= |ULTIMATE.start_main_~a~0#1| 5)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {28631#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-21 03:05:00,970 INFO L290 TraceCheckUtils]: 33: Hoare triple {28631#(<= |ULTIMATE.start_main_~a~0#1| 5)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {28631#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-21 03:05:00,970 INFO L290 TraceCheckUtils]: 34: Hoare triple {28631#(<= |ULTIMATE.start_main_~a~0#1| 5)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {28631#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-21 03:05:00,970 INFO L290 TraceCheckUtils]: 35: Hoare triple {28631#(<= |ULTIMATE.start_main_~a~0#1| 5)} assume 1 + main_~a~0#1 <= 2147483647; {28631#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-21 03:05:00,971 INFO L290 TraceCheckUtils]: 36: Hoare triple {28631#(<= |ULTIMATE.start_main_~a~0#1| 5)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {28632#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-21 03:05:00,971 INFO L290 TraceCheckUtils]: 37: Hoare triple {28632#(<= |ULTIMATE.start_main_~a~0#1| 6)} assume 1 + main_~x~0#1 <= 2147483647; {28632#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-21 03:05:00,971 INFO L290 TraceCheckUtils]: 38: Hoare triple {28632#(<= |ULTIMATE.start_main_~a~0#1| 6)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {28632#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-21 03:05:00,971 INFO L290 TraceCheckUtils]: 39: Hoare triple {28632#(<= |ULTIMATE.start_main_~a~0#1| 6)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {28632#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-21 03:05:00,972 INFO L290 TraceCheckUtils]: 40: Hoare triple {28632#(<= |ULTIMATE.start_main_~a~0#1| 6)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {28632#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-21 03:05:00,972 INFO L290 TraceCheckUtils]: 41: Hoare triple {28632#(<= |ULTIMATE.start_main_~a~0#1| 6)} assume 1 + main_~a~0#1 <= 2147483647; {28632#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-21 03:05:00,972 INFO L290 TraceCheckUtils]: 42: Hoare triple {28632#(<= |ULTIMATE.start_main_~a~0#1| 6)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {28633#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-21 03:05:00,973 INFO L290 TraceCheckUtils]: 43: Hoare triple {28633#(<= |ULTIMATE.start_main_~a~0#1| 7)} assume 1 + main_~x~0#1 <= 2147483647; {28633#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-21 03:05:00,973 INFO L290 TraceCheckUtils]: 44: Hoare triple {28633#(<= |ULTIMATE.start_main_~a~0#1| 7)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {28633#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-21 03:05:00,973 INFO L290 TraceCheckUtils]: 45: Hoare triple {28633#(<= |ULTIMATE.start_main_~a~0#1| 7)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {28633#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-21 03:05:00,973 INFO L290 TraceCheckUtils]: 46: Hoare triple {28633#(<= |ULTIMATE.start_main_~a~0#1| 7)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {28633#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-21 03:05:00,974 INFO L290 TraceCheckUtils]: 47: Hoare triple {28633#(<= |ULTIMATE.start_main_~a~0#1| 7)} assume 1 + main_~a~0#1 <= 2147483647; {28633#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-21 03:05:00,974 INFO L290 TraceCheckUtils]: 48: Hoare triple {28633#(<= |ULTIMATE.start_main_~a~0#1| 7)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {28634#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-21 03:05:00,974 INFO L290 TraceCheckUtils]: 49: Hoare triple {28634#(<= |ULTIMATE.start_main_~a~0#1| 8)} assume 1 + main_~x~0#1 <= 2147483647; {28634#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-21 03:05:00,975 INFO L290 TraceCheckUtils]: 50: Hoare triple {28634#(<= |ULTIMATE.start_main_~a~0#1| 8)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {28634#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-21 03:05:00,975 INFO L290 TraceCheckUtils]: 51: Hoare triple {28634#(<= |ULTIMATE.start_main_~a~0#1| 8)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {28634#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-21 03:05:00,975 INFO L290 TraceCheckUtils]: 52: Hoare triple {28634#(<= |ULTIMATE.start_main_~a~0#1| 8)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {28634#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-21 03:05:00,975 INFO L290 TraceCheckUtils]: 53: Hoare triple {28634#(<= |ULTIMATE.start_main_~a~0#1| 8)} assume 1 + main_~a~0#1 <= 2147483647; {28634#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-21 03:05:00,976 INFO L290 TraceCheckUtils]: 54: Hoare triple {28634#(<= |ULTIMATE.start_main_~a~0#1| 8)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {28635#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-21 03:05:00,976 INFO L290 TraceCheckUtils]: 55: Hoare triple {28635#(<= |ULTIMATE.start_main_~a~0#1| 9)} assume 1 + main_~x~0#1 <= 2147483647; {28635#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-21 03:05:00,976 INFO L290 TraceCheckUtils]: 56: Hoare triple {28635#(<= |ULTIMATE.start_main_~a~0#1| 9)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {28635#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-21 03:05:00,977 INFO L290 TraceCheckUtils]: 57: Hoare triple {28635#(<= |ULTIMATE.start_main_~a~0#1| 9)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {28635#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-21 03:05:00,977 INFO L290 TraceCheckUtils]: 58: Hoare triple {28635#(<= |ULTIMATE.start_main_~a~0#1| 9)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {28635#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-21 03:05:00,977 INFO L290 TraceCheckUtils]: 59: Hoare triple {28635#(<= |ULTIMATE.start_main_~a~0#1| 9)} assume 1 + main_~a~0#1 <= 2147483647; {28635#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-21 03:05:00,978 INFO L290 TraceCheckUtils]: 60: Hoare triple {28635#(<= |ULTIMATE.start_main_~a~0#1| 9)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {28636#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-21 03:05:00,978 INFO L290 TraceCheckUtils]: 61: Hoare triple {28636#(<= |ULTIMATE.start_main_~a~0#1| 10)} assume 1 + main_~x~0#1 <= 2147483647; {28636#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-21 03:05:00,978 INFO L290 TraceCheckUtils]: 62: Hoare triple {28636#(<= |ULTIMATE.start_main_~a~0#1| 10)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {28636#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-21 03:05:00,978 INFO L290 TraceCheckUtils]: 63: Hoare triple {28636#(<= |ULTIMATE.start_main_~a~0#1| 10)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {28636#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-21 03:05:00,979 INFO L290 TraceCheckUtils]: 64: Hoare triple {28636#(<= |ULTIMATE.start_main_~a~0#1| 10)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {28636#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-21 03:05:00,979 INFO L290 TraceCheckUtils]: 65: Hoare triple {28636#(<= |ULTIMATE.start_main_~a~0#1| 10)} assume !(1 + main_~a~0#1 <= 2147483647); {28625#false} is VALID [2022-02-21 03:05:00,979 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:05:00,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:05:01,362 INFO L290 TraceCheckUtils]: 65: Hoare triple {28835#(<= |ULTIMATE.start_main_~a~0#1| 2147483646)} assume !(1 + main_~a~0#1 <= 2147483647); {28625#false} is VALID [2022-02-21 03:05:01,375 INFO L290 TraceCheckUtils]: 64: Hoare triple {28835#(<= |ULTIMATE.start_main_~a~0#1| 2147483646)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {28835#(<= |ULTIMATE.start_main_~a~0#1| 2147483646)} is VALID [2022-02-21 03:05:01,376 INFO L290 TraceCheckUtils]: 63: Hoare triple {28835#(<= |ULTIMATE.start_main_~a~0#1| 2147483646)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {28835#(<= |ULTIMATE.start_main_~a~0#1| 2147483646)} is VALID [2022-02-21 03:05:01,376 INFO L290 TraceCheckUtils]: 62: Hoare triple {28835#(<= |ULTIMATE.start_main_~a~0#1| 2147483646)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {28835#(<= |ULTIMATE.start_main_~a~0#1| 2147483646)} is VALID [2022-02-21 03:05:01,376 INFO L290 TraceCheckUtils]: 61: Hoare triple {28835#(<= |ULTIMATE.start_main_~a~0#1| 2147483646)} assume 1 + main_~x~0#1 <= 2147483647; {28835#(<= |ULTIMATE.start_main_~a~0#1| 2147483646)} is VALID [2022-02-21 03:05:01,377 INFO L290 TraceCheckUtils]: 60: Hoare triple {28851#(<= |ULTIMATE.start_main_~a~0#1| 2147483645)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {28835#(<= |ULTIMATE.start_main_~a~0#1| 2147483646)} is VALID [2022-02-21 03:05:01,377 INFO L290 TraceCheckUtils]: 59: Hoare triple {28851#(<= |ULTIMATE.start_main_~a~0#1| 2147483645)} assume 1 + main_~a~0#1 <= 2147483647; {28851#(<= |ULTIMATE.start_main_~a~0#1| 2147483645)} is VALID [2022-02-21 03:05:01,377 INFO L290 TraceCheckUtils]: 58: Hoare triple {28851#(<= |ULTIMATE.start_main_~a~0#1| 2147483645)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {28851#(<= |ULTIMATE.start_main_~a~0#1| 2147483645)} is VALID [2022-02-21 03:05:01,378 INFO L290 TraceCheckUtils]: 57: Hoare triple {28851#(<= |ULTIMATE.start_main_~a~0#1| 2147483645)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {28851#(<= |ULTIMATE.start_main_~a~0#1| 2147483645)} is VALID [2022-02-21 03:05:01,378 INFO L290 TraceCheckUtils]: 56: Hoare triple {28851#(<= |ULTIMATE.start_main_~a~0#1| 2147483645)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {28851#(<= |ULTIMATE.start_main_~a~0#1| 2147483645)} is VALID [2022-02-21 03:05:01,378 INFO L290 TraceCheckUtils]: 55: Hoare triple {28851#(<= |ULTIMATE.start_main_~a~0#1| 2147483645)} assume 1 + main_~x~0#1 <= 2147483647; {28851#(<= |ULTIMATE.start_main_~a~0#1| 2147483645)} is VALID [2022-02-21 03:05:01,379 INFO L290 TraceCheckUtils]: 54: Hoare triple {28870#(<= |ULTIMATE.start_main_~a~0#1| 2147483644)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {28851#(<= |ULTIMATE.start_main_~a~0#1| 2147483645)} is VALID [2022-02-21 03:05:01,379 INFO L290 TraceCheckUtils]: 53: Hoare triple {28870#(<= |ULTIMATE.start_main_~a~0#1| 2147483644)} assume 1 + main_~a~0#1 <= 2147483647; {28870#(<= |ULTIMATE.start_main_~a~0#1| 2147483644)} is VALID [2022-02-21 03:05:01,379 INFO L290 TraceCheckUtils]: 52: Hoare triple {28870#(<= |ULTIMATE.start_main_~a~0#1| 2147483644)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {28870#(<= |ULTIMATE.start_main_~a~0#1| 2147483644)} is VALID [2022-02-21 03:05:01,380 INFO L290 TraceCheckUtils]: 51: Hoare triple {28870#(<= |ULTIMATE.start_main_~a~0#1| 2147483644)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {28870#(<= |ULTIMATE.start_main_~a~0#1| 2147483644)} is VALID [2022-02-21 03:05:01,380 INFO L290 TraceCheckUtils]: 50: Hoare triple {28870#(<= |ULTIMATE.start_main_~a~0#1| 2147483644)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {28870#(<= |ULTIMATE.start_main_~a~0#1| 2147483644)} is VALID [2022-02-21 03:05:01,380 INFO L290 TraceCheckUtils]: 49: Hoare triple {28870#(<= |ULTIMATE.start_main_~a~0#1| 2147483644)} assume 1 + main_~x~0#1 <= 2147483647; {28870#(<= |ULTIMATE.start_main_~a~0#1| 2147483644)} is VALID [2022-02-21 03:05:01,381 INFO L290 TraceCheckUtils]: 48: Hoare triple {28889#(<= |ULTIMATE.start_main_~a~0#1| 2147483643)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {28870#(<= |ULTIMATE.start_main_~a~0#1| 2147483644)} is VALID [2022-02-21 03:05:01,381 INFO L290 TraceCheckUtils]: 47: Hoare triple {28889#(<= |ULTIMATE.start_main_~a~0#1| 2147483643)} assume 1 + main_~a~0#1 <= 2147483647; {28889#(<= |ULTIMATE.start_main_~a~0#1| 2147483643)} is VALID [2022-02-21 03:05:01,381 INFO L290 TraceCheckUtils]: 46: Hoare triple {28889#(<= |ULTIMATE.start_main_~a~0#1| 2147483643)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {28889#(<= |ULTIMATE.start_main_~a~0#1| 2147483643)} is VALID [2022-02-21 03:05:01,382 INFO L290 TraceCheckUtils]: 45: Hoare triple {28889#(<= |ULTIMATE.start_main_~a~0#1| 2147483643)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {28889#(<= |ULTIMATE.start_main_~a~0#1| 2147483643)} is VALID [2022-02-21 03:05:01,382 INFO L290 TraceCheckUtils]: 44: Hoare triple {28889#(<= |ULTIMATE.start_main_~a~0#1| 2147483643)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {28889#(<= |ULTIMATE.start_main_~a~0#1| 2147483643)} is VALID [2022-02-21 03:05:01,382 INFO L290 TraceCheckUtils]: 43: Hoare triple {28889#(<= |ULTIMATE.start_main_~a~0#1| 2147483643)} assume 1 + main_~x~0#1 <= 2147483647; {28889#(<= |ULTIMATE.start_main_~a~0#1| 2147483643)} is VALID [2022-02-21 03:05:01,383 INFO L290 TraceCheckUtils]: 42: Hoare triple {28908#(<= |ULTIMATE.start_main_~a~0#1| 2147483642)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {28889#(<= |ULTIMATE.start_main_~a~0#1| 2147483643)} is VALID [2022-02-21 03:05:01,383 INFO L290 TraceCheckUtils]: 41: Hoare triple {28908#(<= |ULTIMATE.start_main_~a~0#1| 2147483642)} assume 1 + main_~a~0#1 <= 2147483647; {28908#(<= |ULTIMATE.start_main_~a~0#1| 2147483642)} is VALID [2022-02-21 03:05:01,383 INFO L290 TraceCheckUtils]: 40: Hoare triple {28908#(<= |ULTIMATE.start_main_~a~0#1| 2147483642)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {28908#(<= |ULTIMATE.start_main_~a~0#1| 2147483642)} is VALID [2022-02-21 03:05:01,383 INFO L290 TraceCheckUtils]: 39: Hoare triple {28908#(<= |ULTIMATE.start_main_~a~0#1| 2147483642)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {28908#(<= |ULTIMATE.start_main_~a~0#1| 2147483642)} is VALID [2022-02-21 03:05:01,384 INFO L290 TraceCheckUtils]: 38: Hoare triple {28908#(<= |ULTIMATE.start_main_~a~0#1| 2147483642)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {28908#(<= |ULTIMATE.start_main_~a~0#1| 2147483642)} is VALID [2022-02-21 03:05:01,384 INFO L290 TraceCheckUtils]: 37: Hoare triple {28908#(<= |ULTIMATE.start_main_~a~0#1| 2147483642)} assume 1 + main_~x~0#1 <= 2147483647; {28908#(<= |ULTIMATE.start_main_~a~0#1| 2147483642)} is VALID [2022-02-21 03:05:01,384 INFO L290 TraceCheckUtils]: 36: Hoare triple {28927#(<= |ULTIMATE.start_main_~a~0#1| 2147483641)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {28908#(<= |ULTIMATE.start_main_~a~0#1| 2147483642)} is VALID [2022-02-21 03:05:01,385 INFO L290 TraceCheckUtils]: 35: Hoare triple {28927#(<= |ULTIMATE.start_main_~a~0#1| 2147483641)} assume 1 + main_~a~0#1 <= 2147483647; {28927#(<= |ULTIMATE.start_main_~a~0#1| 2147483641)} is VALID [2022-02-21 03:05:01,385 INFO L290 TraceCheckUtils]: 34: Hoare triple {28927#(<= |ULTIMATE.start_main_~a~0#1| 2147483641)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {28927#(<= |ULTIMATE.start_main_~a~0#1| 2147483641)} is VALID [2022-02-21 03:05:01,385 INFO L290 TraceCheckUtils]: 33: Hoare triple {28927#(<= |ULTIMATE.start_main_~a~0#1| 2147483641)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {28927#(<= |ULTIMATE.start_main_~a~0#1| 2147483641)} is VALID [2022-02-21 03:05:01,386 INFO L290 TraceCheckUtils]: 32: Hoare triple {28927#(<= |ULTIMATE.start_main_~a~0#1| 2147483641)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {28927#(<= |ULTIMATE.start_main_~a~0#1| 2147483641)} is VALID [2022-02-21 03:05:01,386 INFO L290 TraceCheckUtils]: 31: Hoare triple {28927#(<= |ULTIMATE.start_main_~a~0#1| 2147483641)} assume 1 + main_~x~0#1 <= 2147483647; {28927#(<= |ULTIMATE.start_main_~a~0#1| 2147483641)} is VALID [2022-02-21 03:05:01,386 INFO L290 TraceCheckUtils]: 30: Hoare triple {28946#(<= |ULTIMATE.start_main_~a~0#1| 2147483640)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {28927#(<= |ULTIMATE.start_main_~a~0#1| 2147483641)} is VALID [2022-02-21 03:05:01,387 INFO L290 TraceCheckUtils]: 29: Hoare triple {28946#(<= |ULTIMATE.start_main_~a~0#1| 2147483640)} assume 1 + main_~a~0#1 <= 2147483647; {28946#(<= |ULTIMATE.start_main_~a~0#1| 2147483640)} is VALID [2022-02-21 03:05:01,387 INFO L290 TraceCheckUtils]: 28: Hoare triple {28946#(<= |ULTIMATE.start_main_~a~0#1| 2147483640)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {28946#(<= |ULTIMATE.start_main_~a~0#1| 2147483640)} is VALID [2022-02-21 03:05:01,387 INFO L290 TraceCheckUtils]: 27: Hoare triple {28946#(<= |ULTIMATE.start_main_~a~0#1| 2147483640)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {28946#(<= |ULTIMATE.start_main_~a~0#1| 2147483640)} is VALID [2022-02-21 03:05:01,388 INFO L290 TraceCheckUtils]: 26: Hoare triple {28946#(<= |ULTIMATE.start_main_~a~0#1| 2147483640)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {28946#(<= |ULTIMATE.start_main_~a~0#1| 2147483640)} is VALID [2022-02-21 03:05:01,388 INFO L290 TraceCheckUtils]: 25: Hoare triple {28946#(<= |ULTIMATE.start_main_~a~0#1| 2147483640)} assume 1 + main_~x~0#1 <= 2147483647; {28946#(<= |ULTIMATE.start_main_~a~0#1| 2147483640)} is VALID [2022-02-21 03:05:01,388 INFO L290 TraceCheckUtils]: 24: Hoare triple {28965#(<= |ULTIMATE.start_main_~a~0#1| 2147483639)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {28946#(<= |ULTIMATE.start_main_~a~0#1| 2147483640)} is VALID [2022-02-21 03:05:01,389 INFO L290 TraceCheckUtils]: 23: Hoare triple {28965#(<= |ULTIMATE.start_main_~a~0#1| 2147483639)} assume 1 + main_~a~0#1 <= 2147483647; {28965#(<= |ULTIMATE.start_main_~a~0#1| 2147483639)} is VALID [2022-02-21 03:05:01,389 INFO L290 TraceCheckUtils]: 22: Hoare triple {28965#(<= |ULTIMATE.start_main_~a~0#1| 2147483639)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {28965#(<= |ULTIMATE.start_main_~a~0#1| 2147483639)} is VALID [2022-02-21 03:05:01,389 INFO L290 TraceCheckUtils]: 21: Hoare triple {28965#(<= |ULTIMATE.start_main_~a~0#1| 2147483639)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {28965#(<= |ULTIMATE.start_main_~a~0#1| 2147483639)} is VALID [2022-02-21 03:05:01,389 INFO L290 TraceCheckUtils]: 20: Hoare triple {28965#(<= |ULTIMATE.start_main_~a~0#1| 2147483639)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {28965#(<= |ULTIMATE.start_main_~a~0#1| 2147483639)} is VALID [2022-02-21 03:05:01,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {28965#(<= |ULTIMATE.start_main_~a~0#1| 2147483639)} assume 1 + main_~x~0#1 <= 2147483647; {28965#(<= |ULTIMATE.start_main_~a~0#1| 2147483639)} is VALID [2022-02-21 03:05:01,390 INFO L290 TraceCheckUtils]: 18: Hoare triple {28984#(<= |ULTIMATE.start_main_~a~0#1| 2147483638)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {28965#(<= |ULTIMATE.start_main_~a~0#1| 2147483639)} is VALID [2022-02-21 03:05:01,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {28984#(<= |ULTIMATE.start_main_~a~0#1| 2147483638)} assume 1 + main_~a~0#1 <= 2147483647; {28984#(<= |ULTIMATE.start_main_~a~0#1| 2147483638)} is VALID [2022-02-21 03:05:01,391 INFO L290 TraceCheckUtils]: 16: Hoare triple {28984#(<= |ULTIMATE.start_main_~a~0#1| 2147483638)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {28984#(<= |ULTIMATE.start_main_~a~0#1| 2147483638)} is VALID [2022-02-21 03:05:01,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {28984#(<= |ULTIMATE.start_main_~a~0#1| 2147483638)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {28984#(<= |ULTIMATE.start_main_~a~0#1| 2147483638)} is VALID [2022-02-21 03:05:01,391 INFO L290 TraceCheckUtils]: 14: Hoare triple {28984#(<= |ULTIMATE.start_main_~a~0#1| 2147483638)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {28984#(<= |ULTIMATE.start_main_~a~0#1| 2147483638)} is VALID [2022-02-21 03:05:01,392 INFO L290 TraceCheckUtils]: 13: Hoare triple {28984#(<= |ULTIMATE.start_main_~a~0#1| 2147483638)} assume 1 + main_~x~0#1 <= 2147483647; {28984#(<= |ULTIMATE.start_main_~a~0#1| 2147483638)} is VALID [2022-02-21 03:05:01,392 INFO L290 TraceCheckUtils]: 12: Hoare triple {29003#(<= |ULTIMATE.start_main_~a~0#1| 2147483637)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {28984#(<= |ULTIMATE.start_main_~a~0#1| 2147483638)} is VALID [2022-02-21 03:05:01,392 INFO L290 TraceCheckUtils]: 11: Hoare triple {29003#(<= |ULTIMATE.start_main_~a~0#1| 2147483637)} assume 1 + main_~a~0#1 <= 2147483647; {29003#(<= |ULTIMATE.start_main_~a~0#1| 2147483637)} is VALID [2022-02-21 03:05:01,393 INFO L290 TraceCheckUtils]: 10: Hoare triple {29003#(<= |ULTIMATE.start_main_~a~0#1| 2147483637)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {29003#(<= |ULTIMATE.start_main_~a~0#1| 2147483637)} is VALID [2022-02-21 03:05:01,393 INFO L290 TraceCheckUtils]: 9: Hoare triple {29003#(<= |ULTIMATE.start_main_~a~0#1| 2147483637)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {29003#(<= |ULTIMATE.start_main_~a~0#1| 2147483637)} is VALID [2022-02-21 03:05:01,393 INFO L290 TraceCheckUtils]: 8: Hoare triple {29003#(<= |ULTIMATE.start_main_~a~0#1| 2147483637)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {29003#(<= |ULTIMATE.start_main_~a~0#1| 2147483637)} is VALID [2022-02-21 03:05:01,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {29003#(<= |ULTIMATE.start_main_~a~0#1| 2147483637)} assume 1 + main_~x~0#1 <= 2147483647; {29003#(<= |ULTIMATE.start_main_~a~0#1| 2147483637)} is VALID [2022-02-21 03:05:01,394 INFO L290 TraceCheckUtils]: 6: Hoare triple {29022#(<= |ULTIMATE.start_main_~a~0#1| 2147483636)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {29003#(<= |ULTIMATE.start_main_~a~0#1| 2147483637)} is VALID [2022-02-21 03:05:01,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {29022#(<= |ULTIMATE.start_main_~a~0#1| 2147483636)} assume 1 + main_~a~0#1 <= 2147483647; {29022#(<= |ULTIMATE.start_main_~a~0#1| 2147483636)} is VALID [2022-02-21 03:05:01,395 INFO L290 TraceCheckUtils]: 4: Hoare triple {29022#(<= |ULTIMATE.start_main_~a~0#1| 2147483636)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {29022#(<= |ULTIMATE.start_main_~a~0#1| 2147483636)} is VALID [2022-02-21 03:05:01,395 INFO L290 TraceCheckUtils]: 3: Hoare triple {29022#(<= |ULTIMATE.start_main_~a~0#1| 2147483636)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {29022#(<= |ULTIMATE.start_main_~a~0#1| 2147483636)} is VALID [2022-02-21 03:05:01,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {28624#true} assume main_~max~0#1 > 0;main_~a~0#1 := 0;main_~x~0#1 := 1; {29022#(<= |ULTIMATE.start_main_~a~0#1| 2147483636)} is VALID [2022-02-21 03:05:01,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {28624#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~a~0#1, main_~x~0#1, main_~max~0#1;havoc main_~a~0#1;havoc main_~x~0#1;havoc main_~max~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~a~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~max~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {28624#true} is VALID [2022-02-21 03:05:01,395 INFO L290 TraceCheckUtils]: 0: Hoare triple {28624#true} assume { :begin_inline_ULTIMATE.init } true; {28624#true} is VALID [2022-02-21 03:05:01,396 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:05:01,396 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566383194] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:05:01,396 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:05:01,396 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2022-02-21 03:05:01,396 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309151880] [2022-02-21 03:05:01,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:05:01,396 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.6521739130434785) internal successors, (130), 24 states have internal predecessors, (130), 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 66 [2022-02-21 03:05:01,397 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:01,397 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 24 states, 23 states have (on average 5.6521739130434785) internal successors, (130), 24 states have internal predecessors, (130), 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:01,473 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:01,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-21 03:05:01,473 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:01,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-21 03:05:01,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2022-02-21 03:05:01,474 INFO L87 Difference]: Start difference. First operand 2080 states and 2518 transitions. Second operand has 24 states, 23 states have (on average 5.6521739130434785) internal successors, (130), 24 states have internal predecessors, (130), 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:04,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:04,417 INFO L93 Difference]: Finished difference Result 5604 states and 7380 transitions. [2022-02-21 03:05:04,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-21 03:05:04,417 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.6521739130434785) internal successors, (130), 24 states have internal predecessors, (130), 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 66 [2022-02-21 03:05:04,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:05:04,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 5.6521739130434785) internal successors, (130), 24 states have internal predecessors, (130), 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:04,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 301 transitions. [2022-02-21 03:05:04,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 5.6521739130434785) internal successors, (130), 24 states have internal predecessors, (130), 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:04,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 301 transitions. [2022-02-21 03:05:04,420 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 301 transitions. [2022-02-21 03:05:04,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 301 edges. 301 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:05,487 INFO L225 Difference]: With dead ends: 5604 [2022-02-21 03:05:05,487 INFO L226 Difference]: Without dead ends: 5602 [2022-02-21 03:05:05,489 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2022-02-21 03:05:05,489 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 219 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:05:05,490 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [219 Valid, 165 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:05:05,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5602 states. [2022-02-21 03:05:06,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5602 to 3121. [2022-02-21 03:05:06,868 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:05:06,872 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5602 states. Second operand has 3121 states, 3117 states have (on average 1.232595444337504) internal successors, (3842), 3120 states have internal predecessors, (3842), 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:06,875 INFO L74 IsIncluded]: Start isIncluded. First operand 5602 states. Second operand has 3121 states, 3117 states have (on average 1.232595444337504) internal successors, (3842), 3120 states have internal predecessors, (3842), 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:06,877 INFO L87 Difference]: Start difference. First operand 5602 states. Second operand has 3121 states, 3117 states have (on average 1.232595444337504) internal successors, (3842), 3120 states have internal predecessors, (3842), 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:07,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:07,620 INFO L93 Difference]: Finished difference Result 5602 states and 6953 transitions. [2022-02-21 03:05:07,620 INFO L276 IsEmpty]: Start isEmpty. Operand 5602 states and 6953 transitions. [2022-02-21 03:05:07,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:07,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:07,629 INFO L74 IsIncluded]: Start isIncluded. First operand has 3121 states, 3117 states have (on average 1.232595444337504) internal successors, (3842), 3120 states have internal predecessors, (3842), 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 5602 states. [2022-02-21 03:05:07,631 INFO L87 Difference]: Start difference. First operand has 3121 states, 3117 states have (on average 1.232595444337504) internal successors, (3842), 3120 states have internal predecessors, (3842), 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 5602 states. [2022-02-21 03:05:08,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:08,396 INFO L93 Difference]: Finished difference Result 5602 states and 6953 transitions. [2022-02-21 03:05:08,396 INFO L276 IsEmpty]: Start isEmpty. Operand 5602 states and 6953 transitions. [2022-02-21 03:05:08,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:08,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:08,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:05:08,402 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:05:08,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3121 states, 3117 states have (on average 1.232595444337504) internal successors, (3842), 3120 states have internal predecessors, (3842), 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:08,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 3842 transitions. [2022-02-21 03:05:08,739 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 3842 transitions. Word has length 66 [2022-02-21 03:05:08,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:08,739 INFO L470 AbstractCegarLoop]: Abstraction has 3121 states and 3842 transitions. [2022-02-21 03:05:08,739 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.6521739130434785) internal successors, (130), 24 states have internal predecessors, (130), 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:08,739 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 3842 transitions. [2022-02-21 03:05:08,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-21 03:05:08,741 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:08,741 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 1, 1, 1, 1] [2022-02-21 03:05:08,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:05:08,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-02-21 03:05:08,959 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:05:08,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:08,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1080032752, now seen corresponding path program 3 times [2022-02-21 03:05:08,960 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:08,960 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003268405] [2022-02-21 03:05:08,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:08,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:08,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:09,074 INFO L290 TraceCheckUtils]: 0: Hoare triple {50120#true} assume { :begin_inline_ULTIMATE.init } true; {50120#true} is VALID [2022-02-21 03:05:09,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {50120#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~a~0#1, main_~x~0#1, main_~max~0#1;havoc main_~a~0#1;havoc main_~x~0#1;havoc main_~max~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~a~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~max~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {50120#true} is VALID [2022-02-21 03:05:09,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {50120#true} assume main_~max~0#1 > 0;main_~a~0#1 := 0;main_~x~0#1 := 1; {50122#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:05:09,075 INFO L290 TraceCheckUtils]: 3: Hoare triple {50122#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {50122#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:05:09,076 INFO L290 TraceCheckUtils]: 4: Hoare triple {50122#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {50122#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:05:09,076 INFO L290 TraceCheckUtils]: 5: Hoare triple {50122#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 1 + main_~a~0#1 <= 2147483647; {50122#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:05:09,076 INFO L290 TraceCheckUtils]: 6: Hoare triple {50122#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {50122#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:05:09,077 INFO L290 TraceCheckUtils]: 7: Hoare triple {50122#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 1 + main_~x~0#1 <= 2147483647; {50122#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:05:09,077 INFO L290 TraceCheckUtils]: 8: Hoare triple {50122#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {50123#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:05:09,077 INFO L290 TraceCheckUtils]: 9: Hoare triple {50123#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {50123#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:05:09,078 INFO L290 TraceCheckUtils]: 10: Hoare triple {50123#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {50123#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:05:09,078 INFO L290 TraceCheckUtils]: 11: Hoare triple {50123#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 1 + main_~a~0#1 <= 2147483647; {50123#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:05:09,078 INFO L290 TraceCheckUtils]: 12: Hoare triple {50123#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {50123#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:05:09,079 INFO L290 TraceCheckUtils]: 13: Hoare triple {50123#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 1 + main_~x~0#1 <= 2147483647; {50123#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:05:09,079 INFO L290 TraceCheckUtils]: 14: Hoare triple {50123#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {50124#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:05:09,079 INFO L290 TraceCheckUtils]: 15: Hoare triple {50124#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {50124#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:05:09,080 INFO L290 TraceCheckUtils]: 16: Hoare triple {50124#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {50124#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:05:09,080 INFO L290 TraceCheckUtils]: 17: Hoare triple {50124#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume 1 + main_~a~0#1 <= 2147483647; {50124#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:05:09,080 INFO L290 TraceCheckUtils]: 18: Hoare triple {50124#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {50124#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:05:09,081 INFO L290 TraceCheckUtils]: 19: Hoare triple {50124#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume 1 + main_~x~0#1 <= 2147483647; {50124#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:05:09,081 INFO L290 TraceCheckUtils]: 20: Hoare triple {50124#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {50125#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:05:09,082 INFO L290 TraceCheckUtils]: 21: Hoare triple {50125#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {50125#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:05:09,082 INFO L290 TraceCheckUtils]: 22: Hoare triple {50125#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {50125#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:05:09,082 INFO L290 TraceCheckUtils]: 23: Hoare triple {50125#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume 1 + main_~a~0#1 <= 2147483647; {50125#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:05:09,083 INFO L290 TraceCheckUtils]: 24: Hoare triple {50125#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {50125#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:05:09,083 INFO L290 TraceCheckUtils]: 25: Hoare triple {50125#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume 1 + main_~x~0#1 <= 2147483647; {50125#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:05:09,083 INFO L290 TraceCheckUtils]: 26: Hoare triple {50125#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {50126#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-21 03:05:09,084 INFO L290 TraceCheckUtils]: 27: Hoare triple {50126#(<= |ULTIMATE.start_main_~x~0#1| 5)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {50126#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-21 03:05:09,084 INFO L290 TraceCheckUtils]: 28: Hoare triple {50126#(<= |ULTIMATE.start_main_~x~0#1| 5)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {50126#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-21 03:05:09,084 INFO L290 TraceCheckUtils]: 29: Hoare triple {50126#(<= |ULTIMATE.start_main_~x~0#1| 5)} assume 1 + main_~a~0#1 <= 2147483647; {50126#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-21 03:05:09,085 INFO L290 TraceCheckUtils]: 30: Hoare triple {50126#(<= |ULTIMATE.start_main_~x~0#1| 5)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {50126#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-21 03:05:09,085 INFO L290 TraceCheckUtils]: 31: Hoare triple {50126#(<= |ULTIMATE.start_main_~x~0#1| 5)} assume 1 + main_~x~0#1 <= 2147483647; {50126#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-21 03:05:09,085 INFO L290 TraceCheckUtils]: 32: Hoare triple {50126#(<= |ULTIMATE.start_main_~x~0#1| 5)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {50127#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-21 03:05:09,086 INFO L290 TraceCheckUtils]: 33: Hoare triple {50127#(<= |ULTIMATE.start_main_~x~0#1| 6)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {50127#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-21 03:05:09,086 INFO L290 TraceCheckUtils]: 34: Hoare triple {50127#(<= |ULTIMATE.start_main_~x~0#1| 6)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {50127#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-21 03:05:09,086 INFO L290 TraceCheckUtils]: 35: Hoare triple {50127#(<= |ULTIMATE.start_main_~x~0#1| 6)} assume 1 + main_~a~0#1 <= 2147483647; {50127#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-21 03:05:09,087 INFO L290 TraceCheckUtils]: 36: Hoare triple {50127#(<= |ULTIMATE.start_main_~x~0#1| 6)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {50127#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-21 03:05:09,087 INFO L290 TraceCheckUtils]: 37: Hoare triple {50127#(<= |ULTIMATE.start_main_~x~0#1| 6)} assume 1 + main_~x~0#1 <= 2147483647; {50127#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-21 03:05:09,088 INFO L290 TraceCheckUtils]: 38: Hoare triple {50127#(<= |ULTIMATE.start_main_~x~0#1| 6)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {50128#(<= |ULTIMATE.start_main_~x~0#1| 7)} is VALID [2022-02-21 03:05:09,088 INFO L290 TraceCheckUtils]: 39: Hoare triple {50128#(<= |ULTIMATE.start_main_~x~0#1| 7)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {50128#(<= |ULTIMATE.start_main_~x~0#1| 7)} is VALID [2022-02-21 03:05:09,088 INFO L290 TraceCheckUtils]: 40: Hoare triple {50128#(<= |ULTIMATE.start_main_~x~0#1| 7)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {50128#(<= |ULTIMATE.start_main_~x~0#1| 7)} is VALID [2022-02-21 03:05:09,089 INFO L290 TraceCheckUtils]: 41: Hoare triple {50128#(<= |ULTIMATE.start_main_~x~0#1| 7)} assume 1 + main_~a~0#1 <= 2147483647; {50128#(<= |ULTIMATE.start_main_~x~0#1| 7)} is VALID [2022-02-21 03:05:09,089 INFO L290 TraceCheckUtils]: 42: Hoare triple {50128#(<= |ULTIMATE.start_main_~x~0#1| 7)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {50128#(<= |ULTIMATE.start_main_~x~0#1| 7)} is VALID [2022-02-21 03:05:09,089 INFO L290 TraceCheckUtils]: 43: Hoare triple {50128#(<= |ULTIMATE.start_main_~x~0#1| 7)} assume 1 + main_~x~0#1 <= 2147483647; {50128#(<= |ULTIMATE.start_main_~x~0#1| 7)} is VALID [2022-02-21 03:05:09,090 INFO L290 TraceCheckUtils]: 44: Hoare triple {50128#(<= |ULTIMATE.start_main_~x~0#1| 7)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {50129#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-21 03:05:09,090 INFO L290 TraceCheckUtils]: 45: Hoare triple {50129#(<= |ULTIMATE.start_main_~x~0#1| 8)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {50129#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-21 03:05:09,090 INFO L290 TraceCheckUtils]: 46: Hoare triple {50129#(<= |ULTIMATE.start_main_~x~0#1| 8)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {50129#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-21 03:05:09,091 INFO L290 TraceCheckUtils]: 47: Hoare triple {50129#(<= |ULTIMATE.start_main_~x~0#1| 8)} assume 1 + main_~a~0#1 <= 2147483647; {50129#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-21 03:05:09,091 INFO L290 TraceCheckUtils]: 48: Hoare triple {50129#(<= |ULTIMATE.start_main_~x~0#1| 8)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {50129#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-21 03:05:09,091 INFO L290 TraceCheckUtils]: 49: Hoare triple {50129#(<= |ULTIMATE.start_main_~x~0#1| 8)} assume 1 + main_~x~0#1 <= 2147483647; {50129#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-21 03:05:09,092 INFO L290 TraceCheckUtils]: 50: Hoare triple {50129#(<= |ULTIMATE.start_main_~x~0#1| 8)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {50130#(<= |ULTIMATE.start_main_~x~0#1| 9)} is VALID [2022-02-21 03:05:09,092 INFO L290 TraceCheckUtils]: 51: Hoare triple {50130#(<= |ULTIMATE.start_main_~x~0#1| 9)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {50130#(<= |ULTIMATE.start_main_~x~0#1| 9)} is VALID [2022-02-21 03:05:09,092 INFO L290 TraceCheckUtils]: 52: Hoare triple {50130#(<= |ULTIMATE.start_main_~x~0#1| 9)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {50130#(<= |ULTIMATE.start_main_~x~0#1| 9)} is VALID [2022-02-21 03:05:09,093 INFO L290 TraceCheckUtils]: 53: Hoare triple {50130#(<= |ULTIMATE.start_main_~x~0#1| 9)} assume 1 + main_~a~0#1 <= 2147483647; {50130#(<= |ULTIMATE.start_main_~x~0#1| 9)} is VALID [2022-02-21 03:05:09,093 INFO L290 TraceCheckUtils]: 54: Hoare triple {50130#(<= |ULTIMATE.start_main_~x~0#1| 9)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {50130#(<= |ULTIMATE.start_main_~x~0#1| 9)} is VALID [2022-02-21 03:05:09,093 INFO L290 TraceCheckUtils]: 55: Hoare triple {50130#(<= |ULTIMATE.start_main_~x~0#1| 9)} assume 1 + main_~x~0#1 <= 2147483647; {50130#(<= |ULTIMATE.start_main_~x~0#1| 9)} is VALID [2022-02-21 03:05:09,094 INFO L290 TraceCheckUtils]: 56: Hoare triple {50130#(<= |ULTIMATE.start_main_~x~0#1| 9)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {50131#(<= |ULTIMATE.start_main_~x~0#1| 10)} is VALID [2022-02-21 03:05:09,094 INFO L290 TraceCheckUtils]: 57: Hoare triple {50131#(<= |ULTIMATE.start_main_~x~0#1| 10)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {50131#(<= |ULTIMATE.start_main_~x~0#1| 10)} is VALID [2022-02-21 03:05:09,094 INFO L290 TraceCheckUtils]: 58: Hoare triple {50131#(<= |ULTIMATE.start_main_~x~0#1| 10)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {50131#(<= |ULTIMATE.start_main_~x~0#1| 10)} is VALID [2022-02-21 03:05:09,095 INFO L290 TraceCheckUtils]: 59: Hoare triple {50131#(<= |ULTIMATE.start_main_~x~0#1| 10)} assume 1 + main_~a~0#1 <= 2147483647; {50131#(<= |ULTIMATE.start_main_~x~0#1| 10)} is VALID [2022-02-21 03:05:09,095 INFO L290 TraceCheckUtils]: 60: Hoare triple {50131#(<= |ULTIMATE.start_main_~x~0#1| 10)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {50131#(<= |ULTIMATE.start_main_~x~0#1| 10)} is VALID [2022-02-21 03:05:09,095 INFO L290 TraceCheckUtils]: 61: Hoare triple {50131#(<= |ULTIMATE.start_main_~x~0#1| 10)} assume 1 + main_~x~0#1 <= 2147483647; {50131#(<= |ULTIMATE.start_main_~x~0#1| 10)} is VALID [2022-02-21 03:05:09,096 INFO L290 TraceCheckUtils]: 62: Hoare triple {50131#(<= |ULTIMATE.start_main_~x~0#1| 10)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {50132#(<= |ULTIMATE.start_main_~x~0#1| 11)} is VALID [2022-02-21 03:05:09,096 INFO L290 TraceCheckUtils]: 63: Hoare triple {50132#(<= |ULTIMATE.start_main_~x~0#1| 11)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {50132#(<= |ULTIMATE.start_main_~x~0#1| 11)} is VALID [2022-02-21 03:05:09,096 INFO L290 TraceCheckUtils]: 64: Hoare triple {50132#(<= |ULTIMATE.start_main_~x~0#1| 11)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {50132#(<= |ULTIMATE.start_main_~x~0#1| 11)} is VALID [2022-02-21 03:05:09,096 INFO L290 TraceCheckUtils]: 65: Hoare triple {50132#(<= |ULTIMATE.start_main_~x~0#1| 11)} assume 1 + main_~a~0#1 <= 2147483647; {50132#(<= |ULTIMATE.start_main_~x~0#1| 11)} is VALID [2022-02-21 03:05:09,097 INFO L290 TraceCheckUtils]: 66: Hoare triple {50132#(<= |ULTIMATE.start_main_~x~0#1| 11)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {50132#(<= |ULTIMATE.start_main_~x~0#1| 11)} is VALID [2022-02-21 03:05:09,097 INFO L290 TraceCheckUtils]: 67: Hoare triple {50132#(<= |ULTIMATE.start_main_~x~0#1| 11)} assume !(1 + main_~x~0#1 <= 2147483647); {50121#false} is VALID [2022-02-21 03:05:09,097 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:05:09,098 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:09,098 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003268405] [2022-02-21 03:05:09,098 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003268405] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:05:09,098 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181507876] [2022-02-21 03:05:09,098 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 03:05:09,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:05:09,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:05:09,116 INFO L229 MonitoredProcess]: Starting monitored process 10 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:09,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-21 03:05:09,167 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-02-21 03:05:09,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:05:09,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-21 03:05:09,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:09,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:05:09,456 INFO L290 TraceCheckUtils]: 0: Hoare triple {50120#true} assume { :begin_inline_ULTIMATE.init } true; {50120#true} is VALID [2022-02-21 03:05:09,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {50120#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~a~0#1, main_~x~0#1, main_~max~0#1;havoc main_~a~0#1;havoc main_~x~0#1;havoc main_~max~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~a~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~max~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {50120#true} is VALID [2022-02-21 03:05:09,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {50120#true} assume main_~max~0#1 > 0;main_~a~0#1 := 0;main_~x~0#1 := 1; {50122#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:05:09,457 INFO L290 TraceCheckUtils]: 3: Hoare triple {50122#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {50122#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:05:09,458 INFO L290 TraceCheckUtils]: 4: Hoare triple {50122#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {50122#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:05:09,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {50122#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 1 + main_~a~0#1 <= 2147483647; {50122#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:05:09,458 INFO L290 TraceCheckUtils]: 6: Hoare triple {50122#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {50122#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:05:09,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {50122#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 1 + main_~x~0#1 <= 2147483647; {50122#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:05:09,459 INFO L290 TraceCheckUtils]: 8: Hoare triple {50122#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {50123#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:05:09,459 INFO L290 TraceCheckUtils]: 9: Hoare triple {50123#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {50123#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:05:09,460 INFO L290 TraceCheckUtils]: 10: Hoare triple {50123#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {50123#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:05:09,460 INFO L290 TraceCheckUtils]: 11: Hoare triple {50123#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 1 + main_~a~0#1 <= 2147483647; {50123#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:05:09,460 INFO L290 TraceCheckUtils]: 12: Hoare triple {50123#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {50123#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:05:09,461 INFO L290 TraceCheckUtils]: 13: Hoare triple {50123#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 1 + main_~x~0#1 <= 2147483647; {50123#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:05:09,461 INFO L290 TraceCheckUtils]: 14: Hoare triple {50123#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {50124#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:05:09,461 INFO L290 TraceCheckUtils]: 15: Hoare triple {50124#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {50124#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:05:09,462 INFO L290 TraceCheckUtils]: 16: Hoare triple {50124#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {50124#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:05:09,462 INFO L290 TraceCheckUtils]: 17: Hoare triple {50124#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume 1 + main_~a~0#1 <= 2147483647; {50124#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:05:09,462 INFO L290 TraceCheckUtils]: 18: Hoare triple {50124#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {50124#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:05:09,463 INFO L290 TraceCheckUtils]: 19: Hoare triple {50124#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume 1 + main_~x~0#1 <= 2147483647; {50124#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:05:09,463 INFO L290 TraceCheckUtils]: 20: Hoare triple {50124#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {50125#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:05:09,463 INFO L290 TraceCheckUtils]: 21: Hoare triple {50125#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {50125#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:05:09,464 INFO L290 TraceCheckUtils]: 22: Hoare triple {50125#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {50125#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:05:09,464 INFO L290 TraceCheckUtils]: 23: Hoare triple {50125#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume 1 + main_~a~0#1 <= 2147483647; {50125#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:05:09,464 INFO L290 TraceCheckUtils]: 24: Hoare triple {50125#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {50125#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:05:09,465 INFO L290 TraceCheckUtils]: 25: Hoare triple {50125#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume 1 + main_~x~0#1 <= 2147483647; {50125#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:05:09,465 INFO L290 TraceCheckUtils]: 26: Hoare triple {50125#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {50126#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-21 03:05:09,465 INFO L290 TraceCheckUtils]: 27: Hoare triple {50126#(<= |ULTIMATE.start_main_~x~0#1| 5)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {50126#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-21 03:05:09,466 INFO L290 TraceCheckUtils]: 28: Hoare triple {50126#(<= |ULTIMATE.start_main_~x~0#1| 5)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {50126#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-21 03:05:09,466 INFO L290 TraceCheckUtils]: 29: Hoare triple {50126#(<= |ULTIMATE.start_main_~x~0#1| 5)} assume 1 + main_~a~0#1 <= 2147483647; {50126#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-21 03:05:09,466 INFO L290 TraceCheckUtils]: 30: Hoare triple {50126#(<= |ULTIMATE.start_main_~x~0#1| 5)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {50126#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-21 03:05:09,466 INFO L290 TraceCheckUtils]: 31: Hoare triple {50126#(<= |ULTIMATE.start_main_~x~0#1| 5)} assume 1 + main_~x~0#1 <= 2147483647; {50126#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-21 03:05:09,467 INFO L290 TraceCheckUtils]: 32: Hoare triple {50126#(<= |ULTIMATE.start_main_~x~0#1| 5)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {50127#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-21 03:05:09,467 INFO L290 TraceCheckUtils]: 33: Hoare triple {50127#(<= |ULTIMATE.start_main_~x~0#1| 6)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {50127#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-21 03:05:09,467 INFO L290 TraceCheckUtils]: 34: Hoare triple {50127#(<= |ULTIMATE.start_main_~x~0#1| 6)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {50127#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-21 03:05:09,468 INFO L290 TraceCheckUtils]: 35: Hoare triple {50127#(<= |ULTIMATE.start_main_~x~0#1| 6)} assume 1 + main_~a~0#1 <= 2147483647; {50127#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-21 03:05:09,468 INFO L290 TraceCheckUtils]: 36: Hoare triple {50127#(<= |ULTIMATE.start_main_~x~0#1| 6)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {50127#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-21 03:05:09,468 INFO L290 TraceCheckUtils]: 37: Hoare triple {50127#(<= |ULTIMATE.start_main_~x~0#1| 6)} assume 1 + main_~x~0#1 <= 2147483647; {50127#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-21 03:05:09,469 INFO L290 TraceCheckUtils]: 38: Hoare triple {50127#(<= |ULTIMATE.start_main_~x~0#1| 6)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {50128#(<= |ULTIMATE.start_main_~x~0#1| 7)} is VALID [2022-02-21 03:05:09,469 INFO L290 TraceCheckUtils]: 39: Hoare triple {50128#(<= |ULTIMATE.start_main_~x~0#1| 7)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {50128#(<= |ULTIMATE.start_main_~x~0#1| 7)} is VALID [2022-02-21 03:05:09,469 INFO L290 TraceCheckUtils]: 40: Hoare triple {50128#(<= |ULTIMATE.start_main_~x~0#1| 7)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {50128#(<= |ULTIMATE.start_main_~x~0#1| 7)} is VALID [2022-02-21 03:05:09,470 INFO L290 TraceCheckUtils]: 41: Hoare triple {50128#(<= |ULTIMATE.start_main_~x~0#1| 7)} assume 1 + main_~a~0#1 <= 2147483647; {50128#(<= |ULTIMATE.start_main_~x~0#1| 7)} is VALID [2022-02-21 03:05:09,470 INFO L290 TraceCheckUtils]: 42: Hoare triple {50128#(<= |ULTIMATE.start_main_~x~0#1| 7)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {50128#(<= |ULTIMATE.start_main_~x~0#1| 7)} is VALID [2022-02-21 03:05:09,470 INFO L290 TraceCheckUtils]: 43: Hoare triple {50128#(<= |ULTIMATE.start_main_~x~0#1| 7)} assume 1 + main_~x~0#1 <= 2147483647; {50128#(<= |ULTIMATE.start_main_~x~0#1| 7)} is VALID [2022-02-21 03:05:09,471 INFO L290 TraceCheckUtils]: 44: Hoare triple {50128#(<= |ULTIMATE.start_main_~x~0#1| 7)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {50129#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-21 03:05:09,471 INFO L290 TraceCheckUtils]: 45: Hoare triple {50129#(<= |ULTIMATE.start_main_~x~0#1| 8)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {50129#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-21 03:05:09,471 INFO L290 TraceCheckUtils]: 46: Hoare triple {50129#(<= |ULTIMATE.start_main_~x~0#1| 8)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {50129#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-21 03:05:09,472 INFO L290 TraceCheckUtils]: 47: Hoare triple {50129#(<= |ULTIMATE.start_main_~x~0#1| 8)} assume 1 + main_~a~0#1 <= 2147483647; {50129#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-21 03:05:09,472 INFO L290 TraceCheckUtils]: 48: Hoare triple {50129#(<= |ULTIMATE.start_main_~x~0#1| 8)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {50129#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-21 03:05:09,472 INFO L290 TraceCheckUtils]: 49: Hoare triple {50129#(<= |ULTIMATE.start_main_~x~0#1| 8)} assume 1 + main_~x~0#1 <= 2147483647; {50129#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-21 03:05:09,473 INFO L290 TraceCheckUtils]: 50: Hoare triple {50129#(<= |ULTIMATE.start_main_~x~0#1| 8)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {50130#(<= |ULTIMATE.start_main_~x~0#1| 9)} is VALID [2022-02-21 03:05:09,473 INFO L290 TraceCheckUtils]: 51: Hoare triple {50130#(<= |ULTIMATE.start_main_~x~0#1| 9)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {50130#(<= |ULTIMATE.start_main_~x~0#1| 9)} is VALID [2022-02-21 03:05:09,473 INFO L290 TraceCheckUtils]: 52: Hoare triple {50130#(<= |ULTIMATE.start_main_~x~0#1| 9)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {50130#(<= |ULTIMATE.start_main_~x~0#1| 9)} is VALID [2022-02-21 03:05:09,473 INFO L290 TraceCheckUtils]: 53: Hoare triple {50130#(<= |ULTIMATE.start_main_~x~0#1| 9)} assume 1 + main_~a~0#1 <= 2147483647; {50130#(<= |ULTIMATE.start_main_~x~0#1| 9)} is VALID [2022-02-21 03:05:09,474 INFO L290 TraceCheckUtils]: 54: Hoare triple {50130#(<= |ULTIMATE.start_main_~x~0#1| 9)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {50130#(<= |ULTIMATE.start_main_~x~0#1| 9)} is VALID [2022-02-21 03:05:09,474 INFO L290 TraceCheckUtils]: 55: Hoare triple {50130#(<= |ULTIMATE.start_main_~x~0#1| 9)} assume 1 + main_~x~0#1 <= 2147483647; {50130#(<= |ULTIMATE.start_main_~x~0#1| 9)} is VALID [2022-02-21 03:05:09,474 INFO L290 TraceCheckUtils]: 56: Hoare triple {50130#(<= |ULTIMATE.start_main_~x~0#1| 9)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {50131#(<= |ULTIMATE.start_main_~x~0#1| 10)} is VALID [2022-02-21 03:05:09,475 INFO L290 TraceCheckUtils]: 57: Hoare triple {50131#(<= |ULTIMATE.start_main_~x~0#1| 10)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {50131#(<= |ULTIMATE.start_main_~x~0#1| 10)} is VALID [2022-02-21 03:05:09,475 INFO L290 TraceCheckUtils]: 58: Hoare triple {50131#(<= |ULTIMATE.start_main_~x~0#1| 10)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {50131#(<= |ULTIMATE.start_main_~x~0#1| 10)} is VALID [2022-02-21 03:05:09,475 INFO L290 TraceCheckUtils]: 59: Hoare triple {50131#(<= |ULTIMATE.start_main_~x~0#1| 10)} assume 1 + main_~a~0#1 <= 2147483647; {50131#(<= |ULTIMATE.start_main_~x~0#1| 10)} is VALID [2022-02-21 03:05:09,476 INFO L290 TraceCheckUtils]: 60: Hoare triple {50131#(<= |ULTIMATE.start_main_~x~0#1| 10)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {50131#(<= |ULTIMATE.start_main_~x~0#1| 10)} is VALID [2022-02-21 03:05:09,476 INFO L290 TraceCheckUtils]: 61: Hoare triple {50131#(<= |ULTIMATE.start_main_~x~0#1| 10)} assume 1 + main_~x~0#1 <= 2147483647; {50131#(<= |ULTIMATE.start_main_~x~0#1| 10)} is VALID [2022-02-21 03:05:09,476 INFO L290 TraceCheckUtils]: 62: Hoare triple {50131#(<= |ULTIMATE.start_main_~x~0#1| 10)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {50132#(<= |ULTIMATE.start_main_~x~0#1| 11)} is VALID [2022-02-21 03:05:09,477 INFO L290 TraceCheckUtils]: 63: Hoare triple {50132#(<= |ULTIMATE.start_main_~x~0#1| 11)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {50132#(<= |ULTIMATE.start_main_~x~0#1| 11)} is VALID [2022-02-21 03:05:09,477 INFO L290 TraceCheckUtils]: 64: Hoare triple {50132#(<= |ULTIMATE.start_main_~x~0#1| 11)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {50132#(<= |ULTIMATE.start_main_~x~0#1| 11)} is VALID [2022-02-21 03:05:09,477 INFO L290 TraceCheckUtils]: 65: Hoare triple {50132#(<= |ULTIMATE.start_main_~x~0#1| 11)} assume 1 + main_~a~0#1 <= 2147483647; {50132#(<= |ULTIMATE.start_main_~x~0#1| 11)} is VALID [2022-02-21 03:05:09,478 INFO L290 TraceCheckUtils]: 66: Hoare triple {50132#(<= |ULTIMATE.start_main_~x~0#1| 11)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {50132#(<= |ULTIMATE.start_main_~x~0#1| 11)} is VALID [2022-02-21 03:05:09,478 INFO L290 TraceCheckUtils]: 67: Hoare triple {50132#(<= |ULTIMATE.start_main_~x~0#1| 11)} assume !(1 + main_~x~0#1 <= 2147483647); {50121#false} is VALID [2022-02-21 03:05:09,478 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:05:09,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:05:09,934 INFO L290 TraceCheckUtils]: 67: Hoare triple {50337#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} assume !(1 + main_~x~0#1 <= 2147483647); {50121#false} is VALID [2022-02-21 03:05:09,935 INFO L290 TraceCheckUtils]: 66: Hoare triple {50337#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {50337#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:05:09,935 INFO L290 TraceCheckUtils]: 65: Hoare triple {50337#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} assume 1 + main_~a~0#1 <= 2147483647; {50337#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:05:09,936 INFO L290 TraceCheckUtils]: 64: Hoare triple {50337#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {50337#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:05:09,936 INFO L290 TraceCheckUtils]: 63: Hoare triple {50337#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {50337#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:05:09,936 INFO L290 TraceCheckUtils]: 62: Hoare triple {50353#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {50337#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:05:09,937 INFO L290 TraceCheckUtils]: 61: Hoare triple {50353#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume 1 + main_~x~0#1 <= 2147483647; {50353#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:05:09,937 INFO L290 TraceCheckUtils]: 60: Hoare triple {50353#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {50353#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:05:09,938 INFO L290 TraceCheckUtils]: 59: Hoare triple {50353#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume 1 + main_~a~0#1 <= 2147483647; {50353#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:05:09,938 INFO L290 TraceCheckUtils]: 58: Hoare triple {50353#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {50353#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:05:09,938 INFO L290 TraceCheckUtils]: 57: Hoare triple {50353#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {50353#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:05:09,939 INFO L290 TraceCheckUtils]: 56: Hoare triple {50372#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {50353#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:05:09,939 INFO L290 TraceCheckUtils]: 55: Hoare triple {50372#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} assume 1 + main_~x~0#1 <= 2147483647; {50372#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} is VALID [2022-02-21 03:05:09,939 INFO L290 TraceCheckUtils]: 54: Hoare triple {50372#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {50372#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} is VALID [2022-02-21 03:05:09,940 INFO L290 TraceCheckUtils]: 53: Hoare triple {50372#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} assume 1 + main_~a~0#1 <= 2147483647; {50372#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} is VALID [2022-02-21 03:05:09,940 INFO L290 TraceCheckUtils]: 52: Hoare triple {50372#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {50372#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} is VALID [2022-02-21 03:05:09,940 INFO L290 TraceCheckUtils]: 51: Hoare triple {50372#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {50372#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} is VALID [2022-02-21 03:05:09,941 INFO L290 TraceCheckUtils]: 50: Hoare triple {50391#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {50372#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} is VALID [2022-02-21 03:05:09,941 INFO L290 TraceCheckUtils]: 49: Hoare triple {50391#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} assume 1 + main_~x~0#1 <= 2147483647; {50391#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} is VALID [2022-02-21 03:05:09,941 INFO L290 TraceCheckUtils]: 48: Hoare triple {50391#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {50391#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} is VALID [2022-02-21 03:05:09,942 INFO L290 TraceCheckUtils]: 47: Hoare triple {50391#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} assume 1 + main_~a~0#1 <= 2147483647; {50391#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} is VALID [2022-02-21 03:05:09,942 INFO L290 TraceCheckUtils]: 46: Hoare triple {50391#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {50391#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} is VALID [2022-02-21 03:05:09,942 INFO L290 TraceCheckUtils]: 45: Hoare triple {50391#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {50391#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} is VALID [2022-02-21 03:05:09,943 INFO L290 TraceCheckUtils]: 44: Hoare triple {50410#(<= |ULTIMATE.start_main_~x~0#1| 2147483642)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {50391#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} is VALID [2022-02-21 03:05:09,943 INFO L290 TraceCheckUtils]: 43: Hoare triple {50410#(<= |ULTIMATE.start_main_~x~0#1| 2147483642)} assume 1 + main_~x~0#1 <= 2147483647; {50410#(<= |ULTIMATE.start_main_~x~0#1| 2147483642)} is VALID [2022-02-21 03:05:09,944 INFO L290 TraceCheckUtils]: 42: Hoare triple {50410#(<= |ULTIMATE.start_main_~x~0#1| 2147483642)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {50410#(<= |ULTIMATE.start_main_~x~0#1| 2147483642)} is VALID [2022-02-21 03:05:09,944 INFO L290 TraceCheckUtils]: 41: Hoare triple {50410#(<= |ULTIMATE.start_main_~x~0#1| 2147483642)} assume 1 + main_~a~0#1 <= 2147483647; {50410#(<= |ULTIMATE.start_main_~x~0#1| 2147483642)} is VALID [2022-02-21 03:05:09,944 INFO L290 TraceCheckUtils]: 40: Hoare triple {50410#(<= |ULTIMATE.start_main_~x~0#1| 2147483642)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {50410#(<= |ULTIMATE.start_main_~x~0#1| 2147483642)} is VALID [2022-02-21 03:05:09,945 INFO L290 TraceCheckUtils]: 39: Hoare triple {50410#(<= |ULTIMATE.start_main_~x~0#1| 2147483642)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {50410#(<= |ULTIMATE.start_main_~x~0#1| 2147483642)} is VALID [2022-02-21 03:05:09,945 INFO L290 TraceCheckUtils]: 38: Hoare triple {50429#(<= |ULTIMATE.start_main_~x~0#1| 2147483641)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {50410#(<= |ULTIMATE.start_main_~x~0#1| 2147483642)} is VALID [2022-02-21 03:05:09,945 INFO L290 TraceCheckUtils]: 37: Hoare triple {50429#(<= |ULTIMATE.start_main_~x~0#1| 2147483641)} assume 1 + main_~x~0#1 <= 2147483647; {50429#(<= |ULTIMATE.start_main_~x~0#1| 2147483641)} is VALID [2022-02-21 03:05:09,946 INFO L290 TraceCheckUtils]: 36: Hoare triple {50429#(<= |ULTIMATE.start_main_~x~0#1| 2147483641)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {50429#(<= |ULTIMATE.start_main_~x~0#1| 2147483641)} is VALID [2022-02-21 03:05:09,946 INFO L290 TraceCheckUtils]: 35: Hoare triple {50429#(<= |ULTIMATE.start_main_~x~0#1| 2147483641)} assume 1 + main_~a~0#1 <= 2147483647; {50429#(<= |ULTIMATE.start_main_~x~0#1| 2147483641)} is VALID [2022-02-21 03:05:09,946 INFO L290 TraceCheckUtils]: 34: Hoare triple {50429#(<= |ULTIMATE.start_main_~x~0#1| 2147483641)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {50429#(<= |ULTIMATE.start_main_~x~0#1| 2147483641)} is VALID [2022-02-21 03:05:09,947 INFO L290 TraceCheckUtils]: 33: Hoare triple {50429#(<= |ULTIMATE.start_main_~x~0#1| 2147483641)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {50429#(<= |ULTIMATE.start_main_~x~0#1| 2147483641)} is VALID [2022-02-21 03:05:09,947 INFO L290 TraceCheckUtils]: 32: Hoare triple {50448#(<= |ULTIMATE.start_main_~x~0#1| 2147483640)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {50429#(<= |ULTIMATE.start_main_~x~0#1| 2147483641)} is VALID [2022-02-21 03:05:09,947 INFO L290 TraceCheckUtils]: 31: Hoare triple {50448#(<= |ULTIMATE.start_main_~x~0#1| 2147483640)} assume 1 + main_~x~0#1 <= 2147483647; {50448#(<= |ULTIMATE.start_main_~x~0#1| 2147483640)} is VALID [2022-02-21 03:05:09,948 INFO L290 TraceCheckUtils]: 30: Hoare triple {50448#(<= |ULTIMATE.start_main_~x~0#1| 2147483640)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {50448#(<= |ULTIMATE.start_main_~x~0#1| 2147483640)} is VALID [2022-02-21 03:05:09,948 INFO L290 TraceCheckUtils]: 29: Hoare triple {50448#(<= |ULTIMATE.start_main_~x~0#1| 2147483640)} assume 1 + main_~a~0#1 <= 2147483647; {50448#(<= |ULTIMATE.start_main_~x~0#1| 2147483640)} is VALID [2022-02-21 03:05:09,948 INFO L290 TraceCheckUtils]: 28: Hoare triple {50448#(<= |ULTIMATE.start_main_~x~0#1| 2147483640)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {50448#(<= |ULTIMATE.start_main_~x~0#1| 2147483640)} is VALID [2022-02-21 03:05:09,949 INFO L290 TraceCheckUtils]: 27: Hoare triple {50448#(<= |ULTIMATE.start_main_~x~0#1| 2147483640)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {50448#(<= |ULTIMATE.start_main_~x~0#1| 2147483640)} is VALID [2022-02-21 03:05:09,949 INFO L290 TraceCheckUtils]: 26: Hoare triple {50467#(<= |ULTIMATE.start_main_~x~0#1| 2147483639)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {50448#(<= |ULTIMATE.start_main_~x~0#1| 2147483640)} is VALID [2022-02-21 03:05:09,949 INFO L290 TraceCheckUtils]: 25: Hoare triple {50467#(<= |ULTIMATE.start_main_~x~0#1| 2147483639)} assume 1 + main_~x~0#1 <= 2147483647; {50467#(<= |ULTIMATE.start_main_~x~0#1| 2147483639)} is VALID [2022-02-21 03:05:09,950 INFO L290 TraceCheckUtils]: 24: Hoare triple {50467#(<= |ULTIMATE.start_main_~x~0#1| 2147483639)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {50467#(<= |ULTIMATE.start_main_~x~0#1| 2147483639)} is VALID [2022-02-21 03:05:09,950 INFO L290 TraceCheckUtils]: 23: Hoare triple {50467#(<= |ULTIMATE.start_main_~x~0#1| 2147483639)} assume 1 + main_~a~0#1 <= 2147483647; {50467#(<= |ULTIMATE.start_main_~x~0#1| 2147483639)} is VALID [2022-02-21 03:05:09,950 INFO L290 TraceCheckUtils]: 22: Hoare triple {50467#(<= |ULTIMATE.start_main_~x~0#1| 2147483639)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {50467#(<= |ULTIMATE.start_main_~x~0#1| 2147483639)} is VALID [2022-02-21 03:05:09,951 INFO L290 TraceCheckUtils]: 21: Hoare triple {50467#(<= |ULTIMATE.start_main_~x~0#1| 2147483639)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {50467#(<= |ULTIMATE.start_main_~x~0#1| 2147483639)} is VALID [2022-02-21 03:05:09,951 INFO L290 TraceCheckUtils]: 20: Hoare triple {50486#(<= |ULTIMATE.start_main_~x~0#1| 2147483638)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {50467#(<= |ULTIMATE.start_main_~x~0#1| 2147483639)} is VALID [2022-02-21 03:05:09,951 INFO L290 TraceCheckUtils]: 19: Hoare triple {50486#(<= |ULTIMATE.start_main_~x~0#1| 2147483638)} assume 1 + main_~x~0#1 <= 2147483647; {50486#(<= |ULTIMATE.start_main_~x~0#1| 2147483638)} is VALID [2022-02-21 03:05:09,952 INFO L290 TraceCheckUtils]: 18: Hoare triple {50486#(<= |ULTIMATE.start_main_~x~0#1| 2147483638)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {50486#(<= |ULTIMATE.start_main_~x~0#1| 2147483638)} is VALID [2022-02-21 03:05:09,952 INFO L290 TraceCheckUtils]: 17: Hoare triple {50486#(<= |ULTIMATE.start_main_~x~0#1| 2147483638)} assume 1 + main_~a~0#1 <= 2147483647; {50486#(<= |ULTIMATE.start_main_~x~0#1| 2147483638)} is VALID [2022-02-21 03:05:09,952 INFO L290 TraceCheckUtils]: 16: Hoare triple {50486#(<= |ULTIMATE.start_main_~x~0#1| 2147483638)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {50486#(<= |ULTIMATE.start_main_~x~0#1| 2147483638)} is VALID [2022-02-21 03:05:09,953 INFO L290 TraceCheckUtils]: 15: Hoare triple {50486#(<= |ULTIMATE.start_main_~x~0#1| 2147483638)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {50486#(<= |ULTIMATE.start_main_~x~0#1| 2147483638)} is VALID [2022-02-21 03:05:09,953 INFO L290 TraceCheckUtils]: 14: Hoare triple {50505#(<= |ULTIMATE.start_main_~x~0#1| 2147483637)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {50486#(<= |ULTIMATE.start_main_~x~0#1| 2147483638)} is VALID [2022-02-21 03:05:09,953 INFO L290 TraceCheckUtils]: 13: Hoare triple {50505#(<= |ULTIMATE.start_main_~x~0#1| 2147483637)} assume 1 + main_~x~0#1 <= 2147483647; {50505#(<= |ULTIMATE.start_main_~x~0#1| 2147483637)} is VALID [2022-02-21 03:05:09,954 INFO L290 TraceCheckUtils]: 12: Hoare triple {50505#(<= |ULTIMATE.start_main_~x~0#1| 2147483637)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {50505#(<= |ULTIMATE.start_main_~x~0#1| 2147483637)} is VALID [2022-02-21 03:05:09,954 INFO L290 TraceCheckUtils]: 11: Hoare triple {50505#(<= |ULTIMATE.start_main_~x~0#1| 2147483637)} assume 1 + main_~a~0#1 <= 2147483647; {50505#(<= |ULTIMATE.start_main_~x~0#1| 2147483637)} is VALID [2022-02-21 03:05:09,954 INFO L290 TraceCheckUtils]: 10: Hoare triple {50505#(<= |ULTIMATE.start_main_~x~0#1| 2147483637)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {50505#(<= |ULTIMATE.start_main_~x~0#1| 2147483637)} is VALID [2022-02-21 03:05:09,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {50505#(<= |ULTIMATE.start_main_~x~0#1| 2147483637)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {50505#(<= |ULTIMATE.start_main_~x~0#1| 2147483637)} is VALID [2022-02-21 03:05:09,955 INFO L290 TraceCheckUtils]: 8: Hoare triple {50524#(<= |ULTIMATE.start_main_~x~0#1| 2147483636)} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {50505#(<= |ULTIMATE.start_main_~x~0#1| 2147483637)} is VALID [2022-02-21 03:05:09,955 INFO L290 TraceCheckUtils]: 7: Hoare triple {50524#(<= |ULTIMATE.start_main_~x~0#1| 2147483636)} assume 1 + main_~x~0#1 <= 2147483647; {50524#(<= |ULTIMATE.start_main_~x~0#1| 2147483636)} is VALID [2022-02-21 03:05:09,956 INFO L290 TraceCheckUtils]: 6: Hoare triple {50524#(<= |ULTIMATE.start_main_~x~0#1| 2147483636)} assume 1 + main_~a~0#1 >= -2147483648;main_~a~0#1 := 1 + main_~a~0#1; {50524#(<= |ULTIMATE.start_main_~x~0#1| 2147483636)} is VALID [2022-02-21 03:05:09,956 INFO L290 TraceCheckUtils]: 5: Hoare triple {50524#(<= |ULTIMATE.start_main_~x~0#1| 2147483636)} assume 1 + main_~a~0#1 <= 2147483647; {50524#(<= |ULTIMATE.start_main_~x~0#1| 2147483636)} is VALID [2022-02-21 03:05:09,956 INFO L290 TraceCheckUtils]: 4: Hoare triple {50524#(<= |ULTIMATE.start_main_~x~0#1| 2147483636)} assume 0 != main_#t~nondet3#1;havoc main_#t~nondet3#1; {50524#(<= |ULTIMATE.start_main_~x~0#1| 2147483636)} is VALID [2022-02-21 03:05:09,956 INFO L290 TraceCheckUtils]: 3: Hoare triple {50524#(<= |ULTIMATE.start_main_~x~0#1| 2147483636)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {50524#(<= |ULTIMATE.start_main_~x~0#1| 2147483636)} is VALID [2022-02-21 03:05:09,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {50120#true} assume main_~max~0#1 > 0;main_~a~0#1 := 0;main_~x~0#1 := 1; {50524#(<= |ULTIMATE.start_main_~x~0#1| 2147483636)} is VALID [2022-02-21 03:05:09,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {50120#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~a~0#1, main_~x~0#1, main_~max~0#1;havoc main_~a~0#1;havoc main_~x~0#1;havoc main_~max~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~a~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~max~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {50120#true} is VALID [2022-02-21 03:05:09,957 INFO L290 TraceCheckUtils]: 0: Hoare triple {50120#true} assume { :begin_inline_ULTIMATE.init } true; {50120#true} is VALID [2022-02-21 03:05:09,957 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:05:09,958 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181507876] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:05:09,958 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:05:09,958 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2022-02-21 03:05:09,958 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531104220] [2022-02-21 03:05:09,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:05:09,959 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.826086956521739) internal successors, (134), 24 states have internal predecessors, (134), 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 68 [2022-02-21 03:05:09,959 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:09,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 24 states, 23 states have (on average 5.826086956521739) internal successors, (134), 24 states have internal predecessors, (134), 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:10,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:10,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-21 03:05:10,044 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:10,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-21 03:05:10,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2022-02-21 03:05:10,045 INFO L87 Difference]: Start difference. First operand 3121 states and 3842 transitions. Second operand has 24 states, 23 states have (on average 5.826086956521739) internal successors, (134), 24 states have internal predecessors, (134), 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:20,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:20,704 INFO L93 Difference]: Finished difference Result 12257 states and 15589 transitions. [2022-02-21 03:05:20,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-21 03:05:20,704 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.826086956521739) internal successors, (134), 24 states have internal predecessors, (134), 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 68 [2022-02-21 03:05:20,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:05:20,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 5.826086956521739) internal successors, (134), 24 states have internal predecessors, (134), 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:20,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 233 transitions. [2022-02-21 03:05:20,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 5.826086956521739) internal successors, (134), 24 states have internal predecessors, (134), 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:20,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 233 transitions. [2022-02-21 03:05:20,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 233 transitions. [2022-02-21 03:05:20,846 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 233 edges. 233 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:25,020 INFO L225 Difference]: With dead ends: 12257 [2022-02-21 03:05:25,020 INFO L226 Difference]: Without dead ends: 12256 [2022-02-21 03:05:25,024 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2022-02-21 03:05:25,025 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 170 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:05:25,027 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 179 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:05:25,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12256 states. [2022-02-21 03:05:29,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12256 to 12248. [2022-02-21 03:05:29,037 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:05:29,049 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12256 states. Second operand has 12248 states, 12244 states have (on average 1.1621202221496243) internal successors, (14229), 12247 states have internal predecessors, (14229), 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,060 INFO L74 IsIncluded]: Start isIncluded. First operand 12256 states. Second operand has 12248 states, 12244 states have (on average 1.1621202221496243) internal successors, (14229), 12247 states have internal predecessors, (14229), 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,072 INFO L87 Difference]: Start difference. First operand 12256 states. Second operand has 12248 states, 12244 states have (on average 1.1621202221496243) internal successors, (14229), 12247 states have internal predecessors, (14229), 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:33,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:33,211 INFO L93 Difference]: Finished difference Result 12256 states and 14229 transitions. [2022-02-21 03:05:33,211 INFO L276 IsEmpty]: Start isEmpty. Operand 12256 states and 14229 transitions. [2022-02-21 03:05:33,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:33,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:33,233 INFO L74 IsIncluded]: Start isIncluded. First operand has 12248 states, 12244 states have (on average 1.1621202221496243) internal successors, (14229), 12247 states have internal predecessors, (14229), 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 12256 states. [2022-02-21 03:05:33,244 INFO L87 Difference]: Start difference. First operand has 12248 states, 12244 states have (on average 1.1621202221496243) internal successors, (14229), 12247 states have internal predecessors, (14229), 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 12256 states. [2022-02-21 03:05:36,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:05:36,940 INFO L93 Difference]: Finished difference Result 12256 states and 14229 transitions. [2022-02-21 03:05:36,940 INFO L276 IsEmpty]: Start isEmpty. Operand 12256 states and 14229 transitions. [2022-02-21 03:05:36,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:05:36,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:05:36,950 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:05:36,950 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:05:36,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12248 states, 12244 states have (on average 1.1621202221496243) internal successors, (14229), 12247 states have internal predecessors, (14229), 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,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12248 states to 12248 states and 14229 transitions. [2022-02-21 03:05:41,492 INFO L78 Accepts]: Start accepts. Automaton has 12248 states and 14229 transitions. Word has length 68 [2022-02-21 03:05:41,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:05:41,492 INFO L470 AbstractCegarLoop]: Abstraction has 12248 states and 14229 transitions. [2022-02-21 03:05:41,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.826086956521739) internal successors, (134), 24 states have internal predecessors, (134), 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,492 INFO L276 IsEmpty]: Start isEmpty. Operand 12248 states and 14229 transitions. [2022-02-21 03:05:41,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-21 03:05:41,496 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:05:41,497 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 1, 1, 1, 1] [2022-02-21 03:05:41,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:05:41,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-02-21 03:05:41,712 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-02-21 03:05:41,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:05:41,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1812968066, now seen corresponding path program 3 times [2022-02-21 03:05:41,712 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:05:41,713 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145060915] [2022-02-21 03:05:41,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:05:41,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:05:41,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:41,935 INFO L290 TraceCheckUtils]: 0: Hoare triple {102859#true} assume { :begin_inline_ULTIMATE.init } true; {102859#true} is VALID [2022-02-21 03:05:41,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {102859#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~a~0#1, main_~x~0#1, main_~max~0#1;havoc main_~a~0#1;havoc main_~x~0#1;havoc main_~max~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~a~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~max~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {102859#true} is VALID [2022-02-21 03:05:41,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {102859#true} assume main_~max~0#1 > 0;main_~a~0#1 := 0;main_~x~0#1 := 1; {102861#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:05:41,936 INFO L290 TraceCheckUtils]: 3: Hoare triple {102861#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {102861#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:05:41,936 INFO L290 TraceCheckUtils]: 4: Hoare triple {102861#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {102861#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:05:41,937 INFO L290 TraceCheckUtils]: 5: Hoare triple {102861#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume main_~a~0#1 - 1 <= 2147483647; {102861#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:05:41,937 INFO L290 TraceCheckUtils]: 6: Hoare triple {102861#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {102862#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:05:41,937 INFO L290 TraceCheckUtils]: 7: Hoare triple {102862#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume 1 + main_~x~0#1 <= 2147483647; {102862#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:05:41,937 INFO L290 TraceCheckUtils]: 8: Hoare triple {102862#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {102862#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:05:41,938 INFO L290 TraceCheckUtils]: 9: Hoare triple {102862#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {102862#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:05:41,938 INFO L290 TraceCheckUtils]: 10: Hoare triple {102862#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {102862#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:05:41,938 INFO L290 TraceCheckUtils]: 11: Hoare triple {102862#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume main_~a~0#1 - 1 <= 2147483647; {102862#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:05:41,938 INFO L290 TraceCheckUtils]: 12: Hoare triple {102862#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {102863#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:41,939 INFO L290 TraceCheckUtils]: 13: Hoare triple {102863#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 <= 2147483647; {102863#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:41,939 INFO L290 TraceCheckUtils]: 14: Hoare triple {102863#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {102863#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:41,939 INFO L290 TraceCheckUtils]: 15: Hoare triple {102863#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {102863#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:41,940 INFO L290 TraceCheckUtils]: 16: Hoare triple {102863#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {102863#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:41,940 INFO L290 TraceCheckUtils]: 17: Hoare triple {102863#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 <= 2147483647; {102863#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:41,940 INFO L290 TraceCheckUtils]: 18: Hoare triple {102863#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {102864#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:41,940 INFO L290 TraceCheckUtils]: 19: Hoare triple {102864#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 <= 2147483647; {102864#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:41,941 INFO L290 TraceCheckUtils]: 20: Hoare triple {102864#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {102864#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:41,941 INFO L290 TraceCheckUtils]: 21: Hoare triple {102864#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {102864#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:41,941 INFO L290 TraceCheckUtils]: 22: Hoare triple {102864#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {102864#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:41,941 INFO L290 TraceCheckUtils]: 23: Hoare triple {102864#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 <= 2147483647; {102864#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:41,942 INFO L290 TraceCheckUtils]: 24: Hoare triple {102864#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {102865#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} is VALID [2022-02-21 03:05:41,942 INFO L290 TraceCheckUtils]: 25: Hoare triple {102865#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} assume 1 + main_~x~0#1 <= 2147483647; {102865#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} is VALID [2022-02-21 03:05:41,942 INFO L290 TraceCheckUtils]: 26: Hoare triple {102865#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {102865#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} is VALID [2022-02-21 03:05:41,942 INFO L290 TraceCheckUtils]: 27: Hoare triple {102865#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {102865#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} is VALID [2022-02-21 03:05:41,943 INFO L290 TraceCheckUtils]: 28: Hoare triple {102865#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {102865#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} is VALID [2022-02-21 03:05:41,943 INFO L290 TraceCheckUtils]: 29: Hoare triple {102865#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} assume main_~a~0#1 - 1 <= 2147483647; {102865#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} is VALID [2022-02-21 03:05:41,943 INFO L290 TraceCheckUtils]: 30: Hoare triple {102865#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {102866#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:41,943 INFO L290 TraceCheckUtils]: 31: Hoare triple {102866#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 <= 2147483647; {102866#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:41,944 INFO L290 TraceCheckUtils]: 32: Hoare triple {102866#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {102866#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:41,944 INFO L290 TraceCheckUtils]: 33: Hoare triple {102866#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {102866#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:41,944 INFO L290 TraceCheckUtils]: 34: Hoare triple {102866#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {102866#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:41,945 INFO L290 TraceCheckUtils]: 35: Hoare triple {102866#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 <= 2147483647; {102866#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:41,945 INFO L290 TraceCheckUtils]: 36: Hoare triple {102866#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {102867#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:41,945 INFO L290 TraceCheckUtils]: 37: Hoare triple {102867#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 <= 2147483647; {102867#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:41,946 INFO L290 TraceCheckUtils]: 38: Hoare triple {102867#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {102867#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:41,947 INFO L290 TraceCheckUtils]: 39: Hoare triple {102867#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {102867#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:41,947 INFO L290 TraceCheckUtils]: 40: Hoare triple {102867#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {102867#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:41,947 INFO L290 TraceCheckUtils]: 41: Hoare triple {102867#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 <= 2147483647; {102867#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:41,948 INFO L290 TraceCheckUtils]: 42: Hoare triple {102867#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {102868#(<= 0 (+ 7 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:41,948 INFO L290 TraceCheckUtils]: 43: Hoare triple {102868#(<= 0 (+ 7 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 <= 2147483647; {102868#(<= 0 (+ 7 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:41,948 INFO L290 TraceCheckUtils]: 44: Hoare triple {102868#(<= 0 (+ 7 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {102868#(<= 0 (+ 7 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:41,948 INFO L290 TraceCheckUtils]: 45: Hoare triple {102868#(<= 0 (+ 7 |ULTIMATE.start_main_~a~0#1|))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {102868#(<= 0 (+ 7 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:41,949 INFO L290 TraceCheckUtils]: 46: Hoare triple {102868#(<= 0 (+ 7 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {102868#(<= 0 (+ 7 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:41,949 INFO L290 TraceCheckUtils]: 47: Hoare triple {102868#(<= 0 (+ 7 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 <= 2147483647; {102868#(<= 0 (+ 7 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:41,951 INFO L290 TraceCheckUtils]: 48: Hoare triple {102868#(<= 0 (+ 7 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {102869#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 8))} is VALID [2022-02-21 03:05:41,951 INFO L290 TraceCheckUtils]: 49: Hoare triple {102869#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 8))} assume 1 + main_~x~0#1 <= 2147483647; {102869#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 8))} is VALID [2022-02-21 03:05:41,951 INFO L290 TraceCheckUtils]: 50: Hoare triple {102869#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 8))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {102869#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 8))} is VALID [2022-02-21 03:05:41,951 INFO L290 TraceCheckUtils]: 51: Hoare triple {102869#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 8))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {102869#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 8))} is VALID [2022-02-21 03:05:41,952 INFO L290 TraceCheckUtils]: 52: Hoare triple {102869#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 8))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {102869#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 8))} is VALID [2022-02-21 03:05:41,952 INFO L290 TraceCheckUtils]: 53: Hoare triple {102869#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 8))} assume main_~a~0#1 - 1 <= 2147483647; {102869#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 8))} is VALID [2022-02-21 03:05:41,952 INFO L290 TraceCheckUtils]: 54: Hoare triple {102869#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 8))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {102870#(<= 0 (+ 9 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:41,953 INFO L290 TraceCheckUtils]: 55: Hoare triple {102870#(<= 0 (+ 9 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 <= 2147483647; {102870#(<= 0 (+ 9 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:41,953 INFO L290 TraceCheckUtils]: 56: Hoare triple {102870#(<= 0 (+ 9 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {102870#(<= 0 (+ 9 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:41,953 INFO L290 TraceCheckUtils]: 57: Hoare triple {102870#(<= 0 (+ 9 |ULTIMATE.start_main_~a~0#1|))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {102870#(<= 0 (+ 9 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:41,953 INFO L290 TraceCheckUtils]: 58: Hoare triple {102870#(<= 0 (+ 9 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {102870#(<= 0 (+ 9 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:41,954 INFO L290 TraceCheckUtils]: 59: Hoare triple {102870#(<= 0 (+ 9 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 <= 2147483647; {102870#(<= 0 (+ 9 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:41,954 INFO L290 TraceCheckUtils]: 60: Hoare triple {102870#(<= 0 (+ 9 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {102871#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 10))} is VALID [2022-02-21 03:05:41,955 INFO L290 TraceCheckUtils]: 61: Hoare triple {102871#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 10))} assume 1 + main_~x~0#1 <= 2147483647; {102871#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 10))} is VALID [2022-02-21 03:05:41,955 INFO L290 TraceCheckUtils]: 62: Hoare triple {102871#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 10))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {102871#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 10))} is VALID [2022-02-21 03:05:41,955 INFO L290 TraceCheckUtils]: 63: Hoare triple {102871#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 10))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {102871#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 10))} is VALID [2022-02-21 03:05:41,955 INFO L290 TraceCheckUtils]: 64: Hoare triple {102871#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 10))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {102871#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 10))} is VALID [2022-02-21 03:05:41,956 INFO L290 TraceCheckUtils]: 65: Hoare triple {102871#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 10))} assume main_~a~0#1 - 1 <= 2147483647; {102871#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 10))} is VALID [2022-02-21 03:05:41,956 INFO L290 TraceCheckUtils]: 66: Hoare triple {102871#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 10))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {102872#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 11))} is VALID [2022-02-21 03:05:41,956 INFO L290 TraceCheckUtils]: 67: Hoare triple {102872#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 11))} assume 1 + main_~x~0#1 <= 2147483647; {102872#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 11))} is VALID [2022-02-21 03:05:41,956 INFO L290 TraceCheckUtils]: 68: Hoare triple {102872#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 11))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {102872#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 11))} is VALID [2022-02-21 03:05:41,957 INFO L290 TraceCheckUtils]: 69: Hoare triple {102872#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 11))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {102872#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 11))} is VALID [2022-02-21 03:05:41,957 INFO L290 TraceCheckUtils]: 70: Hoare triple {102872#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 11))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {102872#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 11))} is VALID [2022-02-21 03:05:41,957 INFO L290 TraceCheckUtils]: 71: Hoare triple {102872#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 11))} assume main_~a~0#1 - 1 <= 2147483647; {102872#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 11))} is VALID [2022-02-21 03:05:41,957 INFO L290 TraceCheckUtils]: 72: Hoare triple {102872#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 11))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {102873#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 12))} is VALID [2022-02-21 03:05:41,958 INFO L290 TraceCheckUtils]: 73: Hoare triple {102873#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 12))} assume 1 + main_~x~0#1 <= 2147483647; {102873#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 12))} is VALID [2022-02-21 03:05:41,958 INFO L290 TraceCheckUtils]: 74: Hoare triple {102873#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 12))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {102873#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 12))} is VALID [2022-02-21 03:05:41,958 INFO L290 TraceCheckUtils]: 75: Hoare triple {102873#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 12))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {102873#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 12))} is VALID [2022-02-21 03:05:41,958 INFO L290 TraceCheckUtils]: 76: Hoare triple {102873#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 12))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {102873#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 12))} is VALID [2022-02-21 03:05:41,959 INFO L290 TraceCheckUtils]: 77: Hoare triple {102873#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 12))} assume main_~a~0#1 - 1 <= 2147483647; {102873#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 12))} is VALID [2022-02-21 03:05:41,959 INFO L290 TraceCheckUtils]: 78: Hoare triple {102873#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 12))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {102874#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 13))} is VALID [2022-02-21 03:05:41,959 INFO L290 TraceCheckUtils]: 79: Hoare triple {102874#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 13))} assume 1 + main_~x~0#1 <= 2147483647; {102874#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 13))} is VALID [2022-02-21 03:05:41,959 INFO L290 TraceCheckUtils]: 80: Hoare triple {102874#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 13))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {102874#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 13))} is VALID [2022-02-21 03:05:41,960 INFO L290 TraceCheckUtils]: 81: Hoare triple {102874#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 13))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {102874#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 13))} is VALID [2022-02-21 03:05:41,960 INFO L290 TraceCheckUtils]: 82: Hoare triple {102874#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 13))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {102874#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 13))} is VALID [2022-02-21 03:05:41,960 INFO L290 TraceCheckUtils]: 83: Hoare triple {102874#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 13))} assume main_~a~0#1 - 1 <= 2147483647; {102874#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 13))} is VALID [2022-02-21 03:05:41,960 INFO L290 TraceCheckUtils]: 84: Hoare triple {102874#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 13))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {102875#(<= 0 (+ 14 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:41,961 INFO L290 TraceCheckUtils]: 85: Hoare triple {102875#(<= 0 (+ 14 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 <= 2147483647; {102875#(<= 0 (+ 14 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:41,965 INFO L290 TraceCheckUtils]: 86: Hoare triple {102875#(<= 0 (+ 14 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {102875#(<= 0 (+ 14 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:41,966 INFO L290 TraceCheckUtils]: 87: Hoare triple {102875#(<= 0 (+ 14 |ULTIMATE.start_main_~a~0#1|))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {102875#(<= 0 (+ 14 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:41,966 INFO L290 TraceCheckUtils]: 88: Hoare triple {102875#(<= 0 (+ 14 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {102875#(<= 0 (+ 14 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:41,966 INFO L290 TraceCheckUtils]: 89: Hoare triple {102875#(<= 0 (+ 14 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 <= 2147483647; {102875#(<= 0 (+ 14 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:41,967 INFO L290 TraceCheckUtils]: 90: Hoare triple {102875#(<= 0 (+ 14 |ULTIMATE.start_main_~a~0#1|))} assume !(main_~a~0#1 - 1 >= -2147483648); {102860#false} is VALID [2022-02-21 03:05:41,968 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 602 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:05:41,968 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:05:41,968 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145060915] [2022-02-21 03:05:41,968 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145060915] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:05:41,968 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986821306] [2022-02-21 03:05:41,968 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 03:05:41,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:05:41,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:05:41,969 INFO L229 MonitoredProcess]: Starting monitored process 11 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:41,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-02-21 03:05:42,032 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2022-02-21 03:05:42,032 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:05:42,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-21 03:05:42,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:05:42,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:05:42,389 INFO L290 TraceCheckUtils]: 0: Hoare triple {102859#true} assume { :begin_inline_ULTIMATE.init } true; {102859#true} is VALID [2022-02-21 03:05:42,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {102859#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~a~0#1, main_~x~0#1, main_~max~0#1;havoc main_~a~0#1;havoc main_~x~0#1;havoc main_~max~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~a~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~max~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {102859#true} is VALID [2022-02-21 03:05:42,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {102859#true} assume main_~max~0#1 > 0;main_~a~0#1 := 0;main_~x~0#1 := 1; {102861#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:05:42,391 INFO L290 TraceCheckUtils]: 3: Hoare triple {102861#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {102861#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:05:42,394 INFO L290 TraceCheckUtils]: 4: Hoare triple {102861#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {102861#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:05:42,395 INFO L290 TraceCheckUtils]: 5: Hoare triple {102861#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume main_~a~0#1 - 1 <= 2147483647; {102861#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:05:42,396 INFO L290 TraceCheckUtils]: 6: Hoare triple {102861#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {102862#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:05:42,396 INFO L290 TraceCheckUtils]: 7: Hoare triple {102862#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume 1 + main_~x~0#1 <= 2147483647; {102862#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:05:42,396 INFO L290 TraceCheckUtils]: 8: Hoare triple {102862#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {102862#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:05:42,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {102862#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {102862#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:05:42,397 INFO L290 TraceCheckUtils]: 10: Hoare triple {102862#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {102862#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:05:42,397 INFO L290 TraceCheckUtils]: 11: Hoare triple {102862#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume main_~a~0#1 - 1 <= 2147483647; {102862#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:05:42,397 INFO L290 TraceCheckUtils]: 12: Hoare triple {102862#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {102863#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,398 INFO L290 TraceCheckUtils]: 13: Hoare triple {102863#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 <= 2147483647; {102863#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,398 INFO L290 TraceCheckUtils]: 14: Hoare triple {102863#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {102863#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,398 INFO L290 TraceCheckUtils]: 15: Hoare triple {102863#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {102863#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,399 INFO L290 TraceCheckUtils]: 16: Hoare triple {102863#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {102863#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,399 INFO L290 TraceCheckUtils]: 17: Hoare triple {102863#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 <= 2147483647; {102863#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,399 INFO L290 TraceCheckUtils]: 18: Hoare triple {102863#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {102864#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,400 INFO L290 TraceCheckUtils]: 19: Hoare triple {102864#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 <= 2147483647; {102864#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,400 INFO L290 TraceCheckUtils]: 20: Hoare triple {102864#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {102864#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,400 INFO L290 TraceCheckUtils]: 21: Hoare triple {102864#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {102864#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,401 INFO L290 TraceCheckUtils]: 22: Hoare triple {102864#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {102864#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,401 INFO L290 TraceCheckUtils]: 23: Hoare triple {102864#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 <= 2147483647; {102864#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,401 INFO L290 TraceCheckUtils]: 24: Hoare triple {102864#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {102865#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} is VALID [2022-02-21 03:05:42,401 INFO L290 TraceCheckUtils]: 25: Hoare triple {102865#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} assume 1 + main_~x~0#1 <= 2147483647; {102865#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} is VALID [2022-02-21 03:05:42,402 INFO L290 TraceCheckUtils]: 26: Hoare triple {102865#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {102865#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} is VALID [2022-02-21 03:05:42,402 INFO L290 TraceCheckUtils]: 27: Hoare triple {102865#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {102865#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} is VALID [2022-02-21 03:05:42,402 INFO L290 TraceCheckUtils]: 28: Hoare triple {102865#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {102865#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} is VALID [2022-02-21 03:05:42,402 INFO L290 TraceCheckUtils]: 29: Hoare triple {102865#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} assume main_~a~0#1 - 1 <= 2147483647; {102865#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} is VALID [2022-02-21 03:05:42,403 INFO L290 TraceCheckUtils]: 30: Hoare triple {102865#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {102866#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,403 INFO L290 TraceCheckUtils]: 31: Hoare triple {102866#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 <= 2147483647; {102866#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,404 INFO L290 TraceCheckUtils]: 32: Hoare triple {102866#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {102866#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,404 INFO L290 TraceCheckUtils]: 33: Hoare triple {102866#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {102866#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,404 INFO L290 TraceCheckUtils]: 34: Hoare triple {102866#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {102866#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,404 INFO L290 TraceCheckUtils]: 35: Hoare triple {102866#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 <= 2147483647; {102866#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,405 INFO L290 TraceCheckUtils]: 36: Hoare triple {102866#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {102867#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,405 INFO L290 TraceCheckUtils]: 37: Hoare triple {102867#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 <= 2147483647; {102867#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,405 INFO L290 TraceCheckUtils]: 38: Hoare triple {102867#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {102867#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,406 INFO L290 TraceCheckUtils]: 39: Hoare triple {102867#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {102867#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,406 INFO L290 TraceCheckUtils]: 40: Hoare triple {102867#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {102867#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,407 INFO L290 TraceCheckUtils]: 41: Hoare triple {102867#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 <= 2147483647; {102867#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,407 INFO L290 TraceCheckUtils]: 42: Hoare triple {102867#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {102868#(<= 0 (+ 7 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,407 INFO L290 TraceCheckUtils]: 43: Hoare triple {102868#(<= 0 (+ 7 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 <= 2147483647; {102868#(<= 0 (+ 7 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,408 INFO L290 TraceCheckUtils]: 44: Hoare triple {102868#(<= 0 (+ 7 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {102868#(<= 0 (+ 7 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,409 INFO L290 TraceCheckUtils]: 45: Hoare triple {102868#(<= 0 (+ 7 |ULTIMATE.start_main_~a~0#1|))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {102868#(<= 0 (+ 7 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,409 INFO L290 TraceCheckUtils]: 46: Hoare triple {102868#(<= 0 (+ 7 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {102868#(<= 0 (+ 7 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,409 INFO L290 TraceCheckUtils]: 47: Hoare triple {102868#(<= 0 (+ 7 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 <= 2147483647; {102868#(<= 0 (+ 7 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,409 INFO L290 TraceCheckUtils]: 48: Hoare triple {102868#(<= 0 (+ 7 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {102869#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 8))} is VALID [2022-02-21 03:05:42,410 INFO L290 TraceCheckUtils]: 49: Hoare triple {102869#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 8))} assume 1 + main_~x~0#1 <= 2147483647; {102869#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 8))} is VALID [2022-02-21 03:05:42,410 INFO L290 TraceCheckUtils]: 50: Hoare triple {102869#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 8))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {102869#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 8))} is VALID [2022-02-21 03:05:42,410 INFO L290 TraceCheckUtils]: 51: Hoare triple {102869#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 8))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {102869#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 8))} is VALID [2022-02-21 03:05:42,410 INFO L290 TraceCheckUtils]: 52: Hoare triple {102869#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 8))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {102869#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 8))} is VALID [2022-02-21 03:05:42,411 INFO L290 TraceCheckUtils]: 53: Hoare triple {102869#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 8))} assume main_~a~0#1 - 1 <= 2147483647; {102869#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 8))} is VALID [2022-02-21 03:05:42,411 INFO L290 TraceCheckUtils]: 54: Hoare triple {102869#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 8))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {102870#(<= 0 (+ 9 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,411 INFO L290 TraceCheckUtils]: 55: Hoare triple {102870#(<= 0 (+ 9 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 <= 2147483647; {102870#(<= 0 (+ 9 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,412 INFO L290 TraceCheckUtils]: 56: Hoare triple {102870#(<= 0 (+ 9 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {102870#(<= 0 (+ 9 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,412 INFO L290 TraceCheckUtils]: 57: Hoare triple {102870#(<= 0 (+ 9 |ULTIMATE.start_main_~a~0#1|))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {102870#(<= 0 (+ 9 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,412 INFO L290 TraceCheckUtils]: 58: Hoare triple {102870#(<= 0 (+ 9 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {102870#(<= 0 (+ 9 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,413 INFO L290 TraceCheckUtils]: 59: Hoare triple {102870#(<= 0 (+ 9 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 <= 2147483647; {102870#(<= 0 (+ 9 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,413 INFO L290 TraceCheckUtils]: 60: Hoare triple {102870#(<= 0 (+ 9 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {102871#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 10))} is VALID [2022-02-21 03:05:42,413 INFO L290 TraceCheckUtils]: 61: Hoare triple {102871#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 10))} assume 1 + main_~x~0#1 <= 2147483647; {102871#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 10))} is VALID [2022-02-21 03:05:42,413 INFO L290 TraceCheckUtils]: 62: Hoare triple {102871#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 10))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {102871#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 10))} is VALID [2022-02-21 03:05:42,414 INFO L290 TraceCheckUtils]: 63: Hoare triple {102871#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 10))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {102871#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 10))} is VALID [2022-02-21 03:05:42,414 INFO L290 TraceCheckUtils]: 64: Hoare triple {102871#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 10))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {102871#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 10))} is VALID [2022-02-21 03:05:42,414 INFO L290 TraceCheckUtils]: 65: Hoare triple {102871#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 10))} assume main_~a~0#1 - 1 <= 2147483647; {102871#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 10))} is VALID [2022-02-21 03:05:42,415 INFO L290 TraceCheckUtils]: 66: Hoare triple {102871#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 10))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {102872#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 11))} is VALID [2022-02-21 03:05:42,415 INFO L290 TraceCheckUtils]: 67: Hoare triple {102872#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 11))} assume 1 + main_~x~0#1 <= 2147483647; {102872#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 11))} is VALID [2022-02-21 03:05:42,415 INFO L290 TraceCheckUtils]: 68: Hoare triple {102872#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 11))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {102872#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 11))} is VALID [2022-02-21 03:05:42,415 INFO L290 TraceCheckUtils]: 69: Hoare triple {102872#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 11))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {102872#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 11))} is VALID [2022-02-21 03:05:42,416 INFO L290 TraceCheckUtils]: 70: Hoare triple {102872#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 11))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {102872#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 11))} is VALID [2022-02-21 03:05:42,416 INFO L290 TraceCheckUtils]: 71: Hoare triple {102872#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 11))} assume main_~a~0#1 - 1 <= 2147483647; {102872#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 11))} is VALID [2022-02-21 03:05:42,416 INFO L290 TraceCheckUtils]: 72: Hoare triple {102872#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 11))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {102873#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 12))} is VALID [2022-02-21 03:05:42,416 INFO L290 TraceCheckUtils]: 73: Hoare triple {102873#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 12))} assume 1 + main_~x~0#1 <= 2147483647; {102873#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 12))} is VALID [2022-02-21 03:05:42,417 INFO L290 TraceCheckUtils]: 74: Hoare triple {102873#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 12))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {102873#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 12))} is VALID [2022-02-21 03:05:42,417 INFO L290 TraceCheckUtils]: 75: Hoare triple {102873#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 12))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {102873#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 12))} is VALID [2022-02-21 03:05:42,417 INFO L290 TraceCheckUtils]: 76: Hoare triple {102873#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 12))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {102873#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 12))} is VALID [2022-02-21 03:05:42,417 INFO L290 TraceCheckUtils]: 77: Hoare triple {102873#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 12))} assume main_~a~0#1 - 1 <= 2147483647; {102873#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 12))} is VALID [2022-02-21 03:05:42,418 INFO L290 TraceCheckUtils]: 78: Hoare triple {102873#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 12))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {102874#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 13))} is VALID [2022-02-21 03:05:42,418 INFO L290 TraceCheckUtils]: 79: Hoare triple {102874#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 13))} assume 1 + main_~x~0#1 <= 2147483647; {102874#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 13))} is VALID [2022-02-21 03:05:42,418 INFO L290 TraceCheckUtils]: 80: Hoare triple {102874#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 13))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {102874#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 13))} is VALID [2022-02-21 03:05:42,419 INFO L290 TraceCheckUtils]: 81: Hoare triple {102874#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 13))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {102874#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 13))} is VALID [2022-02-21 03:05:42,419 INFO L290 TraceCheckUtils]: 82: Hoare triple {102874#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 13))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {102874#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 13))} is VALID [2022-02-21 03:05:42,419 INFO L290 TraceCheckUtils]: 83: Hoare triple {102874#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 13))} assume main_~a~0#1 - 1 <= 2147483647; {102874#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 13))} is VALID [2022-02-21 03:05:42,419 INFO L290 TraceCheckUtils]: 84: Hoare triple {102874#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 13))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {102875#(<= 0 (+ 14 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,420 INFO L290 TraceCheckUtils]: 85: Hoare triple {102875#(<= 0 (+ 14 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 <= 2147483647; {102875#(<= 0 (+ 14 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,420 INFO L290 TraceCheckUtils]: 86: Hoare triple {102875#(<= 0 (+ 14 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {102875#(<= 0 (+ 14 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,420 INFO L290 TraceCheckUtils]: 87: Hoare triple {102875#(<= 0 (+ 14 |ULTIMATE.start_main_~a~0#1|))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {102875#(<= 0 (+ 14 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,421 INFO L290 TraceCheckUtils]: 88: Hoare triple {102875#(<= 0 (+ 14 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {102875#(<= 0 (+ 14 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,421 INFO L290 TraceCheckUtils]: 89: Hoare triple {102875#(<= 0 (+ 14 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 <= 2147483647; {102875#(<= 0 (+ 14 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,421 INFO L290 TraceCheckUtils]: 90: Hoare triple {102875#(<= 0 (+ 14 |ULTIMATE.start_main_~a~0#1|))} assume !(main_~a~0#1 - 1 >= -2147483648); {102860#false} is VALID [2022-02-21 03:05:42,424 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 602 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:05:42,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:05:42,925 INFO L290 TraceCheckUtils]: 90: Hoare triple {103149#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~a~0#1|))} assume !(main_~a~0#1 - 1 >= -2147483648); {102860#false} is VALID [2022-02-21 03:05:42,925 INFO L290 TraceCheckUtils]: 89: Hoare triple {103149#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 <= 2147483647; {103149#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,925 INFO L290 TraceCheckUtils]: 88: Hoare triple {103149#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {103149#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,926 INFO L290 TraceCheckUtils]: 87: Hoare triple {103149#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~a~0#1|))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {103149#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,926 INFO L290 TraceCheckUtils]: 86: Hoare triple {103149#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {103149#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,926 INFO L290 TraceCheckUtils]: 85: Hoare triple {103149#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 <= 2147483647; {103149#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,926 INFO L290 TraceCheckUtils]: 84: Hoare triple {103168#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483646))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {103149#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,927 INFO L290 TraceCheckUtils]: 83: Hoare triple {103168#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483646))} assume main_~a~0#1 - 1 <= 2147483647; {103168#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483646))} is VALID [2022-02-21 03:05:42,927 INFO L290 TraceCheckUtils]: 82: Hoare triple {103168#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483646))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {103168#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483646))} is VALID [2022-02-21 03:05:42,927 INFO L290 TraceCheckUtils]: 81: Hoare triple {103168#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483646))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {103168#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483646))} is VALID [2022-02-21 03:05:42,927 INFO L290 TraceCheckUtils]: 80: Hoare triple {103168#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483646))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {103168#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483646))} is VALID [2022-02-21 03:05:42,931 INFO L290 TraceCheckUtils]: 79: Hoare triple {103168#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483646))} assume 1 + main_~x~0#1 <= 2147483647; {103168#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483646))} is VALID [2022-02-21 03:05:42,931 INFO L290 TraceCheckUtils]: 78: Hoare triple {103187#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {103168#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483646))} is VALID [2022-02-21 03:05:42,931 INFO L290 TraceCheckUtils]: 77: Hoare triple {103187#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 <= 2147483647; {103187#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,931 INFO L290 TraceCheckUtils]: 76: Hoare triple {103187#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {103187#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,932 INFO L290 TraceCheckUtils]: 75: Hoare triple {103187#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~a~0#1|))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {103187#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,932 INFO L290 TraceCheckUtils]: 74: Hoare triple {103187#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {103187#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,932 INFO L290 TraceCheckUtils]: 73: Hoare triple {103187#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 <= 2147483647; {103187#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,932 INFO L290 TraceCheckUtils]: 72: Hoare triple {103206#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483644))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {103187#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,933 INFO L290 TraceCheckUtils]: 71: Hoare triple {103206#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483644))} assume main_~a~0#1 - 1 <= 2147483647; {103206#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483644))} is VALID [2022-02-21 03:05:42,933 INFO L290 TraceCheckUtils]: 70: Hoare triple {103206#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483644))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {103206#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483644))} is VALID [2022-02-21 03:05:42,933 INFO L290 TraceCheckUtils]: 69: Hoare triple {103206#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483644))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {103206#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483644))} is VALID [2022-02-21 03:05:42,933 INFO L290 TraceCheckUtils]: 68: Hoare triple {103206#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483644))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {103206#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483644))} is VALID [2022-02-21 03:05:42,933 INFO L290 TraceCheckUtils]: 67: Hoare triple {103206#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483644))} assume 1 + main_~x~0#1 <= 2147483647; {103206#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483644))} is VALID [2022-02-21 03:05:42,934 INFO L290 TraceCheckUtils]: 66: Hoare triple {103225#(<= 0 (+ 2147483643 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {103206#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483644))} is VALID [2022-02-21 03:05:42,934 INFO L290 TraceCheckUtils]: 65: Hoare triple {103225#(<= 0 (+ 2147483643 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 <= 2147483647; {103225#(<= 0 (+ 2147483643 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,934 INFO L290 TraceCheckUtils]: 64: Hoare triple {103225#(<= 0 (+ 2147483643 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {103225#(<= 0 (+ 2147483643 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,934 INFO L290 TraceCheckUtils]: 63: Hoare triple {103225#(<= 0 (+ 2147483643 |ULTIMATE.start_main_~a~0#1|))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {103225#(<= 0 (+ 2147483643 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,934 INFO L290 TraceCheckUtils]: 62: Hoare triple {103225#(<= 0 (+ 2147483643 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {103225#(<= 0 (+ 2147483643 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,935 INFO L290 TraceCheckUtils]: 61: Hoare triple {103225#(<= 0 (+ 2147483643 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 <= 2147483647; {103225#(<= 0 (+ 2147483643 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,935 INFO L290 TraceCheckUtils]: 60: Hoare triple {103244#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483642))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {103225#(<= 0 (+ 2147483643 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,935 INFO L290 TraceCheckUtils]: 59: Hoare triple {103244#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483642))} assume main_~a~0#1 - 1 <= 2147483647; {103244#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483642))} is VALID [2022-02-21 03:05:42,935 INFO L290 TraceCheckUtils]: 58: Hoare triple {103244#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483642))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {103244#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483642))} is VALID [2022-02-21 03:05:42,936 INFO L290 TraceCheckUtils]: 57: Hoare triple {103244#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483642))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {103244#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483642))} is VALID [2022-02-21 03:05:42,936 INFO L290 TraceCheckUtils]: 56: Hoare triple {103244#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483642))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {103244#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483642))} is VALID [2022-02-21 03:05:42,936 INFO L290 TraceCheckUtils]: 55: Hoare triple {103244#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483642))} assume 1 + main_~x~0#1 <= 2147483647; {103244#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483642))} is VALID [2022-02-21 03:05:42,936 INFO L290 TraceCheckUtils]: 54: Hoare triple {103263#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483641))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {103244#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483642))} is VALID [2022-02-21 03:05:42,937 INFO L290 TraceCheckUtils]: 53: Hoare triple {103263#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483641))} assume main_~a~0#1 - 1 <= 2147483647; {103263#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483641))} is VALID [2022-02-21 03:05:42,937 INFO L290 TraceCheckUtils]: 52: Hoare triple {103263#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483641))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {103263#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483641))} is VALID [2022-02-21 03:05:42,937 INFO L290 TraceCheckUtils]: 51: Hoare triple {103263#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483641))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {103263#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483641))} is VALID [2022-02-21 03:05:42,937 INFO L290 TraceCheckUtils]: 50: Hoare triple {103263#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483641))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {103263#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483641))} is VALID [2022-02-21 03:05:42,938 INFO L290 TraceCheckUtils]: 49: Hoare triple {103263#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483641))} assume 1 + main_~x~0#1 <= 2147483647; {103263#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483641))} is VALID [2022-02-21 03:05:42,938 INFO L290 TraceCheckUtils]: 48: Hoare triple {103282#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483640))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {103263#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483641))} is VALID [2022-02-21 03:05:42,938 INFO L290 TraceCheckUtils]: 47: Hoare triple {103282#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483640))} assume main_~a~0#1 - 1 <= 2147483647; {103282#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483640))} is VALID [2022-02-21 03:05:42,939 INFO L290 TraceCheckUtils]: 46: Hoare triple {103282#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483640))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {103282#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483640))} is VALID [2022-02-21 03:05:42,939 INFO L290 TraceCheckUtils]: 45: Hoare triple {103282#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483640))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {103282#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483640))} is VALID [2022-02-21 03:05:42,939 INFO L290 TraceCheckUtils]: 44: Hoare triple {103282#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483640))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {103282#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483640))} is VALID [2022-02-21 03:05:42,939 INFO L290 TraceCheckUtils]: 43: Hoare triple {103282#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483640))} assume 1 + main_~x~0#1 <= 2147483647; {103282#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483640))} is VALID [2022-02-21 03:05:42,940 INFO L290 TraceCheckUtils]: 42: Hoare triple {103301#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483639))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {103282#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483640))} is VALID [2022-02-21 03:05:42,940 INFO L290 TraceCheckUtils]: 41: Hoare triple {103301#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483639))} assume main_~a~0#1 - 1 <= 2147483647; {103301#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483639))} is VALID [2022-02-21 03:05:42,940 INFO L290 TraceCheckUtils]: 40: Hoare triple {103301#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483639))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {103301#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483639))} is VALID [2022-02-21 03:05:42,940 INFO L290 TraceCheckUtils]: 39: Hoare triple {103301#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483639))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {103301#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483639))} is VALID [2022-02-21 03:05:42,940 INFO L290 TraceCheckUtils]: 38: Hoare triple {103301#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483639))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {103301#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483639))} is VALID [2022-02-21 03:05:42,941 INFO L290 TraceCheckUtils]: 37: Hoare triple {103301#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483639))} assume 1 + main_~x~0#1 <= 2147483647; {103301#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483639))} is VALID [2022-02-21 03:05:42,941 INFO L290 TraceCheckUtils]: 36: Hoare triple {103320#(<= 0 (+ 2147483638 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {103301#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483639))} is VALID [2022-02-21 03:05:42,941 INFO L290 TraceCheckUtils]: 35: Hoare triple {103320#(<= 0 (+ 2147483638 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 - 1 <= 2147483647; {103320#(<= 0 (+ 2147483638 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,942 INFO L290 TraceCheckUtils]: 34: Hoare triple {103320#(<= 0 (+ 2147483638 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {103320#(<= 0 (+ 2147483638 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,942 INFO L290 TraceCheckUtils]: 33: Hoare triple {103320#(<= 0 (+ 2147483638 |ULTIMATE.start_main_~a~0#1|))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {103320#(<= 0 (+ 2147483638 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,942 INFO L290 TraceCheckUtils]: 32: Hoare triple {103320#(<= 0 (+ 2147483638 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {103320#(<= 0 (+ 2147483638 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,942 INFO L290 TraceCheckUtils]: 31: Hoare triple {103320#(<= 0 (+ 2147483638 |ULTIMATE.start_main_~a~0#1|))} assume 1 + main_~x~0#1 <= 2147483647; {103320#(<= 0 (+ 2147483638 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,943 INFO L290 TraceCheckUtils]: 30: Hoare triple {103339#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483637))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {103320#(<= 0 (+ 2147483638 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:05:42,943 INFO L290 TraceCheckUtils]: 29: Hoare triple {103339#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483637))} assume main_~a~0#1 - 1 <= 2147483647; {103339#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483637))} is VALID [2022-02-21 03:05:42,943 INFO L290 TraceCheckUtils]: 28: Hoare triple {103339#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483637))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {103339#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483637))} is VALID [2022-02-21 03:05:42,943 INFO L290 TraceCheckUtils]: 27: Hoare triple {103339#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483637))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {103339#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483637))} is VALID [2022-02-21 03:05:42,944 INFO L290 TraceCheckUtils]: 26: Hoare triple {103339#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483637))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {103339#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483637))} is VALID [2022-02-21 03:05:42,944 INFO L290 TraceCheckUtils]: 25: Hoare triple {103339#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483637))} assume 1 + main_~x~0#1 <= 2147483647; {103339#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483637))} is VALID [2022-02-21 03:05:42,944 INFO L290 TraceCheckUtils]: 24: Hoare triple {103358#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483636))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {103339#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483637))} is VALID [2022-02-21 03:05:42,944 INFO L290 TraceCheckUtils]: 23: Hoare triple {103358#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483636))} assume main_~a~0#1 - 1 <= 2147483647; {103358#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483636))} is VALID [2022-02-21 03:05:42,945 INFO L290 TraceCheckUtils]: 22: Hoare triple {103358#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483636))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {103358#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483636))} is VALID [2022-02-21 03:05:42,945 INFO L290 TraceCheckUtils]: 21: Hoare triple {103358#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483636))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {103358#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483636))} is VALID [2022-02-21 03:05:42,945 INFO L290 TraceCheckUtils]: 20: Hoare triple {103358#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483636))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {103358#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483636))} is VALID [2022-02-21 03:05:42,945 INFO L290 TraceCheckUtils]: 19: Hoare triple {103358#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483636))} assume 1 + main_~x~0#1 <= 2147483647; {103358#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483636))} is VALID [2022-02-21 03:05:42,946 INFO L290 TraceCheckUtils]: 18: Hoare triple {103377#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483635))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {103358#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483636))} is VALID [2022-02-21 03:05:42,946 INFO L290 TraceCheckUtils]: 17: Hoare triple {103377#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483635))} assume main_~a~0#1 - 1 <= 2147483647; {103377#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483635))} is VALID [2022-02-21 03:05:42,946 INFO L290 TraceCheckUtils]: 16: Hoare triple {103377#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483635))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {103377#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483635))} is VALID [2022-02-21 03:05:42,946 INFO L290 TraceCheckUtils]: 15: Hoare triple {103377#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483635))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {103377#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483635))} is VALID [2022-02-21 03:05:42,946 INFO L290 TraceCheckUtils]: 14: Hoare triple {103377#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483635))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {103377#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483635))} is VALID [2022-02-21 03:05:42,947 INFO L290 TraceCheckUtils]: 13: Hoare triple {103377#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483635))} assume 1 + main_~x~0#1 <= 2147483647; {103377#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483635))} is VALID [2022-02-21 03:05:42,947 INFO L290 TraceCheckUtils]: 12: Hoare triple {103396#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483634))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {103377#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483635))} is VALID [2022-02-21 03:05:42,947 INFO L290 TraceCheckUtils]: 11: Hoare triple {103396#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483634))} assume main_~a~0#1 - 1 <= 2147483647; {103396#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483634))} is VALID [2022-02-21 03:05:42,947 INFO L290 TraceCheckUtils]: 10: Hoare triple {103396#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483634))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {103396#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483634))} is VALID [2022-02-21 03:05:42,948 INFO L290 TraceCheckUtils]: 9: Hoare triple {103396#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483634))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {103396#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483634))} is VALID [2022-02-21 03:05:42,948 INFO L290 TraceCheckUtils]: 8: Hoare triple {103396#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483634))} assume 1 + main_~x~0#1 >= -2147483648;main_~x~0#1 := 1 + main_~x~0#1; {103396#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483634))} is VALID [2022-02-21 03:05:42,948 INFO L290 TraceCheckUtils]: 7: Hoare triple {103396#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483634))} assume 1 + main_~x~0#1 <= 2147483647; {103396#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483634))} is VALID [2022-02-21 03:05:42,948 INFO L290 TraceCheckUtils]: 6: Hoare triple {103415#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483633))} assume main_~a~0#1 - 1 >= -2147483648;main_~a~0#1 := main_~a~0#1 - 1; {103396#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483634))} is VALID [2022-02-21 03:05:42,949 INFO L290 TraceCheckUtils]: 5: Hoare triple {103415#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483633))} assume main_~a~0#1 - 1 <= 2147483647; {103415#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483633))} is VALID [2022-02-21 03:05:42,949 INFO L290 TraceCheckUtils]: 4: Hoare triple {103415#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483633))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {103415#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483633))} is VALID [2022-02-21 03:05:42,949 INFO L290 TraceCheckUtils]: 3: Hoare triple {103415#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483633))} assume !!(main_~x~0#1 <= main_~max~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {103415#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483633))} is VALID [2022-02-21 03:05:42,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {102859#true} assume main_~max~0#1 > 0;main_~a~0#1 := 0;main_~x~0#1 := 1; {103415#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483633))} is VALID [2022-02-21 03:05:42,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {102859#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~a~0#1, main_~x~0#1, main_~max~0#1;havoc main_~a~0#1;havoc main_~x~0#1;havoc main_~max~0#1;assume -2147483648 <= main_#t~nondet0#1 && main_#t~nondet0#1 <= 2147483647;main_~a~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~x~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~max~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {102859#true} is VALID [2022-02-21 03:05:42,949 INFO L290 TraceCheckUtils]: 0: Hoare triple {102859#true} assume { :begin_inline_ULTIMATE.init } true; {102859#true} is VALID [2022-02-21 03:05:42,950 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 602 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:05:42,950 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986821306] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:05:42,950 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:05:42,950 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2022-02-21 03:05:42,950 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639772272] [2022-02-21 03:05:42,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:05:42,951 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 5.806451612903226) internal successors, (180), 32 states have internal predecessors, (180), 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 91 [2022-02-21 03:05:42,951 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:05:42,951 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 32 states, 31 states have (on average 5.806451612903226) internal successors, (180), 32 states have internal predecessors, (180), 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,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:05:43,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-02-21 03:05:43,091 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:05:43,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-02-21 03:05:43,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2022-02-21 03:05:43,092 INFO L87 Difference]: Start difference. First operand 12248 states and 14229 transitions. Second operand has 32 states, 31 states have (on average 5.806451612903226) internal successors, (180), 32 states have internal predecessors, (180), 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)