./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-random1d-1.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/AliasDarteFeautrierGonnord-SAS2010-random1d-1.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 f79e4118373e847e0fb27fcdde0c282d507ddb96f3173b4556e1de9cae44280f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:03:45,763 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:03:45,765 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:03:45,797 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:03:45,798 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:03:45,800 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:03:45,802 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:03:45,804 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:03:45,805 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:03:45,808 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:03:45,809 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:03:45,810 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:03:45,810 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:03:45,812 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:03:45,813 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:03:45,815 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:03:45,816 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:03:45,817 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:03:45,818 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:03:45,823 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:03:45,824 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:03:45,825 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:03:45,826 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:03:45,827 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:03:45,831 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:03:45,832 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:03:45,832 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:03:45,833 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:03:45,834 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:03:45,834 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:03:45,834 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:03:45,835 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:03:45,836 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:03:45,837 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:03:45,838 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:03:45,838 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:03:45,838 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:03:45,839 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:03:45,839 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:03:45,839 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:03:45,840 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:03:45,841 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:03:45,864 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:03:45,866 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:03:45,866 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:03:45,866 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:03:45,867 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:03:45,867 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:03:45,868 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:03:45,868 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:03:45,868 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:03:45,868 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:03:45,869 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:03:45,869 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:03:45,869 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:03:45,870 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:03:45,870 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:03:45,870 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:03:45,870 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:03:45,870 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:03:45,870 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:03:45,871 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:03:45,871 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:03:45,871 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:03:45,871 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:03:45,871 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:03:45,872 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:03:45,872 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:03:45,872 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:03:45,872 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:03:45,872 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:03:45,872 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:03:45,873 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 -> f79e4118373e847e0fb27fcdde0c282d507ddb96f3173b4556e1de9cae44280f [2022-02-21 03:03:46,081 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:03:46,098 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:03:46,100 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:03:46,101 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:03:46,102 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:03:46,103 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-random1d-1.c [2022-02-21 03:03:46,149 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c53d19eb/5fdf95c90a5740599771f3d82d3847b4/FLAG7e549a4ac [2022-02-21 03:03:46,488 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:03:46,488 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-random1d-1.c [2022-02-21 03:03:46,496 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c53d19eb/5fdf95c90a5740599771f3d82d3847b4/FLAG7e549a4ac [2022-02-21 03:03:46,508 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c53d19eb/5fdf95c90a5740599771f3d82d3847b4 [2022-02-21 03:03:46,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:03:46,512 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:03:46,515 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:03:46,515 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:03:46,517 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:03:46,518 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:03:46" (1/1) ... [2022-02-21 03:03:46,519 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d81d238 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:46, skipping insertion in model container [2022-02-21 03:03:46,520 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:03:46" (1/1) ... [2022-02-21 03:03:46,525 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:03:46,534 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:03:46,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:03:46,674 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:03:46,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:03:46,700 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:03:46,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:46 WrapperNode [2022-02-21 03:03:46,701 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:03:46,702 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:03:46,703 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:03:46,703 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:03:46,708 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:03:46" (1/1) ... [2022-02-21 03:03:46,712 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:03:46" (1/1) ... [2022-02-21 03:03:46,729 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 30 [2022-02-21 03:03:46,730 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:03:46,730 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:03:46,730 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:03:46,731 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:03:46,736 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:46" (1/1) ... [2022-02-21 03:03:46,737 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:46" (1/1) ... [2022-02-21 03:03:46,737 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:46" (1/1) ... [2022-02-21 03:03:46,738 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:46" (1/1) ... [2022-02-21 03:03:46,740 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:46" (1/1) ... [2022-02-21 03:03:46,744 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:46" (1/1) ... [2022-02-21 03:03:46,747 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:46" (1/1) ... [2022-02-21 03:03:46,748 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:03:46,749 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:03:46,750 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:03:46,750 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:03:46,751 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:46" (1/1) ... [2022-02-21 03:03:46,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:03:46,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:03:46,781 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:03:46,799 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:03:46,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:03:46,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:03:46,851 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:03:46,853 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:03:46,982 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:03:46,986 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:03:46,987 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:03:46,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:03:46 BoogieIcfgContainer [2022-02-21 03:03:46,988 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:03:46,989 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:03:46,989 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:03:46,992 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:03:46,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:03:46" (1/3) ... [2022-02-21 03:03:46,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14783bf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:03:46, skipping insertion in model container [2022-02-21 03:03:46,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:03:46" (2/3) ... [2022-02-21 03:03:46,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14783bf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:03:46, skipping insertion in model container [2022-02-21 03:03:46,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:03:46" (3/3) ... [2022-02-21 03:03:46,994 INFO L111 eAbstractionObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-random1d-1.c [2022-02-21 03:03:46,997 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:03:46,998 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-02-21 03:03:47,045 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:03:47,051 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:03:47,052 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-02-21 03:03:47,068 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:03:47,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-21 03:03:47,071 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:47,071 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:03:47,072 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:03:47,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:47,075 INFO L85 PathProgramCache]: Analyzing trace with hash 889513677, now seen corresponding path program 1 times [2022-02-21 03:03:47,081 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:47,081 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202940227] [2022-02-21 03:03:47,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:47,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:47,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:47,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {24#true} assume { :begin_inline_ULTIMATE.init } true; {24#true} is VALID [2022-02-21 03:03:47,228 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_~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_~max~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {24#true} is VALID [2022-02-21 03:03:47,230 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:03:47,231 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {26#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:03:47,231 INFO L290 TraceCheckUtils]: 4: Hoare triple {26#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {26#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:03:47,236 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:03:47,238 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:03:47,238 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:47,238 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202940227] [2022-02-21 03:03:47,239 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202940227] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:03:47,239 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:03:47,240 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:03:47,241 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584493203] [2022-02-21 03:03:47,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:03:47,253 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:03:47,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:47,256 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:03:47,264 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:03:47,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:03:47,265 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:47,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:03:47,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:03:47,284 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:03:47,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:47,362 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-02-21 03:03:47,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:03:47,363 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:03:47,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:47,364 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:03:47,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-02-21 03:03:47,371 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:03:47,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-02-21 03:03:47,377 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 47 transitions. [2022-02-21 03:03:47,443 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:03:47,449 INFO L225 Difference]: With dead ends: 41 [2022-02-21 03:03:47,451 INFO L226 Difference]: Without dead ends: 27 [2022-02-21 03:03:47,454 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:03:47,458 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:03:47,458 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:03:47,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-21 03:03:47,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2022-02-21 03:03:47,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:47,480 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:03:47,480 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:03:47,481 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:03:47,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:47,486 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-02-21 03:03:47,486 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-02-21 03:03:47,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:47,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:47,487 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:03:47,488 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:03:47,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:47,490 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-02-21 03:03:47,491 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-02-21 03:03:47,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:47,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:47,491 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:47,492 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:47,493 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:03:47,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2022-02-21 03:03:47,496 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 6 [2022-02-21 03:03:47,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:47,496 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2022-02-21 03:03:47,497 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:03:47,497 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-02-21 03:03:47,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-21 03:03:47,497 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:47,498 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:03:47,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:03:47,498 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:03:47,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:47,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1805120262, now seen corresponding path program 1 times [2022-02-21 03:03:47,502 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:47,503 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681025442] [2022-02-21 03:03:47,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:47,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:47,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:47,533 INFO L290 TraceCheckUtils]: 0: Hoare triple {155#true} assume { :begin_inline_ULTIMATE.init } true; {155#true} is VALID [2022-02-21 03:03:47,533 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_~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_~max~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {155#true} is VALID [2022-02-21 03:03:47,534 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:03:47,534 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {157#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:03:47,535 INFO L290 TraceCheckUtils]: 4: Hoare triple {157#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {157#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:03:47,535 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:03:47,536 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:03:47,536 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:03:47,536 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:47,536 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681025442] [2022-02-21 03:03:47,537 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681025442] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:03:47,537 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:03:47,537 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:03:47,537 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603753256] [2022-02-21 03:03:47,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:03:47,538 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:03:47,539 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:47,539 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:03:47,544 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:03:47,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:03:47,545 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:47,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:03:47,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:03:47,546 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:03:47,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:47,580 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-02-21 03:03:47,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:03:47,580 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:03:47,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:47,580 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:03:47,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-02-21 03:03:47,581 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:03:47,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-02-21 03:03:47,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 33 transitions. [2022-02-21 03:03:47,604 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:03:47,605 INFO L225 Difference]: With dead ends: 41 [2022-02-21 03:03:47,605 INFO L226 Difference]: Without dead ends: 39 [2022-02-21 03:03:47,606 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:03:47,606 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:03:47,607 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:03:47,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-02-21 03:03:47,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2022-02-21 03:03:47,612 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:47,613 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:03:47,613 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:03:47,613 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:03:47,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:47,615 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2022-02-21 03:03:47,615 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2022-02-21 03:03:47,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:47,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:47,615 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:03:47,616 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:03:47,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:47,617 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2022-02-21 03:03:47,617 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2022-02-21 03:03:47,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:47,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:47,618 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:47,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:47,618 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:03:47,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2022-02-21 03:03:47,619 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 7 [2022-02-21 03:03:47,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:47,620 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2022-02-21 03:03:47,620 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:03:47,620 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2022-02-21 03:03:47,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-21 03:03:47,620 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:47,620 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:03:47,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 03:03:47,621 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:03:47,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:47,622 INFO L85 PathProgramCache]: Analyzing trace with hash 124153334, now seen corresponding path program 1 times [2022-02-21 03:03:47,622 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:47,622 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690547940] [2022-02-21 03:03:47,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:47,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:47,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:47,642 INFO L290 TraceCheckUtils]: 0: Hoare triple {324#true} assume { :begin_inline_ULTIMATE.init } true; {324#true} is VALID [2022-02-21 03:03:47,642 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_~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_~max~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {324#true} is VALID [2022-02-21 03:03:47,643 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:03:47,643 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {326#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:03:47,644 INFO L290 TraceCheckUtils]: 4: Hoare triple {326#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {326#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:03:47,644 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:03:47,645 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:03:47,645 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:03:47,645 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:03:47,645 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:47,646 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690547940] [2022-02-21 03:03:47,646 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690547940] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:03:47,646 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:03:47,646 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:03:47,646 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148346368] [2022-02-21 03:03:47,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:03:47,647 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:03:47,647 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:47,647 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:03:47,652 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:03:47,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:03:47,653 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:47,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:03:47,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:03:47,654 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:03:47,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:47,679 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2022-02-21 03:03:47,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:03:47,679 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:03:47,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:47,679 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:03:47,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-02-21 03:03:47,680 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:03:47,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2022-02-21 03:03:47,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 29 transitions. [2022-02-21 03:03:47,699 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:03:47,700 INFO L225 Difference]: With dead ends: 43 [2022-02-21 03:03:47,700 INFO L226 Difference]: Without dead ends: 42 [2022-02-21 03:03:47,701 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:03:47,701 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:03:47,702 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:03:47,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-02-21 03:03:47,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2022-02-21 03:03:47,708 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:47,708 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:03:47,709 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:03:47,709 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:03:47,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:47,710 INFO L93 Difference]: Finished difference Result 42 states and 55 transitions. [2022-02-21 03:03:47,710 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2022-02-21 03:03:47,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:47,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:47,711 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:03:47,715 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:03:47,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:47,725 INFO L93 Difference]: Finished difference Result 42 states and 55 transitions. [2022-02-21 03:03:47,725 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2022-02-21 03:03:47,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:47,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:47,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:47,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:47,726 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:03:47,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2022-02-21 03:03:47,727 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 8 [2022-02-21 03:03:47,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:47,727 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2022-02-21 03:03:47,728 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:03:47,728 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2022-02-21 03:03:47,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-21 03:03:47,728 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:47,739 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:03:47,739 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 03:03:47,740 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:03:47,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:47,750 INFO L85 PathProgramCache]: Analyzing trace with hash -446213880, now seen corresponding path program 1 times [2022-02-21 03:03:47,751 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:47,751 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163802888] [2022-02-21 03:03:47,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:47,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:47,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:47,773 INFO L290 TraceCheckUtils]: 0: Hoare triple {504#true} assume { :begin_inline_ULTIMATE.init } true; {504#true} is VALID [2022-02-21 03:03:47,774 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_~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_~max~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {504#true} is VALID [2022-02-21 03:03:47,774 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:03:47,775 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {506#(<= 1 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:03:47,775 INFO L290 TraceCheckUtils]: 4: Hoare triple {506#(<= 1 |ULTIMATE.start_main_~x~0#1|)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {506#(<= 1 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:03:47,775 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:03:47,776 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:03:47,776 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:03:47,777 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:03:47,777 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:03:47,777 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:47,777 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163802888] [2022-02-21 03:03:47,777 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163802888] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:03:47,778 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:03:47,778 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:03:47,778 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733953294] [2022-02-21 03:03:47,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:03:47,778 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:03:47,779 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:47,779 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:03:47,785 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:03:47,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:03:47,785 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:47,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:03:47,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:03:47,786 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:03:47,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:47,805 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2022-02-21 03:03:47,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:03:47,806 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:03:47,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:47,806 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:03:47,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2022-02-21 03:03:47,806 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:03:47,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2022-02-21 03:03:47,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 18 transitions. [2022-02-21 03:03:47,819 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:03:47,820 INFO L225 Difference]: With dead ends: 40 [2022-02-21 03:03:47,820 INFO L226 Difference]: Without dead ends: 39 [2022-02-21 03:03:47,820 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:03:47,821 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:03:47,822 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:03:47,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-02-21 03:03:47,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-02-21 03:03:47,829 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:47,829 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:03:47,829 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:03:47,830 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:03:47,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:47,831 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2022-02-21 03:03:47,831 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2022-02-21 03:03:47,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:47,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:47,832 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:03:47,832 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:03:47,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:47,833 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2022-02-21 03:03:47,833 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2022-02-21 03:03:47,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:47,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:47,834 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:47,834 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:47,834 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:03:47,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2022-02-21 03:03:47,835 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 9 [2022-02-21 03:03:47,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:47,836 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2022-02-21 03:03:47,836 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:03:47,836 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2022-02-21 03:03:47,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-21 03:03:47,836 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:47,836 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:03:47,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-21 03:03:47,837 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:03:47,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:47,837 INFO L85 PathProgramCache]: Analyzing trace with hash -233874170, now seen corresponding path program 1 times [2022-02-21 03:03:47,838 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:47,838 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567215939] [2022-02-21 03:03:47,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:47,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:47,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:47,866 INFO L290 TraceCheckUtils]: 0: Hoare triple {674#true} assume { :begin_inline_ULTIMATE.init } true; {674#true} is VALID [2022-02-21 03:03:47,866 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_~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_~max~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {674#true} is VALID [2022-02-21 03:03:47,867 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:03:47,867 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {676#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:03:47,867 INFO L290 TraceCheckUtils]: 4: Hoare triple {676#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {676#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:03:47,868 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:03:47,868 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:03:47,869 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:03:47,869 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:03:47,870 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {677#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-21 03:03:47,870 INFO L290 TraceCheckUtils]: 10: Hoare triple {677#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {677#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-21 03:03:47,870 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:03:47,871 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:03:47,871 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:47,871 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567215939] [2022-02-21 03:03:47,871 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567215939] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:03:47,871 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670942184] [2022-02-21 03:03:47,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:47,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:03:47,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:03:47,873 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:03:47,874 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:03:47,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:47,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:03:47,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:47,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:03:47,984 INFO L290 TraceCheckUtils]: 0: Hoare triple {674#true} assume { :begin_inline_ULTIMATE.init } true; {674#true} is VALID [2022-02-21 03:03:47,984 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_~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_~max~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {674#true} is VALID [2022-02-21 03:03:47,987 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:03:47,987 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {676#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:03:47,988 INFO L290 TraceCheckUtils]: 4: Hoare triple {676#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {676#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:03:47,988 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:03:47,989 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:03:47,990 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:03:47,994 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:03:47,995 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {677#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-21 03:03:47,995 INFO L290 TraceCheckUtils]: 10: Hoare triple {677#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {677#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-21 03:03:47,996 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:03:47,996 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:03:47,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:03:48,078 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:03:48,078 INFO L290 TraceCheckUtils]: 10: Hoare triple {714#(<= |ULTIMATE.start_main_~a~0#1| 2147483646)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {714#(<= |ULTIMATE.start_main_~a~0#1| 2147483646)} is VALID [2022-02-21 03:03:48,079 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {714#(<= |ULTIMATE.start_main_~a~0#1| 2147483646)} is VALID [2022-02-21 03:03:48,079 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:03:48,079 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:03:48,080 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:03:48,080 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:03:48,081 INFO L290 TraceCheckUtils]: 4: Hoare triple {730#(<= |ULTIMATE.start_main_~a~0#1| 2147483645)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {730#(<= |ULTIMATE.start_main_~a~0#1| 2147483645)} is VALID [2022-02-21 03:03:48,081 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {730#(<= |ULTIMATE.start_main_~a~0#1| 2147483645)} is VALID [2022-02-21 03:03:48,082 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:03:48,082 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_~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_~max~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {674#true} is VALID [2022-02-21 03:03:48,082 INFO L290 TraceCheckUtils]: 0: Hoare triple {674#true} assume { :begin_inline_ULTIMATE.init } true; {674#true} is VALID [2022-02-21 03:03:48,082 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:03:48,083 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670942184] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:03:48,083 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:03:48,083 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-02-21 03:03:48,083 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726520195] [2022-02-21 03:03:48,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:03:48,084 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:03:48,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:48,084 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:03:48,097 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:03:48,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 03:03:48,098 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:48,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:03:48,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:03:48,098 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:03:48,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:48,220 INFO L93 Difference]: Finished difference Result 98 states and 135 transitions. [2022-02-21 03:03:48,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:03:48,220 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:03:48,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:48,221 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:03:48,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-02-21 03:03:48,222 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:03:48,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-02-21 03:03:48,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 71 transitions. [2022-02-21 03:03:48,277 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:03:48,280 INFO L225 Difference]: With dead ends: 98 [2022-02-21 03:03:48,280 INFO L226 Difference]: Without dead ends: 96 [2022-02-21 03:03:48,285 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:03:48,289 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:03:48,289 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:03:48,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-02-21 03:03:48,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 79. [2022-02-21 03:03:48,315 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:48,315 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:03:48,316 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:03:48,316 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:03:48,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:48,319 INFO L93 Difference]: Finished difference Result 96 states and 121 transitions. [2022-02-21 03:03:48,319 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 121 transitions. [2022-02-21 03:03:48,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:48,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:48,320 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:03:48,320 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:03:48,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:48,322 INFO L93 Difference]: Finished difference Result 96 states and 121 transitions. [2022-02-21 03:03:48,322 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 121 transitions. [2022-02-21 03:03:48,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:48,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:48,323 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:48,323 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:48,324 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:03:48,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 103 transitions. [2022-02-21 03:03:48,325 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 103 transitions. Word has length 12 [2022-02-21 03:03:48,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:48,325 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 103 transitions. [2022-02-21 03:03:48,326 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:03:48,326 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 103 transitions. [2022-02-21 03:03:48,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-21 03:03:48,326 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:48,326 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:03:48,343 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:03:48,543 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:03:48,543 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:03:48,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:48,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1982025395, now seen corresponding path program 1 times [2022-02-21 03:03:48,544 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:48,544 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659970307] [2022-02-21 03:03:48,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:48,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:48,576 INFO L290 TraceCheckUtils]: 0: Hoare triple {1138#true} assume { :begin_inline_ULTIMATE.init } true; {1138#true} is VALID [2022-02-21 03:03:48,576 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_~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_~max~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {1138#true} is VALID [2022-02-21 03:03:48,577 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:03:48,577 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1140#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:03:48,578 INFO L290 TraceCheckUtils]: 4: Hoare triple {1140#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {1140#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:03:48,578 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:03:48,578 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:03:48,579 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:03:48,579 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:03:48,579 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1141#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:03:48,580 INFO L290 TraceCheckUtils]: 10: Hoare triple {1141#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {1141#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:03:48,580 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:03:48,580 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:03:48,581 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:03:48,583 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:48,583 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659970307] [2022-02-21 03:03:48,583 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659970307] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:03:48,583 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189520902] [2022-02-21 03:03:48,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:48,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:03:48,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:03:48,596 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:03:48,597 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:03:48,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:48,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:03:48,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:48,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:03:48,677 INFO L290 TraceCheckUtils]: 0: Hoare triple {1138#true} assume { :begin_inline_ULTIMATE.init } true; {1138#true} is VALID [2022-02-21 03:03:48,677 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_~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_~max~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {1138#true} is VALID [2022-02-21 03:03:48,678 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:03:48,678 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1140#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:03:48,678 INFO L290 TraceCheckUtils]: 4: Hoare triple {1140#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {1140#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:03:48,679 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:03:48,679 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:03:48,680 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:03:48,680 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:03:48,680 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1141#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:03:48,681 INFO L290 TraceCheckUtils]: 10: Hoare triple {1141#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {1141#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:03:48,681 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:03:48,682 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:03:48,682 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:03:48,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:03:48,739 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:03:48,739 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:03:48,740 INFO L290 TraceCheckUtils]: 10: Hoare triple {1181#(<= 0 (+ 2147483649 |ULTIMATE.start_main_~a~0#1|))} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {1181#(<= 0 (+ 2147483649 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:03:48,740 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1181#(<= 0 (+ 2147483649 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:03:48,740 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:03:48,741 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:03:48,741 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:03:48,742 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:03:48,742 INFO L290 TraceCheckUtils]: 4: Hoare triple {1200#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483648))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {1200#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483648))} is VALID [2022-02-21 03:03:48,742 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1200#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483648))} is VALID [2022-02-21 03:03:48,743 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:03:48,743 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_~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_~max~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {1138#true} is VALID [2022-02-21 03:03:48,743 INFO L290 TraceCheckUtils]: 0: Hoare triple {1138#true} assume { :begin_inline_ULTIMATE.init } true; {1138#true} is VALID [2022-02-21 03:03:48,743 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:03:48,743 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189520902] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:03:48,744 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:03:48,744 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-02-21 03:03:48,744 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763168228] [2022-02-21 03:03:48,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:03:48,744 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:03:48,745 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:48,745 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:03:48,759 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:03:48,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 03:03:48,760 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:48,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:03:48,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:03:48,760 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:03:48,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:48,835 INFO L93 Difference]: Finished difference Result 135 states and 186 transitions. [2022-02-21 03:03:48,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:03:48,836 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:03:48,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:48,836 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:03:48,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-02-21 03:03:48,837 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:03:48,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-02-21 03:03:48,837 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 45 transitions. [2022-02-21 03:03:48,865 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:03:48,867 INFO L225 Difference]: With dead ends: 135 [2022-02-21 03:03:48,868 INFO L226 Difference]: Without dead ends: 133 [2022-02-21 03:03:48,868 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:03:48,868 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 29 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 13 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, 13 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:48,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 24 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:03:48,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-02-21 03:03:48,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 99. [2022-02-21 03:03:48,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:48,890 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:03:48,891 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:03:48,891 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:03:48,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:48,894 INFO L93 Difference]: Finished difference Result 133 states and 170 transitions. [2022-02-21 03:03:48,894 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 170 transitions. [2022-02-21 03:03:48,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:48,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:48,895 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:03:48,895 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:03:48,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:48,902 INFO L93 Difference]: Finished difference Result 133 states and 170 transitions. [2022-02-21 03:03:48,902 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 170 transitions. [2022-02-21 03:03:48,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:48,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:48,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:48,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:48,904 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:03:48,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 128 transitions. [2022-02-21 03:03:48,906 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 128 transitions. Word has length 13 [2022-02-21 03:03:48,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:48,907 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 128 transitions. [2022-02-21 03:03:48,907 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:03:48,907 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 128 transitions. [2022-02-21 03:03:48,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-21 03:03:48,908 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:48,908 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-02-21 03:03:48,927 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:03:49,127 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:03:49,127 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:03:49,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:49,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1414776337, now seen corresponding path program 1 times [2022-02-21 03:03:49,127 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:49,128 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505863263] [2022-02-21 03:03:49,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:49,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:49,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:49,158 INFO L290 TraceCheckUtils]: 0: Hoare triple {1748#true} assume { :begin_inline_ULTIMATE.init } true; {1748#true} is VALID [2022-02-21 03:03:49,158 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_~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_~max~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {1748#true} is VALID [2022-02-21 03:03:49,158 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:03:49,159 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1750#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:03:49,159 INFO L290 TraceCheckUtils]: 4: Hoare triple {1750#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {1750#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:03:49,159 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:03:49,160 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:03:49,160 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:03:49,160 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:03:49,161 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1751#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:03:49,161 INFO L290 TraceCheckUtils]: 10: Hoare triple {1751#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {1751#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:03:49,161 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:03:49,162 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:03:49,162 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:03:49,162 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:03:49,162 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:49,162 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505863263] [2022-02-21 03:03:49,162 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505863263] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:03:49,162 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927422995] [2022-02-21 03:03:49,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:49,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:03:49,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:03:49,164 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:03:49,165 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:03:49,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:49,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:03:49,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:49,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:03:49,276 INFO L290 TraceCheckUtils]: 0: Hoare triple {1748#true} assume { :begin_inline_ULTIMATE.init } true; {1748#true} is VALID [2022-02-21 03:03:49,276 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_~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_~max~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {1748#true} is VALID [2022-02-21 03:03:49,283 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:03:49,284 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1750#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:03:49,284 INFO L290 TraceCheckUtils]: 4: Hoare triple {1750#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {1750#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:03:49,285 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:03:49,285 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:03:49,285 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:03:49,286 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:03:49,286 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1751#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:03:49,287 INFO L290 TraceCheckUtils]: 10: Hoare triple {1751#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {1751#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:03:49,287 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:03:49,287 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:03:49,288 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:03:49,288 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:03:49,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:03:49,346 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:03:49,347 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:03:49,347 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:03:49,347 INFO L290 TraceCheckUtils]: 10: Hoare triple {1794#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {1794#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:03:49,348 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1794#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:03:49,348 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:03:49,349 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:03:49,349 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:03:49,349 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:03:49,351 INFO L290 TraceCheckUtils]: 4: Hoare triple {1810#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {1810#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:03:49,351 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {1810#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:03:49,352 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:03:49,352 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_~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_~max~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {1748#true} is VALID [2022-02-21 03:03:49,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {1748#true} assume { :begin_inline_ULTIMATE.init } true; {1748#true} is VALID [2022-02-21 03:03:49,352 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:03:49,352 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927422995] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:03:49,352 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:03:49,353 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-02-21 03:03:49,353 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121568750] [2022-02-21 03:03:49,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:03:49,353 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:03:49,354 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:49,354 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:03:49,371 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:03:49,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 03:03:49,371 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:49,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:03:49,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:03:49,372 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:03:49,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:49,479 INFO L93 Difference]: Finished difference Result 207 states and 268 transitions. [2022-02-21 03:03:49,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:03:49,479 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:03:49,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:49,480 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:03:49,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-02-21 03:03:49,481 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:03:49,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-02-21 03:03:49,481 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 56 transitions. [2022-02-21 03:03:49,530 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:03:49,533 INFO L225 Difference]: With dead ends: 207 [2022-02-21 03:03:49,533 INFO L226 Difference]: Without dead ends: 206 [2022-02-21 03:03:49,534 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:03:49,534 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:03:49,534 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:03:49,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-02-21 03:03:49,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2022-02-21 03:03:49,590 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:49,591 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:03:49,591 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:03:49,592 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:03:49,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:49,595 INFO L93 Difference]: Finished difference Result 206 states and 248 transitions. [2022-02-21 03:03:49,595 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 248 transitions. [2022-02-21 03:03:49,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:49,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:49,596 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:03:49,597 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:03:49,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:49,600 INFO L93 Difference]: Finished difference Result 206 states and 248 transitions. [2022-02-21 03:03:49,601 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 248 transitions. [2022-02-21 03:03:49,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:49,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:49,601 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:49,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:49,602 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:03:49,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 248 transitions. [2022-02-21 03:03:49,605 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 248 transitions. Word has length 14 [2022-02-21 03:03:49,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:49,605 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 248 transitions. [2022-02-21 03:03:49,606 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:03:49,606 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 248 transitions. [2022-02-21 03:03:49,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-21 03:03:49,606 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:49,606 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1] [2022-02-21 03:03:49,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-02-21 03:03:49,822 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:03:49,822 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:03:49,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:49,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1022063642, now seen corresponding path program 1 times [2022-02-21 03:03:49,823 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:49,823 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799640366] [2022-02-21 03:03:49,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:49,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:49,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:49,862 INFO L290 TraceCheckUtils]: 0: Hoare triple {2709#true} assume { :begin_inline_ULTIMATE.init } true; {2709#true} is VALID [2022-02-21 03:03:49,862 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_~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_~max~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {2709#true} is VALID [2022-02-21 03:03:49,863 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:03:49,863 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2711#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:03:49,863 INFO L290 TraceCheckUtils]: 4: Hoare triple {2711#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {2711#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:03:49,864 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:03:49,864 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:03:49,864 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:03:49,865 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:03:49,865 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2712#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:03:49,865 INFO L290 TraceCheckUtils]: 10: Hoare triple {2712#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {2712#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:03:49,866 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:03:49,866 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:03:49,866 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:03:49,867 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:03:49,867 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2713#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:03:49,867 INFO L290 TraceCheckUtils]: 16: Hoare triple {2713#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {2713#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:03:49,868 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:03:49,868 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:03:49,868 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:03:49,869 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:49,869 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799640366] [2022-02-21 03:03:49,869 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799640366] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:03:49,869 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180605765] [2022-02-21 03:03:49,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:49,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:03:49,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:03:49,870 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:03:49,871 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:03:49,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:49,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:03:49,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:49,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:03:49,979 INFO L290 TraceCheckUtils]: 0: Hoare triple {2709#true} assume { :begin_inline_ULTIMATE.init } true; {2709#true} is VALID [2022-02-21 03:03:49,979 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_~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_~max~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {2709#true} is VALID [2022-02-21 03:03:49,980 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:03:49,980 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2711#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:03:49,981 INFO L290 TraceCheckUtils]: 4: Hoare triple {2711#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {2711#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:03:49,981 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:03:49,981 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:03:49,982 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:03:49,982 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:03:49,982 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2712#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:03:49,983 INFO L290 TraceCheckUtils]: 10: Hoare triple {2712#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {2712#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:03:49,983 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:03:49,984 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:03:49,985 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:03:49,985 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:03:49,986 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2713#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:03:49,987 INFO L290 TraceCheckUtils]: 16: Hoare triple {2713#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {2713#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:03:49,987 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:03:49,988 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:03:49,988 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:03:49,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:03:50,080 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:03:50,080 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:03:50,080 INFO L290 TraceCheckUtils]: 16: Hoare triple {2771#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {2771#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:03:50,081 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2771#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:03:50,081 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:03:50,082 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:03:50,082 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:03:50,083 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:03:50,083 INFO L290 TraceCheckUtils]: 10: Hoare triple {2790#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483646))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {2790#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483646))} is VALID [2022-02-21 03:03:50,084 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2790#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483646))} is VALID [2022-02-21 03:03:50,084 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:03:50,084 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:03:50,084 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:03:50,085 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:03:50,085 INFO L290 TraceCheckUtils]: 4: Hoare triple {2809#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {2809#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:03:50,085 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {2809#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:03:50,086 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:03:50,086 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_~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_~max~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {2709#true} is VALID [2022-02-21 03:03:50,086 INFO L290 TraceCheckUtils]: 0: Hoare triple {2709#true} assume { :begin_inline_ULTIMATE.init } true; {2709#true} is VALID [2022-02-21 03:03:50,086 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:03:50,086 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180605765] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:03:50,086 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:03:50,086 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-21 03:03:50,086 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54296507] [2022-02-21 03:03:50,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:03:50,087 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:03:50,087 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:50,087 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:03:50,109 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:03:50,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-21 03:03:50,109 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:50,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-21 03:03:50,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:03:50,110 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:03:50,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:50,361 INFO L93 Difference]: Finished difference Result 399 states and 515 transitions. [2022-02-21 03:03:50,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 03:03:50,362 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:03:50,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:50,362 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:03:50,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2022-02-21 03:03:50,363 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:03:50,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2022-02-21 03:03:50,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 94 transitions. [2022-02-21 03:03:50,428 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:03:50,434 INFO L225 Difference]: With dead ends: 399 [2022-02-21 03:03:50,435 INFO L226 Difference]: Without dead ends: 398 [2022-02-21 03:03:50,435 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:03:50,436 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 71 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:50,436 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.1s Time] [2022-02-21 03:03:50,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2022-02-21 03:03:50,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 330. [2022-02-21 03:03:50,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:50,514 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:03:50,515 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:03:50,515 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:03:50,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:50,524 INFO L93 Difference]: Finished difference Result 398 states and 494 transitions. [2022-02-21 03:03:50,524 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 494 transitions. [2022-02-21 03:03:50,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:50,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:50,526 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:03:50,526 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:03:50,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:50,535 INFO L93 Difference]: Finished difference Result 398 states and 494 transitions. [2022-02-21 03:03:50,535 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 494 transitions. [2022-02-21 03:03:50,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:50,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:50,536 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:50,536 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:50,536 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:03:50,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 416 transitions. [2022-02-21 03:03:50,543 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 416 transitions. Word has length 19 [2022-02-21 03:03:50,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:50,543 INFO L470 AbstractCegarLoop]: Abstraction has 330 states and 416 transitions. [2022-02-21 03:03:50,543 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:03:50,543 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 416 transitions. [2022-02-21 03:03:50,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-21 03:03:50,543 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:50,544 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1] [2022-02-21 03:03:50,563 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:03:50,760 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:03:50,760 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:03:50,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:50,760 INFO L85 PathProgramCache]: Analyzing trace with hash -957667535, now seen corresponding path program 2 times [2022-02-21 03:03:50,761 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:50,761 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036646235] [2022-02-21 03:03:50,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:50,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:50,815 INFO L290 TraceCheckUtils]: 0: Hoare triple {4447#true} assume { :begin_inline_ULTIMATE.init } true; {4447#true} is VALID [2022-02-21 03:03:50,815 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_~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_~max~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {4447#true} is VALID [2022-02-21 03:03:50,815 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:03:50,816 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {4449#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:03:50,816 INFO L290 TraceCheckUtils]: 4: Hoare triple {4449#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {4449#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:03:50,816 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:03:50,817 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:03:50,817 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:03:50,817 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:03:50,817 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {4450#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-21 03:03:50,818 INFO L290 TraceCheckUtils]: 10: Hoare triple {4450#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {4450#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-21 03:03:50,818 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:03:50,818 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:03:50,819 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:03:50,819 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:03:50,819 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {4451#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-21 03:03:50,820 INFO L290 TraceCheckUtils]: 16: Hoare triple {4451#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {4451#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-21 03:03:50,820 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:03:50,820 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:03:50,821 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:03:50,821 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:03:50,821 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {4452#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-21 03:03:50,822 INFO L290 TraceCheckUtils]: 22: Hoare triple {4452#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {4452#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-21 03:03:50,822 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:03:50,822 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:03:50,823 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:03:50,823 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:03:50,823 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {4453#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-21 03:03:50,823 INFO L290 TraceCheckUtils]: 28: Hoare triple {4453#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {4453#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-21 03:03:50,824 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:03:50,824 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:03:50,824 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:50,824 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036646235] [2022-02-21 03:03:50,824 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036646235] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:03:50,825 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439463488] [2022-02-21 03:03:50,825 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:03:50,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:03:50,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:03:50,826 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:03:50,827 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:03:50,856 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:03:50,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:03:50,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:03:50,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:50,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:03:50,982 INFO L290 TraceCheckUtils]: 0: Hoare triple {4447#true} assume { :begin_inline_ULTIMATE.init } true; {4447#true} is VALID [2022-02-21 03:03:50,982 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_~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_~max~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {4447#true} is VALID [2022-02-21 03:03:50,983 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:03:50,983 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {4449#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:03:50,983 INFO L290 TraceCheckUtils]: 4: Hoare triple {4449#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {4449#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:03:50,984 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:03:50,984 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:03:50,984 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:03:50,985 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:03:50,990 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {4450#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-21 03:03:50,990 INFO L290 TraceCheckUtils]: 10: Hoare triple {4450#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {4450#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-21 03:03:50,990 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:03:50,991 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:03:50,991 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:03:50,992 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:03:50,992 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {4451#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-21 03:03:50,992 INFO L290 TraceCheckUtils]: 16: Hoare triple {4451#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {4451#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-21 03:03:50,993 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:03:50,993 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:03:50,993 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:03:50,994 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:03:50,994 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {4452#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-21 03:03:50,994 INFO L290 TraceCheckUtils]: 22: Hoare triple {4452#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {4452#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-21 03:03:50,995 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:03:50,995 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:03:50,996 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:03:50,996 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:03:50,996 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {4453#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-21 03:03:50,996 INFO L290 TraceCheckUtils]: 28: Hoare triple {4453#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {4453#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-21 03:03:50,997 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:03:50,997 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:03:50,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:03:51,153 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:03:51,154 INFO L290 TraceCheckUtils]: 28: Hoare triple {4544#(<= |ULTIMATE.start_main_~a~0#1| 2147483646)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {4544#(<= |ULTIMATE.start_main_~a~0#1| 2147483646)} is VALID [2022-02-21 03:03:51,154 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {4544#(<= |ULTIMATE.start_main_~a~0#1| 2147483646)} is VALID [2022-02-21 03:03:51,155 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:03:51,155 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:03:51,155 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:03:51,156 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:03:51,156 INFO L290 TraceCheckUtils]: 22: Hoare triple {4560#(<= |ULTIMATE.start_main_~a~0#1| 2147483645)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {4560#(<= |ULTIMATE.start_main_~a~0#1| 2147483645)} is VALID [2022-02-21 03:03:51,156 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {4560#(<= |ULTIMATE.start_main_~a~0#1| 2147483645)} is VALID [2022-02-21 03:03:51,157 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:03:51,157 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:03:51,159 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:03:51,160 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:03:51,160 INFO L290 TraceCheckUtils]: 16: Hoare triple {4579#(<= |ULTIMATE.start_main_~a~0#1| 2147483644)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {4579#(<= |ULTIMATE.start_main_~a~0#1| 2147483644)} is VALID [2022-02-21 03:03:51,160 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {4579#(<= |ULTIMATE.start_main_~a~0#1| 2147483644)} is VALID [2022-02-21 03:03:51,161 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:03:51,161 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:03:51,161 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:03:51,162 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:03:51,162 INFO L290 TraceCheckUtils]: 10: Hoare triple {4598#(<= |ULTIMATE.start_main_~a~0#1| 2147483643)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {4598#(<= |ULTIMATE.start_main_~a~0#1| 2147483643)} is VALID [2022-02-21 03:03:51,162 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {4598#(<= |ULTIMATE.start_main_~a~0#1| 2147483643)} is VALID [2022-02-21 03:03:51,163 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:03:51,164 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:03:51,164 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:03:51,165 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:03:51,165 INFO L290 TraceCheckUtils]: 4: Hoare triple {4617#(<= |ULTIMATE.start_main_~a~0#1| 2147483642)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {4617#(<= |ULTIMATE.start_main_~a~0#1| 2147483642)} is VALID [2022-02-21 03:03:51,165 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {4617#(<= |ULTIMATE.start_main_~a~0#1| 2147483642)} is VALID [2022-02-21 03:03:51,166 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:03:51,166 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_~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_~max~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {4447#true} is VALID [2022-02-21 03:03:51,166 INFO L290 TraceCheckUtils]: 0: Hoare triple {4447#true} assume { :begin_inline_ULTIMATE.init } true; {4447#true} is VALID [2022-02-21 03:03:51,166 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:03:51,166 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439463488] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:03:51,166 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:03:51,166 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-02-21 03:03:51,166 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356834329] [2022-02-21 03:03:51,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:03:51,167 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:03:51,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:51,167 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:03:51,202 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:03:51,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-21 03:03:51,203 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:51,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-21 03:03:51,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-02-21 03:03:51,203 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:03:51,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:51,622 INFO L93 Difference]: Finished difference Result 871 states and 1195 transitions. [2022-02-21 03:03:51,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 03:03:51,623 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:03:51,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:51,624 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:03:51,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 145 transitions. [2022-02-21 03:03:51,625 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:03:51,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 145 transitions. [2022-02-21 03:03:51,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 145 transitions. [2022-02-21 03:03:51,705 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:03:51,730 INFO L225 Difference]: With dead ends: 871 [2022-02-21 03:03:51,730 INFO L226 Difference]: Without dead ends: 869 [2022-02-21 03:03:51,731 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 54 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:03:51,732 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 87 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:03:51,732 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.1s Time] [2022-02-21 03:03:51,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2022-02-21 03:03:51,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 573. [2022-02-21 03:03:51,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:51,882 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:03:51,883 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:03:51,884 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:03:51,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:51,909 INFO L93 Difference]: Finished difference Result 869 states and 1099 transitions. [2022-02-21 03:03:51,909 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1099 transitions. [2022-02-21 03:03:51,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:51,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:51,911 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:03:51,912 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:03:51,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:51,943 INFO L93 Difference]: Finished difference Result 869 states and 1099 transitions. [2022-02-21 03:03:51,943 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1099 transitions. [2022-02-21 03:03:51,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:51,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:51,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:51,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:51,945 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:03:51,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 732 transitions. [2022-02-21 03:03:51,957 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 732 transitions. Word has length 30 [2022-02-21 03:03:51,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:51,958 INFO L470 AbstractCegarLoop]: Abstraction has 573 states and 732 transitions. [2022-02-21 03:03:51,958 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:03:51,958 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 732 transitions. [2022-02-21 03:03:51,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-21 03:03:51,958 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:51,959 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1] [2022-02-21 03:03:51,975 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:03:52,175 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:03:52,176 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:03:52,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:52,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1195498150, now seen corresponding path program 2 times [2022-02-21 03:03:52,176 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:52,176 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346456232] [2022-02-21 03:03:52,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:52,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:52,227 INFO L290 TraceCheckUtils]: 0: Hoare triple {8010#true} assume { :begin_inline_ULTIMATE.init } true; {8010#true} is VALID [2022-02-21 03:03:52,227 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_~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_~max~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {8010#true} is VALID [2022-02-21 03:03:52,227 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:03:52,228 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {8012#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:03:52,228 INFO L290 TraceCheckUtils]: 4: Hoare triple {8012#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {8012#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:03:52,228 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:03:52,229 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:03:52,229 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:03:52,229 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:03:52,230 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {8013#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:03:52,230 INFO L290 TraceCheckUtils]: 10: Hoare triple {8013#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {8013#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:03:52,230 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:03:52,230 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:03:52,231 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:03:52,232 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:03:52,233 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {8014#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:03:52,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {8014#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {8014#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:03:52,234 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:03:52,234 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:03:52,234 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:03:52,234 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:03:52,235 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {8015#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:03:52,235 INFO L290 TraceCheckUtils]: 22: Hoare triple {8015#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {8015#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:03:52,235 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:03:52,236 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:03:52,236 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:03:52,236 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:03:52,237 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {8016#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-21 03:03:52,237 INFO L290 TraceCheckUtils]: 28: Hoare triple {8016#(<= |ULTIMATE.start_main_~x~0#1| 5)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {8016#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-21 03:03:52,237 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:03:52,237 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:03:52,238 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:03:52,238 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:03:52,239 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:52,239 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346456232] [2022-02-21 03:03:52,239 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346456232] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:03:52,239 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64236864] [2022-02-21 03:03:52,239 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:03:52,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:03:52,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:03:52,240 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:03:52,241 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:03:52,272 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:03:52,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:03:52,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:03:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:52,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:03:52,400 INFO L290 TraceCheckUtils]: 0: Hoare triple {8010#true} assume { :begin_inline_ULTIMATE.init } true; {8010#true} is VALID [2022-02-21 03:03:52,401 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_~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_~max~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {8010#true} is VALID [2022-02-21 03:03:52,401 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:03:52,401 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {8012#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:03:52,402 INFO L290 TraceCheckUtils]: 4: Hoare triple {8012#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {8012#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:03:52,402 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:03:52,403 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:03:52,403 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:03:52,404 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:03:52,404 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {8013#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:03:52,404 INFO L290 TraceCheckUtils]: 10: Hoare triple {8013#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {8013#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:03:52,405 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:03:52,405 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:03:52,405 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:03:52,406 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:03:52,406 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {8014#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:03:52,406 INFO L290 TraceCheckUtils]: 16: Hoare triple {8014#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {8014#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:03:52,407 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:03:52,407 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:03:52,407 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:03:52,408 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:03:52,408 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {8015#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:03:52,408 INFO L290 TraceCheckUtils]: 22: Hoare triple {8015#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {8015#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:03:52,409 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:03:52,409 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:03:52,409 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:03:52,410 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:03:52,410 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {8016#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-21 03:03:52,410 INFO L290 TraceCheckUtils]: 28: Hoare triple {8016#(<= |ULTIMATE.start_main_~x~0#1| 5)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {8016#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-21 03:03:52,411 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:03:52,411 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:03:52,412 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:03:52,412 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:03:52,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:03:52,578 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:03:52,579 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:03:52,579 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:03:52,580 INFO L290 TraceCheckUtils]: 28: Hoare triple {8113#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {8113#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:03:52,580 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {8113#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:03:52,580 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:03:52,581 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:03:52,581 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:03:52,581 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:03:52,582 INFO L290 TraceCheckUtils]: 22: Hoare triple {8129#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {8129#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:03:52,582 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {8129#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:03:52,582 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:03:52,583 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:03:52,584 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:03:52,584 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:03:52,584 INFO L290 TraceCheckUtils]: 16: Hoare triple {8148#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {8148#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} is VALID [2022-02-21 03:03:52,585 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {8148#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} is VALID [2022-02-21 03:03:52,589 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:03:52,590 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:03:52,590 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:03:52,591 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:03:52,591 INFO L290 TraceCheckUtils]: 10: Hoare triple {8167#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {8167#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} is VALID [2022-02-21 03:03:52,591 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {8167#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} is VALID [2022-02-21 03:03:52,592 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:03:52,592 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:03:52,592 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:03:52,593 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:03:52,593 INFO L290 TraceCheckUtils]: 4: Hoare triple {8186#(<= |ULTIMATE.start_main_~x~0#1| 2147483642)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {8186#(<= |ULTIMATE.start_main_~x~0#1| 2147483642)} is VALID [2022-02-21 03:03:52,593 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {8186#(<= |ULTIMATE.start_main_~x~0#1| 2147483642)} is VALID [2022-02-21 03:03:52,594 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:03:52,594 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_~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_~max~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {8010#true} is VALID [2022-02-21 03:03:52,594 INFO L290 TraceCheckUtils]: 0: Hoare triple {8010#true} assume { :begin_inline_ULTIMATE.init } true; {8010#true} is VALID [2022-02-21 03:03:52,594 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:03:52,594 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64236864] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:03:52,594 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:03:52,594 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-02-21 03:03:52,595 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128510542] [2022-02-21 03:03:52,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:03:52,595 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:03:52,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:52,596 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:03:52,631 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:03:52,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-21 03:03:52,632 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:52,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-21 03:03:52,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-02-21 03:03:52,632 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:03:53,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:53,339 INFO L93 Difference]: Finished difference Result 1650 states and 2141 transitions. [2022-02-21 03:03:53,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 03:03:53,339 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:03:53,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:53,339 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:03:53,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 115 transitions. [2022-02-21 03:03:53,340 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:03:53,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 115 transitions. [2022-02-21 03:03:53,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 115 transitions. [2022-02-21 03:03:53,405 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:03:53,495 INFO L225 Difference]: With dead ends: 1650 [2022-02-21 03:03:53,495 INFO L226 Difference]: Without dead ends: 1649 [2022-02-21 03:03:53,496 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:03:53,496 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:03:53,496 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:03:53,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2022-02-21 03:03:53,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1645. [2022-02-21 03:03:53,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:53,971 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:03:53,972 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:03:53,974 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:03:54,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:54,056 INFO L93 Difference]: Finished difference Result 1649 states and 1959 transitions. [2022-02-21 03:03:54,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 1959 transitions. [2022-02-21 03:03:54,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:54,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:54,060 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:03:54,062 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:03:54,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:54,145 INFO L93 Difference]: Finished difference Result 1649 states and 1959 transitions. [2022-02-21 03:03:54,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 1959 transitions. [2022-02-21 03:03:54,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:54,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:54,147 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:54,147 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:54,149 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:03:54,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 1959 transitions. [2022-02-21 03:03:54,237 INFO L78 Accepts]: Start accepts. Automaton has 1645 states and 1959 transitions. Word has length 32 [2022-02-21 03:03:54,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:54,238 INFO L470 AbstractCegarLoop]: Abstraction has 1645 states and 1959 transitions. [2022-02-21 03:03:54,238 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:03:54,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 1959 transitions. [2022-02-21 03:03:54,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-21 03:03:54,239 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:54,239 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 1, 1, 1, 1] [2022-02-21 03:03:54,256 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:03:54,456 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:03:54,456 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:03:54,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:54,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1056880102, now seen corresponding path program 2 times [2022-02-21 03:03:54,457 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:54,457 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168785144] [2022-02-21 03:03:54,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:54,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:54,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:54,557 INFO L290 TraceCheckUtils]: 0: Hoare triple {15255#true} assume { :begin_inline_ULTIMATE.init } true; {15255#true} is VALID [2022-02-21 03:03:54,559 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_~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_~max~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {15255#true} is VALID [2022-02-21 03:03:54,560 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:03:54,560 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {15257#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:03:54,560 INFO L290 TraceCheckUtils]: 4: Hoare triple {15257#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {15257#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:03:54,561 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:03:54,561 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:03:54,561 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:03:54,562 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:03:54,562 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {15258#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:03:54,562 INFO L290 TraceCheckUtils]: 10: Hoare triple {15258#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {15258#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:03:54,562 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:03:54,563 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:03:54,563 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:03:54,563 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:03:54,564 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {15259#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:03:54,564 INFO L290 TraceCheckUtils]: 16: Hoare triple {15259#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {15259#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:03:54,564 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:03:54,565 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:03:54,565 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:03:54,565 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:03:54,566 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {15260#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:03:54,566 INFO L290 TraceCheckUtils]: 22: Hoare triple {15260#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {15260#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:03:54,566 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:03:54,567 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:03:54,567 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:03:54,567 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:03:54,567 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {15261#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} is VALID [2022-02-21 03:03:54,568 INFO L290 TraceCheckUtils]: 28: Hoare triple {15261#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {15261#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} is VALID [2022-02-21 03:03:54,568 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:03:54,568 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:03:54,568 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:03:54,569 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:03:54,569 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {15262#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:03:54,569 INFO L290 TraceCheckUtils]: 34: Hoare triple {15262#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {15262#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:03:54,570 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:03:54,570 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:03:54,570 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:03:54,571 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:03:54,571 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {15263#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:03:54,571 INFO L290 TraceCheckUtils]: 40: Hoare triple {15263#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {15263#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:03:54,572 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:03:54,572 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:03:54,572 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:03:54,572 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:54,572 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168785144] [2022-02-21 03:03:54,572 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168785144] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:03:54,572 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517091437] [2022-02-21 03:03:54,573 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:03:54,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:03:54,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:03:54,574 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:03:54,575 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:03:54,611 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:03:54,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:03:54,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:03:54,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:54,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:03:54,808 INFO L290 TraceCheckUtils]: 0: Hoare triple {15255#true} assume { :begin_inline_ULTIMATE.init } true; {15255#true} is VALID [2022-02-21 03:03:54,809 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_~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_~max~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {15255#true} is VALID [2022-02-21 03:03:54,809 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:03:54,810 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {15257#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:03:54,810 INFO L290 TraceCheckUtils]: 4: Hoare triple {15257#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {15257#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:03:54,811 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:03:54,811 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:03:54,811 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:03:54,812 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:03:54,812 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {15258#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:03:54,812 INFO L290 TraceCheckUtils]: 10: Hoare triple {15258#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {15258#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:03:54,813 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:03:54,813 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:03:54,813 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:03:54,814 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:03:54,814 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {15259#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:03:54,814 INFO L290 TraceCheckUtils]: 16: Hoare triple {15259#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {15259#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:03:54,815 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:03:54,815 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:03:54,816 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:03:54,816 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:03:54,816 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {15260#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:03:54,817 INFO L290 TraceCheckUtils]: 22: Hoare triple {15260#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {15260#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:03:54,817 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:03:54,817 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:03:54,818 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:03:54,818 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:03:54,818 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {15261#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} is VALID [2022-02-21 03:03:54,819 INFO L290 TraceCheckUtils]: 28: Hoare triple {15261#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {15261#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} is VALID [2022-02-21 03:03:54,819 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:03:54,819 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:03:54,820 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:03:54,820 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:03:54,820 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {15262#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:03:54,821 INFO L290 TraceCheckUtils]: 34: Hoare triple {15262#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {15262#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:03:54,821 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:03:54,821 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:03:54,822 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:03:54,822 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:03:54,823 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {15263#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:03:54,823 INFO L290 TraceCheckUtils]: 40: Hoare triple {15263#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {15263#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:03:54,823 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:03:54,824 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:03:54,824 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:03:54,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:03:55,079 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:03:55,079 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:03:55,080 INFO L290 TraceCheckUtils]: 40: Hoare triple {15393#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {15393#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:03:55,080 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {15393#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:03:55,080 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:03:55,080 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:03:55,081 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:03:55,081 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:03:55,082 INFO L290 TraceCheckUtils]: 34: Hoare triple {15412#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483646))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {15412#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483646))} is VALID [2022-02-21 03:03:55,082 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {15412#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483646))} is VALID [2022-02-21 03:03:55,082 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:03:55,082 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:03:55,083 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:03:55,083 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:03:55,084 INFO L290 TraceCheckUtils]: 28: Hoare triple {15431#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {15431#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:03:55,084 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {15431#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:03:55,084 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:03:55,084 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:03:55,085 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:03:55,085 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:03:55,085 INFO L290 TraceCheckUtils]: 22: Hoare triple {15450#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483644))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {15450#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483644))} is VALID [2022-02-21 03:03:55,086 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {15450#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483644))} is VALID [2022-02-21 03:03:55,086 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:03:55,086 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:03:55,087 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:03:55,088 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:03:55,088 INFO L290 TraceCheckUtils]: 16: Hoare triple {15469#(<= 0 (+ 2147483643 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {15469#(<= 0 (+ 2147483643 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:03:55,088 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {15469#(<= 0 (+ 2147483643 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:03:55,089 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:03:55,089 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:03:55,089 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:03:55,090 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:03:55,090 INFO L290 TraceCheckUtils]: 10: Hoare triple {15488#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483642))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {15488#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483642))} is VALID [2022-02-21 03:03:55,090 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {15488#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483642))} is VALID [2022-02-21 03:03:55,091 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:03:55,091 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:03:55,091 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:03:55,092 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:03:55,092 INFO L290 TraceCheckUtils]: 4: Hoare triple {15507#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483641))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {15507#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483641))} is VALID [2022-02-21 03:03:55,092 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {15507#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483641))} is VALID [2022-02-21 03:03:55,093 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:03:55,093 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_~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_~max~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {15255#true} is VALID [2022-02-21 03:03:55,093 INFO L290 TraceCheckUtils]: 0: Hoare triple {15255#true} assume { :begin_inline_ULTIMATE.init } true; {15255#true} is VALID [2022-02-21 03:03:55,093 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:03:55,093 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517091437] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:03:55,093 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:03:55,093 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2022-02-21 03:03:55,094 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006301843] [2022-02-21 03:03:55,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:03:55,094 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:03:55,095 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:03:55,095 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:03:55,145 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:03:55,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-21 03:03:55,146 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:03:55,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-21 03:03:55,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2022-02-21 03:03:55,146 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:03:56,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:56,835 INFO L93 Difference]: Finished difference Result 3431 states and 4254 transitions. [2022-02-21 03:03:56,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-21 03:03:56,836 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:03:56,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:03:56,836 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:03:56,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 198 transitions. [2022-02-21 03:03:56,839 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:03:56,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 198 transitions. [2022-02-21 03:03:56,842 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 198 transitions. [2022-02-21 03:03:56,965 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:03:57,329 INFO L225 Difference]: With dead ends: 3431 [2022-02-21 03:03:57,330 INFO L226 Difference]: Without dead ends: 3430 [2022-02-21 03:03:57,331 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:03:57,331 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:03:57,332 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:03:57,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3430 states. [2022-02-21 03:03:58,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3430 to 2080. [2022-02-21 03:03:58,041 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:03:58,043 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:03:58,045 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:03:58,046 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:03:58,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:58,371 INFO L93 Difference]: Finished difference Result 3430 states and 4146 transitions. [2022-02-21 03:03:58,371 INFO L276 IsEmpty]: Start isEmpty. Operand 3430 states and 4146 transitions. [2022-02-21 03:03:58,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:58,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:58,378 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:03:58,379 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:03:58,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:03:58,716 INFO L93 Difference]: Finished difference Result 3430 states and 4146 transitions. [2022-02-21 03:03:58,716 INFO L276 IsEmpty]: Start isEmpty. Operand 3430 states and 4146 transitions. [2022-02-21 03:03:58,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:03:58,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:03:58,720 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:03:58,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:03:58,722 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:03:58,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2080 states to 2080 states and 2518 transitions. [2022-02-21 03:03:58,857 INFO L78 Accepts]: Start accepts. Automaton has 2080 states and 2518 transitions. Word has length 43 [2022-02-21 03:03:58,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:03:58,857 INFO L470 AbstractCegarLoop]: Abstraction has 2080 states and 2518 transitions. [2022-02-21 03:03:58,857 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:03:58,858 INFO L276 IsEmpty]: Start isEmpty. Operand 2080 states and 2518 transitions. [2022-02-21 03:03:58,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-02-21 03:03:58,861 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:03:58,861 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1] [2022-02-21 03:03:58,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:03:59,077 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:03:59,077 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:03:59,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:03:59,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1254740665, now seen corresponding path program 3 times [2022-02-21 03:03:59,078 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:03:59,078 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164757950] [2022-02-21 03:03:59,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:03:59,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:03:59,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:59,217 INFO L290 TraceCheckUtils]: 0: Hoare triple {28624#true} assume { :begin_inline_ULTIMATE.init } true; {28624#true} is VALID [2022-02-21 03:03:59,218 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_~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_~max~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {28624#true} is VALID [2022-02-21 03:03:59,218 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:03:59,218 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {28626#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:03:59,218 INFO L290 TraceCheckUtils]: 4: Hoare triple {28626#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {28626#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:03:59,219 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:03:59,219 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:03:59,219 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:03:59,220 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:03:59,220 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {28627#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-21 03:03:59,220 INFO L290 TraceCheckUtils]: 10: Hoare triple {28627#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {28627#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-21 03:03:59,220 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:03:59,221 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:03:59,221 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:03:59,221 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:03:59,222 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {28628#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-21 03:03:59,222 INFO L290 TraceCheckUtils]: 16: Hoare triple {28628#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {28628#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-21 03:03:59,222 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:03:59,223 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:03:59,223 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:03:59,223 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:03:59,223 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {28629#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-21 03:03:59,224 INFO L290 TraceCheckUtils]: 22: Hoare triple {28629#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {28629#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-21 03:03:59,224 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:03:59,224 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:03:59,224 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:03:59,225 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:03:59,225 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {28630#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-21 03:03:59,225 INFO L290 TraceCheckUtils]: 28: Hoare triple {28630#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {28630#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-21 03:03:59,226 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:03:59,226 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:03:59,226 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:03:59,226 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:03:59,227 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {28631#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-21 03:03:59,227 INFO L290 TraceCheckUtils]: 34: Hoare triple {28631#(<= |ULTIMATE.start_main_~a~0#1| 5)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {28631#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-21 03:03:59,227 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:03:59,228 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:03:59,228 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:03:59,228 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:03:59,228 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {28632#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-21 03:03:59,229 INFO L290 TraceCheckUtils]: 40: Hoare triple {28632#(<= |ULTIMATE.start_main_~a~0#1| 6)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {28632#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-21 03:03:59,229 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:03:59,229 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:03:59,230 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:03:59,230 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:03:59,230 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {28633#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-21 03:03:59,230 INFO L290 TraceCheckUtils]: 46: Hoare triple {28633#(<= |ULTIMATE.start_main_~a~0#1| 7)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {28633#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-21 03:03:59,231 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:03:59,231 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:03:59,231 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:03:59,231 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:03:59,232 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {28634#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-21 03:03:59,232 INFO L290 TraceCheckUtils]: 52: Hoare triple {28634#(<= |ULTIMATE.start_main_~a~0#1| 8)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {28634#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-21 03:03:59,232 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:03:59,233 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:03:59,233 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:03:59,233 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:03:59,233 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {28635#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-21 03:03:59,234 INFO L290 TraceCheckUtils]: 58: Hoare triple {28635#(<= |ULTIMATE.start_main_~a~0#1| 9)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {28635#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-21 03:03:59,234 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:03:59,234 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:03:59,235 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:03:59,235 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:03:59,235 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {28636#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-21 03:03:59,235 INFO L290 TraceCheckUtils]: 64: Hoare triple {28636#(<= |ULTIMATE.start_main_~a~0#1| 10)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {28636#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-21 03:03:59,236 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:03:59,236 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:03:59,236 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:03:59,236 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164757950] [2022-02-21 03:03:59,236 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164757950] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:03:59,236 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375148374] [2022-02-21 03:03:59,236 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 03:03:59,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:03:59,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:03:59,237 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:03:59,238 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:03:59,288 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-02-21 03:03:59,288 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:03:59,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-21 03:03:59,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:03:59,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:03:59,538 INFO L290 TraceCheckUtils]: 0: Hoare triple {28624#true} assume { :begin_inline_ULTIMATE.init } true; {28624#true} is VALID [2022-02-21 03:03:59,538 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_~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_~max~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {28624#true} is VALID [2022-02-21 03:03:59,539 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:03:59,539 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {28626#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:03:59,539 INFO L290 TraceCheckUtils]: 4: Hoare triple {28626#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {28626#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:03:59,539 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:03:59,540 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:03:59,540 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:03:59,540 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:03:59,541 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {28627#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-21 03:03:59,541 INFO L290 TraceCheckUtils]: 10: Hoare triple {28627#(<= |ULTIMATE.start_main_~a~0#1| 1)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {28627#(<= |ULTIMATE.start_main_~a~0#1| 1)} is VALID [2022-02-21 03:03:59,541 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:03:59,542 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:03:59,542 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:03:59,542 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:03:59,542 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {28628#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-21 03:03:59,543 INFO L290 TraceCheckUtils]: 16: Hoare triple {28628#(<= |ULTIMATE.start_main_~a~0#1| 2)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {28628#(<= |ULTIMATE.start_main_~a~0#1| 2)} is VALID [2022-02-21 03:03:59,543 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:03:59,543 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:03:59,543 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:03:59,544 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:03:59,544 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {28629#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-21 03:03:59,544 INFO L290 TraceCheckUtils]: 22: Hoare triple {28629#(<= |ULTIMATE.start_main_~a~0#1| 3)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {28629#(<= |ULTIMATE.start_main_~a~0#1| 3)} is VALID [2022-02-21 03:03:59,545 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:03:59,545 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:03:59,545 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:03:59,545 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:03:59,546 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {28630#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-21 03:03:59,546 INFO L290 TraceCheckUtils]: 28: Hoare triple {28630#(<= |ULTIMATE.start_main_~a~0#1| 4)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {28630#(<= |ULTIMATE.start_main_~a~0#1| 4)} is VALID [2022-02-21 03:03:59,546 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:03:59,547 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:03:59,547 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:03:59,547 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:03:59,547 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {28631#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-21 03:03:59,548 INFO L290 TraceCheckUtils]: 34: Hoare triple {28631#(<= |ULTIMATE.start_main_~a~0#1| 5)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {28631#(<= |ULTIMATE.start_main_~a~0#1| 5)} is VALID [2022-02-21 03:03:59,548 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:03:59,548 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:03:59,549 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:03:59,549 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:03:59,549 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {28632#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-21 03:03:59,549 INFO L290 TraceCheckUtils]: 40: Hoare triple {28632#(<= |ULTIMATE.start_main_~a~0#1| 6)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {28632#(<= |ULTIMATE.start_main_~a~0#1| 6)} is VALID [2022-02-21 03:03:59,550 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:03:59,550 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:03:59,550 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:03:59,551 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:03:59,551 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {28633#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-21 03:03:59,551 INFO L290 TraceCheckUtils]: 46: Hoare triple {28633#(<= |ULTIMATE.start_main_~a~0#1| 7)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {28633#(<= |ULTIMATE.start_main_~a~0#1| 7)} is VALID [2022-02-21 03:03:59,551 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:03:59,552 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:03:59,552 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:03:59,552 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:03:59,553 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {28634#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-21 03:03:59,553 INFO L290 TraceCheckUtils]: 52: Hoare triple {28634#(<= |ULTIMATE.start_main_~a~0#1| 8)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {28634#(<= |ULTIMATE.start_main_~a~0#1| 8)} is VALID [2022-02-21 03:03:59,553 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:03:59,553 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:03:59,554 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:03:59,554 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:03:59,554 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {28635#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-21 03:03:59,555 INFO L290 TraceCheckUtils]: 58: Hoare triple {28635#(<= |ULTIMATE.start_main_~a~0#1| 9)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {28635#(<= |ULTIMATE.start_main_~a~0#1| 9)} is VALID [2022-02-21 03:03:59,555 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:03:59,555 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:03:59,555 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:03:59,556 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:03:59,556 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {28636#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-21 03:03:59,556 INFO L290 TraceCheckUtils]: 64: Hoare triple {28636#(<= |ULTIMATE.start_main_~a~0#1| 10)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {28636#(<= |ULTIMATE.start_main_~a~0#1| 10)} is VALID [2022-02-21 03:03:59,557 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:03:59,557 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:03:59,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:03:59,980 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:03:59,981 INFO L290 TraceCheckUtils]: 64: Hoare triple {28835#(<= |ULTIMATE.start_main_~a~0#1| 2147483646)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {28835#(<= |ULTIMATE.start_main_~a~0#1| 2147483646)} is VALID [2022-02-21 03:03:59,981 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {28835#(<= |ULTIMATE.start_main_~a~0#1| 2147483646)} is VALID [2022-02-21 03:03:59,981 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:03:59,982 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:03:59,982 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:03:59,982 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:03:59,983 INFO L290 TraceCheckUtils]: 58: Hoare triple {28851#(<= |ULTIMATE.start_main_~a~0#1| 2147483645)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {28851#(<= |ULTIMATE.start_main_~a~0#1| 2147483645)} is VALID [2022-02-21 03:03:59,983 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {28851#(<= |ULTIMATE.start_main_~a~0#1| 2147483645)} is VALID [2022-02-21 03:03:59,983 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:03:59,983 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:03:59,984 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:03:59,984 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:03:59,984 INFO L290 TraceCheckUtils]: 52: Hoare triple {28870#(<= |ULTIMATE.start_main_~a~0#1| 2147483644)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {28870#(<= |ULTIMATE.start_main_~a~0#1| 2147483644)} is VALID [2022-02-21 03:03:59,984 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {28870#(<= |ULTIMATE.start_main_~a~0#1| 2147483644)} is VALID [2022-02-21 03:03:59,995 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:03:59,995 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:03:59,996 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:03:59,996 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:03:59,996 INFO L290 TraceCheckUtils]: 46: Hoare triple {28889#(<= |ULTIMATE.start_main_~a~0#1| 2147483643)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {28889#(<= |ULTIMATE.start_main_~a~0#1| 2147483643)} is VALID [2022-02-21 03:03:59,997 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {28889#(<= |ULTIMATE.start_main_~a~0#1| 2147483643)} is VALID [2022-02-21 03:03:59,997 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:03:59,997 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:03:59,998 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:03:59,998 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:03:59,998 INFO L290 TraceCheckUtils]: 40: Hoare triple {28908#(<= |ULTIMATE.start_main_~a~0#1| 2147483642)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {28908#(<= |ULTIMATE.start_main_~a~0#1| 2147483642)} is VALID [2022-02-21 03:03:59,998 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {28908#(<= |ULTIMATE.start_main_~a~0#1| 2147483642)} is VALID [2022-02-21 03:03:59,999 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:03:59,999 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:03:59,999 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:04:00,000 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:04:00,000 INFO L290 TraceCheckUtils]: 34: Hoare triple {28927#(<= |ULTIMATE.start_main_~a~0#1| 2147483641)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {28927#(<= |ULTIMATE.start_main_~a~0#1| 2147483641)} is VALID [2022-02-21 03:04:00,000 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {28927#(<= |ULTIMATE.start_main_~a~0#1| 2147483641)} is VALID [2022-02-21 03:04:00,001 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:04:00,001 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:04:00,001 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:04:00,001 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:04:00,002 INFO L290 TraceCheckUtils]: 28: Hoare triple {28946#(<= |ULTIMATE.start_main_~a~0#1| 2147483640)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {28946#(<= |ULTIMATE.start_main_~a~0#1| 2147483640)} is VALID [2022-02-21 03:04:00,002 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {28946#(<= |ULTIMATE.start_main_~a~0#1| 2147483640)} is VALID [2022-02-21 03:04:00,002 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:04:00,003 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:04:00,003 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:04:00,003 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:04:00,004 INFO L290 TraceCheckUtils]: 22: Hoare triple {28965#(<= |ULTIMATE.start_main_~a~0#1| 2147483639)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {28965#(<= |ULTIMATE.start_main_~a~0#1| 2147483639)} is VALID [2022-02-21 03:04:00,004 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {28965#(<= |ULTIMATE.start_main_~a~0#1| 2147483639)} is VALID [2022-02-21 03:04:00,004 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:04:00,004 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:04:00,005 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:04:00,005 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:04:00,005 INFO L290 TraceCheckUtils]: 16: Hoare triple {28984#(<= |ULTIMATE.start_main_~a~0#1| 2147483638)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {28984#(<= |ULTIMATE.start_main_~a~0#1| 2147483638)} is VALID [2022-02-21 03:04:00,006 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {28984#(<= |ULTIMATE.start_main_~a~0#1| 2147483638)} is VALID [2022-02-21 03:04:00,006 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:04:00,006 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:04:00,007 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:04:00,007 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:04:00,007 INFO L290 TraceCheckUtils]: 10: Hoare triple {29003#(<= |ULTIMATE.start_main_~a~0#1| 2147483637)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {29003#(<= |ULTIMATE.start_main_~a~0#1| 2147483637)} is VALID [2022-02-21 03:04:00,007 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {29003#(<= |ULTIMATE.start_main_~a~0#1| 2147483637)} is VALID [2022-02-21 03:04:00,008 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:04:00,008 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:04:00,009 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:04:00,009 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:04:00,009 INFO L290 TraceCheckUtils]: 4: Hoare triple {29022#(<= |ULTIMATE.start_main_~a~0#1| 2147483636)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {29022#(<= |ULTIMATE.start_main_~a~0#1| 2147483636)} is VALID [2022-02-21 03:04:00,009 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {29022#(<= |ULTIMATE.start_main_~a~0#1| 2147483636)} is VALID [2022-02-21 03:04:00,010 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:04:00,010 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_~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_~max~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {28624#true} is VALID [2022-02-21 03:04:00,010 INFO L290 TraceCheckUtils]: 0: Hoare triple {28624#true} assume { :begin_inline_ULTIMATE.init } true; {28624#true} is VALID [2022-02-21 03:04:00,010 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:04:00,010 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375148374] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:04:00,010 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:04:00,011 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2022-02-21 03:04:00,011 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067215837] [2022-02-21 03:04:00,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:04:00,011 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:04:00,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:00,012 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:04:00,096 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:04:00,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-21 03:04:00,096 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:00,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-21 03:04:00,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2022-02-21 03:04:00,097 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:04:02,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:02,918 INFO L93 Difference]: Finished difference Result 5604 states and 7380 transitions. [2022-02-21 03:04:02,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-21 03:04:02,918 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:04:02,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:02,919 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:04:02,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 301 transitions. [2022-02-21 03:04:02,920 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:04:02,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 301 transitions. [2022-02-21 03:04:02,922 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 301 transitions. [2022-02-21 03:04:03,111 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:04:04,011 INFO L225 Difference]: With dead ends: 5604 [2022-02-21 03:04:04,011 INFO L226 Difference]: Without dead ends: 5602 [2022-02-21 03:04:04,013 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:04:04,014 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:04:04,014 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:04:04,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5602 states. [2022-02-21 03:04:05,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5602 to 3121. [2022-02-21 03:04:05,131 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:05,133 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:04:05,135 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:04:05,136 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:04:05,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:05,865 INFO L93 Difference]: Finished difference Result 5602 states and 6953 transitions. [2022-02-21 03:04:05,865 INFO L276 IsEmpty]: Start isEmpty. Operand 5602 states and 6953 transitions. [2022-02-21 03:04:05,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:05,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:05,873 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:04:05,874 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:04:06,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:06,612 INFO L93 Difference]: Finished difference Result 5602 states and 6953 transitions. [2022-02-21 03:04:06,612 INFO L276 IsEmpty]: Start isEmpty. Operand 5602 states and 6953 transitions. [2022-02-21 03:04:06,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:06,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:06,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:06,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:06,618 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:04:06,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 3842 transitions. [2022-02-21 03:04:06,929 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 3842 transitions. Word has length 66 [2022-02-21 03:04:06,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:06,929 INFO L470 AbstractCegarLoop]: Abstraction has 3121 states and 3842 transitions. [2022-02-21 03:04:06,929 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:04:06,929 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 3842 transitions. [2022-02-21 03:04:06,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-21 03:04:06,931 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:06,931 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 1, 1, 1, 1] [2022-02-21 03:04:06,947 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:04:07,133 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:04:07,134 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:04:07,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:07,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1080032752, now seen corresponding path program 3 times [2022-02-21 03:04:07,134 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:07,134 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742269295] [2022-02-21 03:04:07,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:07,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:07,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:07,253 INFO L290 TraceCheckUtils]: 0: Hoare triple {50120#true} assume { :begin_inline_ULTIMATE.init } true; {50120#true} is VALID [2022-02-21 03:04:07,253 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_~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_~max~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {50120#true} is VALID [2022-02-21 03:04:07,253 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:04:07,253 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {50122#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:04:07,254 INFO L290 TraceCheckUtils]: 4: Hoare triple {50122#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {50122#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:04:07,254 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:04:07,254 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:04:07,254 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:04:07,255 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:04:07,255 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {50123#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:04:07,255 INFO L290 TraceCheckUtils]: 10: Hoare triple {50123#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {50123#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:04:07,256 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:04:07,256 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:04:07,256 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:04:07,257 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:04:07,257 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {50124#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:04:07,257 INFO L290 TraceCheckUtils]: 16: Hoare triple {50124#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {50124#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:04:07,258 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:04:07,258 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:04:07,258 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:04:07,259 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:04:07,259 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {50125#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:04:07,259 INFO L290 TraceCheckUtils]: 22: Hoare triple {50125#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {50125#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:04:07,260 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:04:07,260 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:04:07,260 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:04:07,261 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:04:07,261 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {50126#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-21 03:04:07,261 INFO L290 TraceCheckUtils]: 28: Hoare triple {50126#(<= |ULTIMATE.start_main_~x~0#1| 5)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {50126#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-21 03:04:07,262 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:04:07,262 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:04:07,262 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:04:07,263 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:04:07,263 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {50127#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-21 03:04:07,263 INFO L290 TraceCheckUtils]: 34: Hoare triple {50127#(<= |ULTIMATE.start_main_~x~0#1| 6)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {50127#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-21 03:04:07,264 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:04:07,264 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:04:07,264 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:04:07,265 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:04:07,265 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {50128#(<= |ULTIMATE.start_main_~x~0#1| 7)} is VALID [2022-02-21 03:04:07,265 INFO L290 TraceCheckUtils]: 40: Hoare triple {50128#(<= |ULTIMATE.start_main_~x~0#1| 7)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {50128#(<= |ULTIMATE.start_main_~x~0#1| 7)} is VALID [2022-02-21 03:04:07,266 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:04:07,266 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:04:07,266 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:04:07,267 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:04:07,267 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {50129#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-21 03:04:07,267 INFO L290 TraceCheckUtils]: 46: Hoare triple {50129#(<= |ULTIMATE.start_main_~x~0#1| 8)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {50129#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-21 03:04:07,267 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:04:07,268 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:04:07,268 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:04:07,268 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:04:07,268 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {50130#(<= |ULTIMATE.start_main_~x~0#1| 9)} is VALID [2022-02-21 03:04:07,269 INFO L290 TraceCheckUtils]: 52: Hoare triple {50130#(<= |ULTIMATE.start_main_~x~0#1| 9)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {50130#(<= |ULTIMATE.start_main_~x~0#1| 9)} is VALID [2022-02-21 03:04:07,269 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:04:07,269 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:04:07,270 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:04:07,270 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:04:07,270 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {50131#(<= |ULTIMATE.start_main_~x~0#1| 10)} is VALID [2022-02-21 03:04:07,270 INFO L290 TraceCheckUtils]: 58: Hoare triple {50131#(<= |ULTIMATE.start_main_~x~0#1| 10)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {50131#(<= |ULTIMATE.start_main_~x~0#1| 10)} is VALID [2022-02-21 03:04:07,271 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:04:07,271 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:04:07,271 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:04:07,272 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:04:07,272 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {50132#(<= |ULTIMATE.start_main_~x~0#1| 11)} is VALID [2022-02-21 03:04:07,272 INFO L290 TraceCheckUtils]: 64: Hoare triple {50132#(<= |ULTIMATE.start_main_~x~0#1| 11)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {50132#(<= |ULTIMATE.start_main_~x~0#1| 11)} is VALID [2022-02-21 03:04:07,272 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:04:07,273 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:04:07,273 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:04:07,273 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:04:07,273 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:07,273 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742269295] [2022-02-21 03:04:07,273 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742269295] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:04:07,274 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363654443] [2022-02-21 03:04:07,274 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 03:04:07,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:04:07,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:04:07,275 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:04:07,275 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:04:07,325 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-02-21 03:04:07,325 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:04:07,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-21 03:04:07,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:07,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:04:07,625 INFO L290 TraceCheckUtils]: 0: Hoare triple {50120#true} assume { :begin_inline_ULTIMATE.init } true; {50120#true} is VALID [2022-02-21 03:04:07,625 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_~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_~max~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {50120#true} is VALID [2022-02-21 03:04:07,626 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:04:07,626 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {50122#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:04:07,627 INFO L290 TraceCheckUtils]: 4: Hoare triple {50122#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {50122#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:04:07,627 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:04:07,627 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:04:07,627 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:04:07,628 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:04:07,628 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {50123#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:04:07,629 INFO L290 TraceCheckUtils]: 10: Hoare triple {50123#(<= |ULTIMATE.start_main_~x~0#1| 2)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {50123#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:04:07,629 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:04:07,629 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:04:07,630 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:04:07,630 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:04:07,630 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {50124#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:04:07,631 INFO L290 TraceCheckUtils]: 16: Hoare triple {50124#(<= |ULTIMATE.start_main_~x~0#1| 3)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {50124#(<= |ULTIMATE.start_main_~x~0#1| 3)} is VALID [2022-02-21 03:04:07,631 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:04:07,631 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:04:07,632 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:04:07,632 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:04:07,632 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {50125#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:04:07,633 INFO L290 TraceCheckUtils]: 22: Hoare triple {50125#(<= |ULTIMATE.start_main_~x~0#1| 4)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {50125#(<= |ULTIMATE.start_main_~x~0#1| 4)} is VALID [2022-02-21 03:04:07,633 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:04:07,633 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:04:07,634 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:04:07,634 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:04:07,634 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {50126#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-21 03:04:07,635 INFO L290 TraceCheckUtils]: 28: Hoare triple {50126#(<= |ULTIMATE.start_main_~x~0#1| 5)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {50126#(<= |ULTIMATE.start_main_~x~0#1| 5)} is VALID [2022-02-21 03:04:07,635 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:04:07,635 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:04:07,636 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:04:07,636 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:04:07,636 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {50127#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-21 03:04:07,637 INFO L290 TraceCheckUtils]: 34: Hoare triple {50127#(<= |ULTIMATE.start_main_~x~0#1| 6)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {50127#(<= |ULTIMATE.start_main_~x~0#1| 6)} is VALID [2022-02-21 03:04:07,637 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:04:07,637 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:04:07,638 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:04:07,638 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:04:07,639 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {50128#(<= |ULTIMATE.start_main_~x~0#1| 7)} is VALID [2022-02-21 03:04:07,639 INFO L290 TraceCheckUtils]: 40: Hoare triple {50128#(<= |ULTIMATE.start_main_~x~0#1| 7)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {50128#(<= |ULTIMATE.start_main_~x~0#1| 7)} is VALID [2022-02-21 03:04:07,639 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:04:07,640 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:04:07,640 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:04:07,641 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:04:07,641 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {50129#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-21 03:04:07,641 INFO L290 TraceCheckUtils]: 46: Hoare triple {50129#(<= |ULTIMATE.start_main_~x~0#1| 8)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {50129#(<= |ULTIMATE.start_main_~x~0#1| 8)} is VALID [2022-02-21 03:04:07,642 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:04:07,642 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:04:07,642 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:04:07,643 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:04:07,643 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {50130#(<= |ULTIMATE.start_main_~x~0#1| 9)} is VALID [2022-02-21 03:04:07,644 INFO L290 TraceCheckUtils]: 52: Hoare triple {50130#(<= |ULTIMATE.start_main_~x~0#1| 9)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {50130#(<= |ULTIMATE.start_main_~x~0#1| 9)} is VALID [2022-02-21 03:04:07,644 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:04:07,644 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:04:07,644 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:04:07,645 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:04:07,645 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {50131#(<= |ULTIMATE.start_main_~x~0#1| 10)} is VALID [2022-02-21 03:04:07,646 INFO L290 TraceCheckUtils]: 58: Hoare triple {50131#(<= |ULTIMATE.start_main_~x~0#1| 10)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {50131#(<= |ULTIMATE.start_main_~x~0#1| 10)} is VALID [2022-02-21 03:04:07,646 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:04:07,646 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:04:07,646 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:04:07,647 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:04:07,647 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {50132#(<= |ULTIMATE.start_main_~x~0#1| 11)} is VALID [2022-02-21 03:04:07,648 INFO L290 TraceCheckUtils]: 64: Hoare triple {50132#(<= |ULTIMATE.start_main_~x~0#1| 11)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {50132#(<= |ULTIMATE.start_main_~x~0#1| 11)} is VALID [2022-02-21 03:04:07,648 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:04:07,648 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:04:07,649 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:04:07,649 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:04:07,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:04:08,072 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:04:08,073 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:04:08,073 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:04:08,073 INFO L290 TraceCheckUtils]: 64: Hoare triple {50337#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {50337#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:04:08,074 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {50337#(<= |ULTIMATE.start_main_~x~0#1| 2147483646)} is VALID [2022-02-21 03:04:08,074 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:04:08,074 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:04:08,075 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:04:08,075 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:04:08,075 INFO L290 TraceCheckUtils]: 58: Hoare triple {50353#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {50353#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:04:08,075 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {50353#(<= |ULTIMATE.start_main_~x~0#1| 2147483645)} is VALID [2022-02-21 03:04:08,076 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:04:08,076 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:04:08,076 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:04:08,077 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:04:08,077 INFO L290 TraceCheckUtils]: 52: Hoare triple {50372#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {50372#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} is VALID [2022-02-21 03:04:08,077 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {50372#(<= |ULTIMATE.start_main_~x~0#1| 2147483644)} is VALID [2022-02-21 03:04:08,077 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:04:08,078 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:04:08,078 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:04:08,078 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:04:08,080 INFO L290 TraceCheckUtils]: 46: Hoare triple {50391#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {50391#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} is VALID [2022-02-21 03:04:08,081 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {50391#(<= |ULTIMATE.start_main_~x~0#1| 2147483643)} is VALID [2022-02-21 03:04:08,082 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:04:08,082 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:04:08,083 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:04:08,083 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:04:08,083 INFO L290 TraceCheckUtils]: 40: Hoare triple {50410#(<= |ULTIMATE.start_main_~x~0#1| 2147483642)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {50410#(<= |ULTIMATE.start_main_~x~0#1| 2147483642)} is VALID [2022-02-21 03:04:08,083 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {50410#(<= |ULTIMATE.start_main_~x~0#1| 2147483642)} is VALID [2022-02-21 03:04:08,084 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:04:08,084 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:04:08,084 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:04:08,085 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:04:08,085 INFO L290 TraceCheckUtils]: 34: Hoare triple {50429#(<= |ULTIMATE.start_main_~x~0#1| 2147483641)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {50429#(<= |ULTIMATE.start_main_~x~0#1| 2147483641)} is VALID [2022-02-21 03:04:08,085 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {50429#(<= |ULTIMATE.start_main_~x~0#1| 2147483641)} is VALID [2022-02-21 03:04:08,086 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:04:08,086 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:04:08,086 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:04:08,086 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:04:08,087 INFO L290 TraceCheckUtils]: 28: Hoare triple {50448#(<= |ULTIMATE.start_main_~x~0#1| 2147483640)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {50448#(<= |ULTIMATE.start_main_~x~0#1| 2147483640)} is VALID [2022-02-21 03:04:08,087 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {50448#(<= |ULTIMATE.start_main_~x~0#1| 2147483640)} is VALID [2022-02-21 03:04:08,087 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:04:08,088 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:04:08,088 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:04:08,088 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:04:08,088 INFO L290 TraceCheckUtils]: 22: Hoare triple {50467#(<= |ULTIMATE.start_main_~x~0#1| 2147483639)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {50467#(<= |ULTIMATE.start_main_~x~0#1| 2147483639)} is VALID [2022-02-21 03:04:08,089 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {50467#(<= |ULTIMATE.start_main_~x~0#1| 2147483639)} is VALID [2022-02-21 03:04:08,089 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:04:08,089 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:04:08,090 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:04:08,090 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:04:08,090 INFO L290 TraceCheckUtils]: 16: Hoare triple {50486#(<= |ULTIMATE.start_main_~x~0#1| 2147483638)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {50486#(<= |ULTIMATE.start_main_~x~0#1| 2147483638)} is VALID [2022-02-21 03:04:08,090 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {50486#(<= |ULTIMATE.start_main_~x~0#1| 2147483638)} is VALID [2022-02-21 03:04:08,091 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:04:08,091 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:04:08,091 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:04:08,091 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:04:08,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {50505#(<= |ULTIMATE.start_main_~x~0#1| 2147483637)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {50505#(<= |ULTIMATE.start_main_~x~0#1| 2147483637)} is VALID [2022-02-21 03:04:08,092 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {50505#(<= |ULTIMATE.start_main_~x~0#1| 2147483637)} is VALID [2022-02-21 03:04:08,092 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:04:08,093 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:04:08,093 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:04:08,093 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:04:08,093 INFO L290 TraceCheckUtils]: 4: Hoare triple {50524#(<= |ULTIMATE.start_main_~x~0#1| 2147483636)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {50524#(<= |ULTIMATE.start_main_~x~0#1| 2147483636)} is VALID [2022-02-21 03:04:08,094 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {50524#(<= |ULTIMATE.start_main_~x~0#1| 2147483636)} is VALID [2022-02-21 03:04:08,094 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:04:08,094 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_~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_~max~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {50120#true} is VALID [2022-02-21 03:04:08,094 INFO L290 TraceCheckUtils]: 0: Hoare triple {50120#true} assume { :begin_inline_ULTIMATE.init } true; {50120#true} is VALID [2022-02-21 03:04:08,094 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:04:08,094 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363654443] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:04:08,095 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:04:08,095 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2022-02-21 03:04:08,095 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669917077] [2022-02-21 03:04:08,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:04:08,095 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:04:08,095 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:08,095 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:04:08,170 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:04:08,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-21 03:04:08,170 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:08,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-21 03:04:08,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2022-02-21 03:04:08,171 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:04:17,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:17,444 INFO L93 Difference]: Finished difference Result 12257 states and 15589 transitions. [2022-02-21 03:04:17,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-21 03:04:17,444 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:04:17,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:04:17,444 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:04:17,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 233 transitions. [2022-02-21 03:04:17,445 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:04:17,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 233 transitions. [2022-02-21 03:04:17,446 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 233 transitions. [2022-02-21 03:04:17,570 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:04:21,379 INFO L225 Difference]: With dead ends: 12257 [2022-02-21 03:04:21,379 INFO L226 Difference]: Without dead ends: 12256 [2022-02-21 03:04:21,383 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:04:21,383 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:04:21,384 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:04:21,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12256 states. [2022-02-21 03:04:26,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12256 to 12248. [2022-02-21 03:04:26,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:04:26,722 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:04:26,733 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:04:26,742 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:04:30,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:30,484 INFO L93 Difference]: Finished difference Result 12256 states and 14229 transitions. [2022-02-21 03:04:30,484 INFO L276 IsEmpty]: Start isEmpty. Operand 12256 states and 14229 transitions. [2022-02-21 03:04:30,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:30,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:30,502 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:04:30,511 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:04:34,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:04:34,113 INFO L93 Difference]: Finished difference Result 12256 states and 14229 transitions. [2022-02-21 03:04:34,113 INFO L276 IsEmpty]: Start isEmpty. Operand 12256 states and 14229 transitions. [2022-02-21 03:04:34,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:04:34,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:04:34,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:04:34,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:04:34,133 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:04:38,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12248 states to 12248 states and 14229 transitions. [2022-02-21 03:04:38,239 INFO L78 Accepts]: Start accepts. Automaton has 12248 states and 14229 transitions. Word has length 68 [2022-02-21 03:04:38,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:04:38,239 INFO L470 AbstractCegarLoop]: Abstraction has 12248 states and 14229 transitions. [2022-02-21 03:04:38,239 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:04:38,239 INFO L276 IsEmpty]: Start isEmpty. Operand 12248 states and 14229 transitions. [2022-02-21 03:04:38,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-21 03:04:38,243 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:04:38,243 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 1, 1, 1, 1] [2022-02-21 03:04:38,261 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:04:38,444 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:04:38,444 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:04:38,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:04:38,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1812968066, now seen corresponding path program 3 times [2022-02-21 03:04:38,445 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:04:38,445 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903830575] [2022-02-21 03:04:38,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:04:38,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:04:38,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:38,619 INFO L290 TraceCheckUtils]: 0: Hoare triple {102859#true} assume { :begin_inline_ULTIMATE.init } true; {102859#true} is VALID [2022-02-21 03:04:38,620 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_~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_~max~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {102859#true} is VALID [2022-02-21 03:04:38,622 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:04:38,622 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {102861#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:04:38,623 INFO L290 TraceCheckUtils]: 4: Hoare triple {102861#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {102861#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:04:38,623 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:04:38,623 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:04:38,624 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:04:38,624 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:04:38,624 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {102862#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:04:38,624 INFO L290 TraceCheckUtils]: 10: Hoare triple {102862#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {102862#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:04:38,625 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:04:38,625 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:04:38,625 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:04:38,626 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:04:38,626 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {102863#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:38,626 INFO L290 TraceCheckUtils]: 16: Hoare triple {102863#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {102863#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:38,627 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:04:38,627 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:04:38,627 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:04:38,628 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:04:38,628 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {102864#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:38,628 INFO L290 TraceCheckUtils]: 22: Hoare triple {102864#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {102864#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:38,628 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:04:38,629 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:04:38,629 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:04:38,629 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:04:38,630 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {102865#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} is VALID [2022-02-21 03:04:38,630 INFO L290 TraceCheckUtils]: 28: Hoare triple {102865#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {102865#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} is VALID [2022-02-21 03:04:38,630 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:04:38,630 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:04:38,631 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:04:38,631 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:04:38,631 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {102866#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:38,632 INFO L290 TraceCheckUtils]: 34: Hoare triple {102866#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {102866#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:38,632 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:04:38,632 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:04:38,633 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:04:38,634 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:04:38,634 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {102867#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:38,635 INFO L290 TraceCheckUtils]: 40: Hoare triple {102867#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {102867#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:38,647 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:04:38,648 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:04:38,648 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:04:38,649 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:04:38,649 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {102868#(<= 0 (+ 7 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:38,649 INFO L290 TraceCheckUtils]: 46: Hoare triple {102868#(<= 0 (+ 7 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {102868#(<= 0 (+ 7 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:38,650 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:04:38,650 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:04:38,650 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:04:38,651 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:04:38,651 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {102869#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 8))} is VALID [2022-02-21 03:04:38,651 INFO L290 TraceCheckUtils]: 52: Hoare triple {102869#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 8))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {102869#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 8))} is VALID [2022-02-21 03:04:38,652 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:04:38,652 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:04:38,653 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:04:38,653 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:04:38,653 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {102870#(<= 0 (+ 9 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:38,654 INFO L290 TraceCheckUtils]: 58: Hoare triple {102870#(<= 0 (+ 9 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {102870#(<= 0 (+ 9 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:38,654 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:04:38,655 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:04:38,655 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:04:38,655 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:04:38,656 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {102871#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 10))} is VALID [2022-02-21 03:04:38,656 INFO L290 TraceCheckUtils]: 64: Hoare triple {102871#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 10))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {102871#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 10))} is VALID [2022-02-21 03:04:38,656 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:04:38,657 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:04:38,657 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:04:38,657 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:04:38,658 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {102872#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 11))} is VALID [2022-02-21 03:04:38,658 INFO L290 TraceCheckUtils]: 70: Hoare triple {102872#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 11))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {102872#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 11))} is VALID [2022-02-21 03:04:38,658 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:04:38,659 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:04:38,659 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:04:38,660 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:04:38,660 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {102873#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 12))} is VALID [2022-02-21 03:04:38,660 INFO L290 TraceCheckUtils]: 76: Hoare triple {102873#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 12))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {102873#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 12))} is VALID [2022-02-21 03:04:38,661 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:04:38,661 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:04:38,661 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:04:38,662 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:04:38,662 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {102874#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 13))} is VALID [2022-02-21 03:04:38,662 INFO L290 TraceCheckUtils]: 82: Hoare triple {102874#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 13))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {102874#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 13))} is VALID [2022-02-21 03:04:38,663 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:04:38,663 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:04:38,663 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:04:38,664 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:04:38,664 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {102875#(<= 0 (+ 14 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:38,664 INFO L290 TraceCheckUtils]: 88: Hoare triple {102875#(<= 0 (+ 14 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {102875#(<= 0 (+ 14 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:38,665 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:04:38,665 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:04:38,665 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:04:38,666 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:04:38,666 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903830575] [2022-02-21 03:04:38,666 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903830575] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:04:38,666 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548725912] [2022-02-21 03:04:38,666 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 03:04:38,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:04:38,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:04:38,667 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:04:38,668 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:04:38,729 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2022-02-21 03:04:38,729 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:04:38,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-21 03:04:38,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:04:38,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:04:39,091 INFO L290 TraceCheckUtils]: 0: Hoare triple {102859#true} assume { :begin_inline_ULTIMATE.init } true; {102859#true} is VALID [2022-02-21 03:04:39,091 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_~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_~max~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {102859#true} is VALID [2022-02-21 03:04:39,092 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:04:39,092 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {102861#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:04:39,092 INFO L290 TraceCheckUtils]: 4: Hoare triple {102861#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {102861#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:04:39,092 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:04:39,093 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:04:39,093 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:04:39,093 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:04:39,094 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {102862#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:04:39,094 INFO L290 TraceCheckUtils]: 10: Hoare triple {102862#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {102862#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 1))} is VALID [2022-02-21 03:04:39,094 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:04:39,095 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:04:39,095 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:04:39,095 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:04:39,096 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {102863#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:39,096 INFO L290 TraceCheckUtils]: 16: Hoare triple {102863#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {102863#(<= 0 (+ 2 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:39,096 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:04:39,097 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:04:39,097 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:04:39,097 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:04:39,098 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {102864#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:39,098 INFO L290 TraceCheckUtils]: 22: Hoare triple {102864#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {102864#(<= 0 (+ 3 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:39,098 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:04:39,099 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:04:39,099 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:04:39,099 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:04:39,099 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {102865#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} is VALID [2022-02-21 03:04:39,100 INFO L290 TraceCheckUtils]: 28: Hoare triple {102865#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {102865#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 4))} is VALID [2022-02-21 03:04:39,100 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:04:39,100 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:04:39,101 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:04:39,101 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:04:39,101 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {102866#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:39,102 INFO L290 TraceCheckUtils]: 34: Hoare triple {102866#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {102866#(<= 0 (+ 5 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:39,102 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:04:39,102 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:04:39,103 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:04:39,103 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:04:39,103 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {102867#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:39,104 INFO L290 TraceCheckUtils]: 40: Hoare triple {102867#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {102867#(<= 0 (+ 6 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:39,104 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:04:39,104 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:04:39,105 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:04:39,105 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:04:39,105 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {102868#(<= 0 (+ 7 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:39,105 INFO L290 TraceCheckUtils]: 46: Hoare triple {102868#(<= 0 (+ 7 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {102868#(<= 0 (+ 7 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:39,106 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:04:39,106 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:04:39,106 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:04:39,107 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:04:39,107 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {102869#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 8))} is VALID [2022-02-21 03:04:39,107 INFO L290 TraceCheckUtils]: 52: Hoare triple {102869#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 8))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {102869#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 8))} is VALID [2022-02-21 03:04:39,107 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:04:39,108 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:04:39,108 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:04:39,108 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:04:39,109 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {102870#(<= 0 (+ 9 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:39,109 INFO L290 TraceCheckUtils]: 58: Hoare triple {102870#(<= 0 (+ 9 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {102870#(<= 0 (+ 9 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:39,109 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:04:39,110 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:04:39,110 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:04:39,110 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:04:39,110 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {102871#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 10))} is VALID [2022-02-21 03:04:39,111 INFO L290 TraceCheckUtils]: 64: Hoare triple {102871#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 10))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {102871#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 10))} is VALID [2022-02-21 03:04:39,111 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:04:39,111 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:04:39,112 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:04:39,112 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:04:39,112 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {102872#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 11))} is VALID [2022-02-21 03:04:39,112 INFO L290 TraceCheckUtils]: 70: Hoare triple {102872#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 11))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {102872#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 11))} is VALID [2022-02-21 03:04:39,113 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:04:39,113 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:04:39,113 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:04:39,114 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:04:39,114 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {102873#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 12))} is VALID [2022-02-21 03:04:39,114 INFO L290 TraceCheckUtils]: 76: Hoare triple {102873#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 12))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {102873#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 12))} is VALID [2022-02-21 03:04:39,114 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:04:39,115 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:04:39,115 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:04:39,115 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:04:39,116 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {102874#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 13))} is VALID [2022-02-21 03:04:39,116 INFO L290 TraceCheckUtils]: 82: Hoare triple {102874#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 13))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {102874#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 13))} is VALID [2022-02-21 03:04:39,116 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:04:39,117 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:04:39,117 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:04:39,117 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:04:39,117 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {102875#(<= 0 (+ 14 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:39,118 INFO L290 TraceCheckUtils]: 88: Hoare triple {102875#(<= 0 (+ 14 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {102875#(<= 0 (+ 14 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:39,118 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:04:39,118 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:04:39,119 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:04:39,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:04:39,732 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:04:39,733 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:04:39,733 INFO L290 TraceCheckUtils]: 88: Hoare triple {103149#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {103149#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:39,733 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {103149#(<= 0 (+ 2147483647 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:39,734 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:04:39,734 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:04:39,735 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:04:39,735 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:04:39,735 INFO L290 TraceCheckUtils]: 82: Hoare triple {103168#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483646))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {103168#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483646))} is VALID [2022-02-21 03:04:39,735 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {103168#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483646))} is VALID [2022-02-21 03:04:39,736 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:04:39,736 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:04:39,736 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:04:39,737 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:04:39,737 INFO L290 TraceCheckUtils]: 76: Hoare triple {103187#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {103187#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:39,737 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {103187#(<= 0 (+ 2147483645 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:39,737 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:04:39,738 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:04:39,738 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:04:39,738 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:04:39,739 INFO L290 TraceCheckUtils]: 70: Hoare triple {103206#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483644))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {103206#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483644))} is VALID [2022-02-21 03:04:39,739 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {103206#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483644))} is VALID [2022-02-21 03:04:39,739 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:04:39,739 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:04:39,740 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:04:39,740 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:04:39,740 INFO L290 TraceCheckUtils]: 64: Hoare triple {103225#(<= 0 (+ 2147483643 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {103225#(<= 0 (+ 2147483643 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:39,741 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {103225#(<= 0 (+ 2147483643 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:39,741 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:04:39,743 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:04:39,743 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:04:39,744 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:04:39,744 INFO L290 TraceCheckUtils]: 58: Hoare triple {103244#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483642))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {103244#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483642))} is VALID [2022-02-21 03:04:39,744 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {103244#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483642))} is VALID [2022-02-21 03:04:39,745 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:04:39,745 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:04:39,746 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:04:39,746 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:04:39,746 INFO L290 TraceCheckUtils]: 52: Hoare triple {103263#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483641))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {103263#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483641))} is VALID [2022-02-21 03:04:39,746 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {103263#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483641))} is VALID [2022-02-21 03:04:39,747 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:04:39,747 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:04:39,748 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:04:39,748 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:04:39,748 INFO L290 TraceCheckUtils]: 46: Hoare triple {103282#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483640))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {103282#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483640))} is VALID [2022-02-21 03:04:39,749 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {103282#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483640))} is VALID [2022-02-21 03:04:39,749 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:04:39,749 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:04:39,750 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:04:39,750 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:04:39,750 INFO L290 TraceCheckUtils]: 40: Hoare triple {103301#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483639))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {103301#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483639))} is VALID [2022-02-21 03:04:39,751 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {103301#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483639))} is VALID [2022-02-21 03:04:39,751 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:04:39,751 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:04:39,752 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:04:39,752 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:04:39,752 INFO L290 TraceCheckUtils]: 34: Hoare triple {103320#(<= 0 (+ 2147483638 |ULTIMATE.start_main_~a~0#1|))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {103320#(<= 0 (+ 2147483638 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:39,753 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {103320#(<= 0 (+ 2147483638 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:04:39,753 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:04:39,753 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:04:39,754 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:04:39,754 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:04:39,755 INFO L290 TraceCheckUtils]: 28: Hoare triple {103339#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483637))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {103339#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483637))} is VALID [2022-02-21 03:04:39,755 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {103339#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483637))} is VALID [2022-02-21 03:04:39,755 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:04:39,756 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:04:39,756 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:04:39,756 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:04:39,757 INFO L290 TraceCheckUtils]: 22: Hoare triple {103358#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483636))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {103358#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483636))} is VALID [2022-02-21 03:04:39,757 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {103358#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483636))} is VALID [2022-02-21 03:04:39,757 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:04:39,758 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:04:39,758 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:04:39,758 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:04:39,759 INFO L290 TraceCheckUtils]: 16: Hoare triple {103377#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483635))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {103377#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483635))} is VALID [2022-02-21 03:04:39,759 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {103377#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483635))} is VALID [2022-02-21 03:04:39,759 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:04:39,760 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:04:39,760 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:04:39,760 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:04:39,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {103396#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483634))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {103396#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483634))} is VALID [2022-02-21 03:04:39,761 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {103396#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483634))} is VALID [2022-02-21 03:04:39,761 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:04:39,761 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:04:39,762 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:04:39,762 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:04:39,762 INFO L290 TraceCheckUtils]: 4: Hoare triple {103415#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483633))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {103415#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483633))} is VALID [2022-02-21 03:04:39,763 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~nondet1#1 && main_#t~nondet1#1 <= 2147483647; {103415#(<= 0 (+ |ULTIMATE.start_main_~a~0#1| 2147483633))} is VALID [2022-02-21 03:04:39,763 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:04:39,763 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_~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_~max~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; {102859#true} is VALID [2022-02-21 03:04:39,763 INFO L290 TraceCheckUtils]: 0: Hoare triple {102859#true} assume { :begin_inline_ULTIMATE.init } true; {102859#true} is VALID [2022-02-21 03:04:39,764 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:04:39,764 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548725912] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:04:39,764 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:04:39,764 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2022-02-21 03:04:39,764 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507498167] [2022-02-21 03:04:39,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:04:39,765 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:04:39,765 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:04:39,765 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:04:39,881 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:04:39,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-02-21 03:04:39,881 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:04:39,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-02-21 03:04:39,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2022-02-21 03:04:39,882 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)